Abstract
Fast, efficient and reliable algorithms for the discrete least-square approximation of scattered points on the torus T d and the sphere S 2 by trigonometric polynomials are presented. The algorithms are based on iterative CG-type methods in combination with fast Fourier transforms for nonequispaced data. The emphasis is on numerical aspects, in order to solve large scale problems. Numerical examples show the efficiency of the new algorithms.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
C. de Boor, Splinefunktionen (Birkhäuser, Basel, 1990).
R. DeVore and G. Lorentz, Constructive Approximation (Springer, Berlin, 1993).
J. Driscoll and D. Healy, Computing Fourier transforms and convolutions on the 2-sphere, Adv. in Appl. Math. 15 (1994) 202–240.
A. Dutt and V. Rokhlin, Fast Fourier transforms for nonequispaced data, SIAMJ. Sci. Statist. Comput. 14 (1993) 1368–1393.
H. Faßbender, On numerical methods for discrete least-squares approximation by trigonometric polynomials, Math. Comp. 66 (1997) 719–741.
G.E. Fasshauer and L.L. Schumaker, Scattered data fitting on the sphere, in: Mathematical Methods for Curves and Surfaces, Vol. II, eds. M. Dahlen, T. Lyche and L.L. Schumaker (Vanderbilt Univ. Press, Nashville, 1998) pp. 117–166.
H. Feichtinger and K. Gröchenig, Theory and practice of irregular sampling, in: Wavelets: Mathematics and Applications, eds. J. Benedetto and M. Frazier (CRC Press, Boca Raton, FL, 1993) pp. 305–363.
H. Feichtinger, K. Gröchenig and T. Strohmer, Efficient numerical methods in non-uniform sampling theory, Numer. Math. 69 (1995) 423–440.
M.S. Floater, How to approximate scattered data by least squares, Technical Report, Sintef Applied Mathematics (1998).
T. Foley, The map and blend scattered data interpolation on a sphere, Comput. Math. Appl. 24 (1992) 49–60.
W. Freeden, T. Gervens and M. Schreiner, Constructive Approximation on the Sphere (Oxford Univ. Press, Oxford, 1998).
K. Gröchenig and T. Strohmer, Numerical and theoretical aspects of non-uniform sampling of band-limited images, in: Theory and Practice of Nonuniform Sampling, ed. F. Marvasti (Kluwer/Plenum, 2001).
M. Hanke, Conjugate Gradient Type Method for Ill-posed Problems (Wiley, New York, 1995).
M.J. Mohlenkamp, A fast transform for spherical harmonics, J. Fourier Anal. Appl. 5 (1999) 159–184.
C.C. Paige and M.A. Saunders, LSQR: An algorithm for sparse linear equations and sparse least squares, ACM Trans. Math. Software 8 (1982) 43–71.
D. Potts, Fast algorithms for discrete polynomial transforms on arbitrary grids, Linear Algebra Appl., to appear.
D. Potts, G. Steidl and M. Tasche, Fast and stable algorithms for discrete spherical Fourier transforms, Linear Algebra Appl. 275 (1998) 433–450.
D. Potts, G. Steidl and M. Tasche, Fast Fourier transforms for nonequispaced data: A tutorial, in: Modern Sampling Theory: Mathematics and Applications, eds. J.J. Benedetto and P.J.S.G. Ferreira (Boston, 2001) pp. 247–270.
M. Rauth and T. Strohmer, Smooth approximation of potential fields from noisy scattered data, Geophysics 63 (1998) 85–94.
L. Reichel, G. Ammar and W. Gragg, Discrete least squares approximation by trigonometric polynomials, Math. Comp. 57 (1991) 273–289.
Y. Saad, Iterative Methods for Sparse Linear Systems (PWS, Boston, 1996).
A.F. Ware, Fast approximate Fourier transforms for irregularly spaced data, SIAM Rev. 40 (1998) 838–856.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Potts, D. Approximation of Scattered Data by Trigonometric Polynomials on the Torus and the 2-sphere. Advances in Computational Mathematics 21, 21–36 (2004). https://doi.org/10.1023/B:ACOM.0000016432.97333.e8
Issue Date:
DOI: https://doi.org/10.1023/B:ACOM.0000016432.97333.e8