Truncated Laurent expansions for the fast evaluation of thin plate splines (Q1315191): Difference between revisions

Thin plate splines are highly useful for approximation of functions of two variables, partly because they provide the interpolant to scattered function values that minimizes a 2-norm of second derivatives. On the other hand, they have the severe disadvantage that the explicit calculation of a thin plate spline approximation requires a log function to be evaluated \(m\) times, where \(m\) is the number of ``\(r^ 2\log r^ 2\)'' terms that occur. The author considers a recent technique that saves a lot of work when \(m\) is large by forming sets of terms, and then the total contribution to the thin plate spline from the terms of each set is estimated by a single truncated Laurent expansion. In order to apply this technique, one has to pick the sets, one has to generate the coefficients of the expansions, and one has to decide which expansions give enough accuracy when the values of the spline is required at a general point of \(\mathbb{R}^ 2\). The answers to these questions are different from those that are given elsewhere, as this author prefers to refine sets of terms recursively by splitting them into two rather than four subsets. Some theoretical properties and several numerical results of this method are presented. He shows that the work to calculate all the Laurent coefficients is usually \(O(m\log m)\), and then only \(O(\log m)\) operations are needed.