On thin plate spline interpolation
M. Loehndorf, J.M. Melenk

TL;DR
This paper provides a PDE-based proof for improved error estimates in thin plate spline interpolation and demonstrates the effectiveness of ${ m f H}$-matrix techniques for large-scale problems.
Contribution
It introduces a new PDE-based proof for error estimate improvements and applies ${ m f H}$-matrix methods to efficiently solve large interpolation problems.
Findings
Error estimates can be improved by $h^{1/2}$
${ m f H}$-matrix techniques are effective for large problems
The proof simplifies understanding of error bounds in spline interpolation
Abstract
We present a simple, PDE-based proof of the result [M. Johnson, 2001] that the error estimates of [J. Duchon, 1978] for thin plate spline interpolation can be improved by . We illustrate that -matrix techniques can successfully be employed to solve very large thin plate spline interpolation problems
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
On thin plate spline interpolation
M. Löhndorf
Kapsch TrafficCom, Am Europlatz 2, A-1120 Wien
J.M. Melenk
Technische Universität Wien, A-1040 Wien [email protected]
Abstract
We present a simple, PDE-based proof of the result [17] by M. Johnson that the error estimates of J. Duchon [11] for thin plate spline interpolation can be improved by . We illustrate that -matrix techniques can successfully be employed to solve very large thin plate spline interpolation problems.
1 Introduction and Main Results
Interpolation with so-called thin plate splines (also known as surface splines, -splines, or polyharmonic splines) is a classical topic in spline theory. It is concerned with the following interpolation problem (1): Given a (sufficiently smooth) function and points , , find the minimizer of the problem
[TABLE]
Here, the seminorm is induced by the bilinear form
[TABLE]
For and under very mild conditions on the point distribution, a unique minimizer exists. The name “thin plate splines” originates from the fact in the simplest case , can be represented in terms of translates of the fundamental solution of the biharmonic equation. For general the interpolant can be expressed in terms fundamental solutions of : There are constants , , and a polynomial of degree such that (with the Euclidean norm on )
[TABLE]
where is given explicitly by
[TABLE]
The representation (3) allows one to reformulate (1) as the problem of finding the coefficients and the polynomial so that the (constrained) interpolation problem (3) is solved. The classical error analysis for (1) is formulated in terms fill-distance: For a bounded domain and points , the fill distance is given by
[TABLE]
Starting with the seminal papers by J. Duchon [12, 11] the error on is controlled in terms of and the regularity properties of (on ):
Proposition 1.1** ([11, Prop. 3])**
Let be a bounded Lipschitz domain. Let , , be such that . Then, there are constants , , depending only on , , such that for any collection with fill distance
[TABLE]
here, denotes the minimum norm extension of defined in (8).
In Proposition 1.1 and throughout the present note, we will use the standard notation for Sobolev spaces and Besov spaces ; we refer to [26] for their definition. Interpolation space will always be understood by the so-called “real method” (also known as “-method”) as described, e.g., in [26, 27]. We will use extensively that the scales of Sobolev and Besov spaces are interpolation spaces. We will also use the notation .
It is worth noting that the interpolation operator is a projection so that . Proposition 1.1 applied to the function therefore yields
Corollary 1.2
Under the assumptions of Proposition 1.1 there holds
[TABLE]
A natural question in connection with Proposition 1.1 is whether the convergence rate can be improved by requiring additional regularity of . It turns out that boundary effects limits this. We mention that a doubling of the convergence rate is possible by imposing certain homogeneous boundary conditions on high order derivatives as shown in [22] and, more abstractly, in [24]. If this highly fortuitous setting is not given, then only a small further gain is possible as shown by M. Johnson, [17, 18]. For example, he showed that a gain of is possible if and is sufficiently smooth. The purpose the present note is to give a short and simple proof of this result using different tools, namely, those from elliptic PDE theory. The techniques also open the door to reducing the smoothness assumptions on in [17, 18] to Lipschitz continuity as discussed in more detail in Remark 2.8. Our main result therefore is a simpler proof of:
Proposition 1.3** ([17])**
Let be a bounded Lipschitz domain with sufficiently smooth boundary. Then there are constants , , that depend solely on , , , and such that for any collection with fill distance there holds
[TABLE]
In particular, therefore, the estimates of [11, Prop. 3] (i.e., Prop. 1.1) can be improved by for and by for .
Remark 1.4
*A common route to error estimates for is via the so-called “power function” . Indeed, classical pointwise estimates take the form (cf., e.g., [8, Prop. 5.3], [29, Thm. 11.4]) and is subsequently estimated in terms of the fill distance . Thus, Proposition 1.3 allows for improving estimates in this setting. *
We close this section by referring the reader to the monographs [29, 8] as well as [16] for further details on the approximation properties of radial basis functions, in particular, thin plate splines.
2 Proof of Proposition 1.3
2.1 Tools
The precise formulation of the minimization problem (1) is based on the classical Beppo-Levi space , which is defined as
[TABLE]
We refer to [10] and [29, Sec. 10.5] for more properties of the space ; in particular, is dense in (see [29, Thm. 10.40] for the precise notion). We also need the minimum norm extension given by
[TABLE]
The minimization property in (8) implies the orthogonality
[TABLE]
The connection with elliptic PDE theory arises from the fact that satisfies an elliptic PDE in :
[TABLE]
It will be convenient to decompose as , where
[TABLE]
The trace mapping is continuous for ; however, the limiting case is not true; it is true if the Sobolev space is replaced with the slightly smaller Besov space :
Lemma 2.1** (Trace theorem)**
Let be a Lipschitz domain, . Then there exists such that the multiplicative estimate holds as well as
[TABLE]
Proof. The case in (11) follows immediately from the case . The case is discussed in [27, Thm. 2.9.3] for the case of a half-space. The generalization to Lipschitz domains can be found, for example, in [1, Lemma 1.10].
2.2 An interpolation argument
The following technical result, which is of independent interest, will be used to reduce regularity assumptions to .
Lemma 2.2
Let be two Banach spaces with continuous embedding. Let , . Define (by the real method of interpolation) for . Let be fixed and assume that satisfies for some , ,
[TABLE]
Then there exists a constant that is independent of such that
[TABLE]
Proof. We start with the special case and we abbreviate . Let . By definition of the -functional we may choose with
[TABLE]
Using the linearity of , we can bound
[TABLE]
We now use the bound from [7, eqn. (2.8)] and then (see, e.g., [27, Thm. 1.3.3]) to conclude
[TABLE]
We now consider the general case . We choose as in (12) and proceed as above to get
[TABLE]
In order to treat the terms involving for , we use the reiteration theorem to infer , where is given by
[TABLE]
Next, the interpolation inequality together with the elementary bound (, , , with ) gives
[TABLE]
Inserting this result in (13), we get together with (12)
[TABLE]
Reasoning as in the case now allows us to conclude the argument.
2.3 Elliptic regularity
Lemma 2.3
Let be a bounded Lipschitz domain with a smooth boundary. Let and . Then there is depending only on , , such that the following is true: If and is the (variational) solution of the Dirichlet problem
[TABLE]
then with the a priori bound
[TABLE]
Proof. This regularity result is a special case of a more general result for the regularity of solutions of elliptic systems, [2, 3]. Self-contained proofs of this result can also be found, for example, in [30, Sec. 20] and in [19, Chap. 2, Thm. 8.2]. The minimum norm extension satisfies
[TABLE]
However, for smooth , it has additional mapping properties:
Corollary 2.4
Let be a bounded Lipschitz domain with a smooth boundary and let be contained in the (open) ball of radius centered at [math]. For each there is a constant depending only on , , and such that the following is true for the minimum norm extension : It is also a bounded linear map and, with denoting the trace operator for ,
[TABLE]
Proof. We write . The operator is clearly a bounded linear map . From Lemma 2.3, we also see that maps boundedly into : We denote by the universal extension operator of [25, Chap. VI, 3], which we may choose such that . Next, we write in the form , where (since ) and solves the differential equation
[TABLE]
Lemma 2.3 then gives with the a priori estimate . We have thus obtained
[TABLE]
An interpolation argument then gives us
[TABLE]
By the trace theorem (Lemma 2.1), we arrive at for .
2.4 PDE-based proof of Proposition 1.3
Lemma 2.5
Let be a Lipschitz domain. Then
[TABLE]
Proof. We exploit that in . To that end, let again be the universal extension of operator of [25, Chap. VI, 3]. We write for some with . We get
[TABLE]
where we used integration by parts and that ; the integration by parts does not produce any terms “at infinity” since is dense in (in the sense described in [29, Thm. 10.40]) and thus can be approximated by such compactly supported functions. The continuity of implies
[TABLE]
and the reduction to a seminorm follows from the Deny-Lions Lemma and fact that reproduces polynomials of degree . The solution of the minimization problem (1) satisfies the orthogonality condition
[TABLE]
since and , . Therefore,
[TABLE]
These last two terms are treated separately in Lemmas 2.6, 2.7. Inserting (19), (21) in (18) we get
[TABLE]
which readily implies (6) of Proposition 1.3. The bound (7) follows from (6) and an interpolation argument since the reiteration theorem asserts for that and , which follows from combining (17) and (14).
Lemma 2.6
Let be a Lipschitz domain. Then:
[TABLE]
Proof. Let . Integration by parts once gives
[TABLE]
The multiplicative trace inequality , Corollary 1.2 with , and the trace estimate yield
[TABLE]
We conclude that the linear functional satisfies
[TABLE]
since Lemma 2.2 implies the estimate (19). We now turn to the second part of (20). The key step is to observe that the minimum norm extension satisfies the homogeneous differential equation in .
Lemma 2.7
Let be a bounded Lipschitz domain with a sufficiently smooth boundary. Then:
[TABLE]
Proof. Let . By Corollary 2.4, we have for every sufficiently large. Furthermore, in . Next, -fold integration by parts yields
[TABLE]
The integration by parts does not produce any terms “at infinity” since is dense in (in the sense described in [29, Thm. 10.40]) and thus can be approximated by such compactly supported functions.
Since on for , we use again the multiplicative trace inequality and Corollary 1.2 to get
[TABLE]
We reduce the regularity requirement on by applying Lemma 2.2 to : We observe that the reiteration theorem of interpolation allows us to identify
[TABLE]
hence, we get (21) from an application of Lemma 2.2 with , and since we have additionally the stability bound by Lemma 2.5 and (16).
Remark 2.8** (Generalization to Lipschitz domains)**
The proof Proposition 1.3 relies on three ingredients: a) integration by parts arguments to treat , b) the approximation properties given in [11] of the thin plate spline interpolation operator , and c) regularity properties of . Ingredients a) and b) are already formulated for Lipschitz domains. However, the regularity properties of are delicate in their generalization to the case of Lipschitz domains. We note that solves in the Dirichlet problem
[TABLE]
*and [28, 23, 9] show a shift theorem by in the sense that for , one can control for . This together with careful integration by parts arguments for the treatment of allow for an extension of the proof of Proposition 1.3 to Lipschitz domain and will be given in [20]. *
3 Numerical example
We illustrate Proposition 1.3 for the case , i.e., the classical thin plate splines. We employ uniformly distributed nodes on two geometries, the unit square and the L-shaped domain . As usual, we denote . We interpolate 4 functions with different characters: the functions and , which are, for any , in and , respectively, and the smooth functions and , where the so-called Franke function is given by
[TABLE]
The results are presented in Fig. 1 and corroborate the assertions of Proposition 1.3, which read, for , with and . These numerical results were first presented at the conference [21].
3.1 -matrix techniques for solving the TPS interpolation problem
The numerical solution of the thin plate interpolation problem is numerically challenging since the system matrix is fully populated. Nevertheless, several approaches for fast solution techniques exist. For example, the matrix-vector multiplication can be realized in log-linear complexity using techniques from fast multipole methods. This leads to efficient solution strategies based on Krylov subspace methods provided suitable preconditioners are available. We refer to [29, Sec. 15], [8, Sec. 7.3] as starting points for a literature discussion. For our calculations, we employed related techniques based on the concept of -matrices, [14, 15]. -matrices come with an (approximate) factorization that can either be used as a solver (if the approximation is sufficiently accurate) or as a preconditioner in an iterative environment. The latter use has been advocated, in a different context, for example, in [4, 13].
For the case , the interpolation problem (3) results in a linear system of equations of the form
[TABLE]
The matrix is obtained by selecting a basis of (e.g., ) and setting . The vector collects the values , the vector the sought coefficients , and the vector is the Lagrange multiplier for the constrained problem (3). The function is smooth for . Lemma 3.1 below shows that the function can be approximated by a polynomial, which is in particular a separable function, i.e. a short sum of products of functions of and , only. This in turn implies that the fully populated matrix can in fact be approximated as a blockwise low-rank matrix, in particular in the form of an -matrix, [14, 15].
By forming a Schur complement, the linear system of (24) can be transformed to SPD form. To that end, we select three points and rearrange the problem (24) as
[TABLE]
where the vectors , and , result from the permutations. The Schur complement
[TABLE]
is SPD. We computed an (approximate) Cholesky factorization of using the library HLib [5]. This factorization can be employed as a preconditioner for a CG iteration. The -matrix structure of was ensured by so-called geometric clustering of the interpolation points. Specifically, we used this hierarchical structure to set up by approximating its entries with the Chebyshev interpolant as described in Lemma 3.1. In the interest of efficiency, the thus obtained -matrix approximation of was further modified by using SVD-based compression of blocks as well as coarsing of the block structure (these tools are provided by HLib). The matrix is a rank- update of the matrix , which can also be realized in HLib.
Lemma 3.1
Let be given. For any (closed) axiparallel boxes , and a polynomial degree denote by the tensor product Chebyshev interpolation operator associated with . Then there are constants , depending only on such that under the condition there holds
[TABLE]
Proof. The proof follows with the tool developed in [6]. Consider and a function . Denote by the Lebesgue constant for univariate Chebyshev interpolation (note that ). Introduce, for each and each , the univariate function by . Then, standard tensor product arguments [6, Lemma 3.3] show that the tensor product Chebyshev interpolation error is bounded by
[TABLE]
The best approximation problems in turn lead to exponentially small (in ) errors, provided the holomorphic extensions of the functions can be controlled. We show this for the case under consideration here. Note that , where and . Note and . As is shown in [6, Lemma 3.6, proof of Thm. 3.13], the holomorphic extension of the function is holomorphic on with and maps into the left half plane . We note that . In view of , we conclude for a constant that depends solely on . We finish the proof by observing that there is (depending only on and thus on ) such that contains the Bernstein ellipse (see [6, Lemma 3.12]). A classical polynomial approximation result (see, e.g., [6, Lemma 3.11]) concludes the proof.
3.2 Edge effects and concentrating points at the boundary
The convergence behavior of thin plate splines is limited by edge effects. Above, we mentioned that imposing certain boundary conditions on mitigates this effect. An alternative is to suitably concentrate points near . Without proof, we announce the following result:
Proposition 3.2
Assume that the points , , satisfy for a sufficiently small
[TABLE]
Then, for there holds .
Inserting the result of Proposition 3.2 in the estimates of Proposition 1.1 shows that a factor can be gained in the convergence estimates. Fig. 2 presents numerical examples for the square and the functions given in Sec. 3. We selected and distributed the points so as ensure the condition
[TABLE]
For the present case , it can then be shown that the number of points is , which is also illustrated in Fig. 2.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] V. Adolphsson and J. Pipher. The inhomogeneous Dirichlet problem for Δ 2 superscript Δ 2 \Delta^{2} in Lipschitz domains. J. Funct. Anal. , 159:137–190, 1998.
- 2[2] S. Agmon, A. Douglis, and L. Nirenberg. Estimates near the boundary for solutions of elliptic partial differential equations satisfying general boundary conditions I. Comm. Pure Appl. Math. , 12:623–727, 1959.
- 3[3] S. Agmon, A. Douglis, and L. Nirenberg. Estimates near the boundary for solutions of elliptic partial differential equations satisfying general boundary conditions II. Comm. Pure Appl. Math. , 17:35–92, 1964.
- 4[4] M. Bebendorf. Hierarchical LU decomposition-based preconditioners for BEM. Computing , 74(3):225–247, 2005.
- 5[5] S. Börm and L. Grasedyck. H-Lib - a library for ℋ ℋ \mathcal{H} - and ℋ 2 superscript ℋ 2 \mathcal{H}^{2} -matrices . available at http://www.hlib.org, 1999.
- 6[6] S. Börm and J.M. Melenk. Approximation of the high frequency Helmholtz kernel by nested directional interpolation: error analysis. Numer. Math. , (in press).
- 7[7] J. Bramble and R. Scott. Simultaneous approximation in scales of Banach spaces. Math. Comp. , 32:947–954, 1978.
- 8[8] M. D. Buhmann. Radial basis functions: theory and implementations , volume 12 of Cambridge Monographs on Applied and Computational Mathematics . Cambridge University Press, Cambridge, 2003.
