Fast memory efficient evaluation of spherical polynomials at scattered points
DOI10.1007/S10444-014-9354-3zbMATH Open1308.65226OpenAlexW2036020147MaRDI QIDQ2017608FDOQ2017608
Pencho Petrushev, Kamen Ivanov
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
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
- 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
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)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A method for numerical integration on an automatic computer
- Computing Fourier transforms and convolutions on the 2-sphere
- Fast spherical Fourier algorithms.
- Fast decreasing polynomials
- Fast algorithms for spherical harmonic expansions. II.
- Localized Tight Frames on Spheres
- Orthogonal polynomials
- Fast Fourier Transforms for Nonequispaced Data
- Decomposition of spaces of distributions induced by tensor product bases
- Irregular sampling of band-limited functions on the sphere
- Sub-exponentially localized kernels and frames induced by orthogonal expansions
- Fast algorithms for spherical harmonic expansions. III
- A Fast Algorithm for the Calculation of the Roots of Special Functions
- Mechanische Quadraturen mit positiven Cotesschen Zahlen
- Spline Functions on Triangulations
- Decomposition of Besov and Triebel-Lizorkin spaces on the sphere
- A fast and stable method for rotating spherical harmonic expansions
- Generalized Jacobi Weights, Christoffel Functions, and Jacobi Polynomials
- A fast transform for spherical harmonics
Cited In (7)
- Approximation and localized polynomial frame on double hyperbolic and conic domains
- Highly effective stable evaluation of bandlimited functions on the sphere
- Approximation and localized polynomial frame on conic domains
- Efficient and accurate computation of spherical mean values at scattered center points
- 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
Uses Software
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)
