Fast evaluation of quadrature formulae on the sphere

DOI10.1090/S0025-5718-07-02029-7zbMath1128.65110MaRDI QIDQ5429506

Daniel Potts, Jens Keiner

Publication date: 30 November 2007

Published in: Mathematics of Computation (Search for Journal in Brave)

zbMATH Keywords

algorithmnumerical examplesspherical harmonicsquadraturetwo-spherenonequispaced fast spherical Fourier transform

Mathematics Subject Classification ID

Fourier series in special orthogonal functions (Legendre polynomials, Walsh functions, etc.) (42C10) Computation of special functions and constants, construction of tables (65D20) Numerical methods for discrete and fast Fourier transforms (65T50) Numerical quadrature and cubature formulas (65D32) Spherical harmonics (33C55)

Related Items (11)

An SVD in Spherical Surface Wave Tomography ⋮ Scattered data approximation on the bisphere and application to texture analysis ⋮ An efficient quadrature rule on the cubed sphere ⋮ On the computation of spherical designs by a new optimization approach based on fast spherical Fourier transforms ⋮ A Casimir preserving scheme for long-time simulation of spherical ideal hydrodynamics ⋮ On the computation of nonnegative quadrature weights on the sphere ⋮ A fast algorithm for nonequispaced Fourier transforms on the rotation group ⋮ Fast cross-validation in harmonic approximation ⋮ A fast and accurate algorithm for spherical harmonic analysis on HEALPix grids with applications to the cosmic microwave background radiation ⋮ Parameter Choice Strategies for Least-squares Approximation of Noisy Smooth Functions on the Sphere ⋮ Highly effective stable evaluation of bandlimited functions on the sphere

Uses Software

• FFTW

Cites Work

• Unnamed Item
• Unnamed Item
• A fast transform for spherical harmonics
• Fast and stable algorithms for discrete spherical Fourier transforms
• Computing Fourier transforms and convolutions on the 2-sphere
• A fast algorithm for filtering and wavelet decomposition on the sphere
• Fast spherical Fourier algorithms.
• FFTs for the 2-sphere-improvements and variations
• Constructive polynomial approximation on the sphere
• Fast construction of the Fejér and Clenshaw-Curtis quadrature rules
• On the associated orthogonal polynomials
• Spherical Marcinkiewicz-Zygmund inequalities and positive quadrature
• A fast spherical harmonics transform algorithm
• Fast algorithms for discrete polynomial transforms
• Fast Approximate Fourier Transforms for Irregularly Spaced Data
• Is Gauss Quadrature Better than Clenshaw–Curtis?
• Fast Algorithms for Spherical Harmonic Expansions
• How good can polynomial interpolation on the sphere be?

This page was built for publication: Fast evaluation of quadrature formulae on the sphere