A fast algorithm for spherical basis approximation

MaRDI QIDQ3567750zbMATH OpenFDO

Authors Jens Keiner, Jürgen Prestin

Publication date 17 June 2010

zbMATH Keywords

approximation on the spherediscrete Fourier transformsfast algorithmnumerical exampleradial basis functionsscattered data interpolation

Mathematics Subject Classification ID

Multidimensional problems (41A63) Numerical interpolation (65D05) Numerical methods for discrete and fast Fourier transforms (65T50)

Recommendations

• Fast summation of radial functions on the sphere
• Fast and accurate interpolation of large scattered data sets on the sphere
• Interpolation on the sphere: a fast solution technique
• scientific article; zbMATH DE number 1795892
• Spherical interpolation using the partition of unity method: an efficient and flexible algorithm

Cited in

(10)

• Fast and efficient incremental algorithms for circular and spherical propagation in integer space
• Fast memory efficient evaluation of spherical polynomials at scattered points
• Convolutions on the sphere: commutation with differential operators
• Efficient reconstruction of functions on the sphere from scattered data
• Fast summation of radial functions on the sphere
• Interpolation on the sphere: a fast solution technique
• Fast evaluation of quadrature formulae on the sphere
• Spherical radial basis function approximation of some physical quantities measured
• Spherical basis function approximation with particular trend functions.
• Spherical panel clustering and its numerical aspects

This page was built for publication: A fast algorithm for spherical basis approximation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3567750)