Fast memory efficient evaluation of spherical polynomials at scattered points

DOI10.1007/S10444-014-9354-3MaRDI QIDQ2017608zbMATH OpenOpenAlexFDO

Authors Kamen Ivanov, Pencho Petrushev

Publication date 23 March 2015

Published in Advances in Computational Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10444-014-9354-3

zbMATH Keywords

spherical harmonicsevaluation at scattered pointsfast computationneedlets

Mathematics Subject Classification ID

Numerical quadrature and cubature formulas (65D32) Approximate quadratures (41A55) Spherical harmonics (33C55) Fourier series in special orthogonal functions (Legendre polynomials, Walsh functions, etc.) (42C10) Numerical methods in Fourier analysis (65T99)

Recommendations

• Fast parallel multi-point evaluation of sparse polynomials
• Fast Algorithms for Spherical Harmonic Expansions
• Fast evaluation of quadrature formulae on the sphere
• Efficient evaluation of 1-D and 2-D polynomials at equispaced points
• A fast algorithm for spherical basis approximation
• scientific article; zbMATH DE number 5872171
• On rapid computation of expansions in ultraspherical polynomials
• On the parallel evaluation of a sparse polynomial at a point
• scientific article; zbMATH DE number 1083142
• Efficient Approximate Scaling of Spherical Functions in the Fourier Domain With Generalization to Hyperspheres

Cites work

• scientific article; zbMATH DE number 3477793 (Why is no real title available?)
• scientific article; zbMATH DE number 477682 (Why is no real title available?)
• scientific article; zbMATH DE number 3367521 (Why is no real title available?)
• scientific article; zbMATH DE number 3081880 (Why is no real title available?)
• A Fast Algorithm for the Calculation of the Roots of Special Functions
• A fast and stable method for rotating spherical harmonic expansions
• A fast transform for spherical harmonics
• A method for numerical integration on an automatic computer
• Computing Fourier transforms and convolutions on the 2-sphere
• Decomposition of Besov and Triebel-Lizorkin spaces on the sphere
• Decomposition of spaces of distributions induced by tensor product bases
• Fast Fourier Transforms for Nonequispaced Data
• Fast algorithms for spherical harmonic expansions. II.
• Fast algorithms for spherical harmonic expansions. III
• Fast decreasing polynomials
• Fast spherical Fourier algorithms.
• Generalized Jacobi Weights, Christoffel Functions, and Jacobi Polynomials
• Irregular sampling of band-limited functions on the sphere
• Localized Tight Frames on Spheres
• Mechanische Quadraturen mit positiven Cotesschen Zahlen
• Orthogonal polynomials
• Spline Functions on Triangulations
• Sub-exponentially localized kernels and frames induced by orthogonal expansions

Cited in

(7)

• Approximation and localized polynomial frame on double hyperbolic and conic domains
• Fast and efficient incremental algorithms for circular and spherical propagation in integer space
• Efficient reconstruction of functions on the sphere from scattered data
• Fully discrete needlet approximation on the sphere
• Approximation and localized polynomial frame on conic domains
• Efficient and accurate computation of spherical mean values at scattered center points
• Highly effective stable evaluation of bandlimited functions on the sphere

Describes a project that uses

Uses Software

• Chebfun

This page was built for publication: Fast memory efficient evaluation of spherical polynomials at scattered points

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