Recurrence relations and fast algorithms
From MaRDI portal
Publication:1045714
DOI10.1016/j.acha.2009.07.005zbMath1182.65195OpenAlexW2138106543MaRDI QIDQ1045714
Publication date: 15 December 2009
Published in: Applied and Computational Harmonic Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.acha.2009.07.005
Computation of special functions and constants, construction of tables (65D20) Numerical approximation and evaluation of special functions (33F05) Numerical aspects of recurrence relations (65Q30)
Related Items (9)
SuperDC: Superfast Divide-And-Conquer Eigenvalue Decomposition With Improved Stability for Rank-Structured Matrices ⋮ Fast algorithms using orthogonal polynomials ⋮ A Hermite-based shallow water solver for a thin ``ocean over a rotating sphere ⋮ An extra-component method for evaluating fast matrix-vector multiplication with special functions ⋮ Revisiting the concentration problem of vector fields within a spherical cap: a commuting differential operator solution ⋮ An algorithm for the rapid evaluation of special function transforms ⋮ Recurrence relations and fast algorithms ⋮ Steerable Principal Components for Space-Frequency Localized Images ⋮ Preconditioned Legendre spectral Galerkin methods for the non-separable elliptic equation
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Recurrence relations and fast algorithms
- A fast spherical filter with uniform resolution
- Fast algorithms for spherical harmonic expansions. II.
- A Fast Algorithm for the Calculation of the Roots of Special Functions
- Preconditioned, Adaptive, Multipole-Accelerated Iterative Methods for Three-Dimensional First-Kind Integral Equations of Potential Theory
- A Stable and Efficient Algorithm for the Rank-One Modification of the Symmetric Eigenproblem
- A Divide-and-Conquer Algorithm for the Symmetric Tridiagonal Eigenproblem
- Fast Algorithms for Spherical Harmonic Expansions
- Calculation of Gauss Quadrature Rules
This page was built for publication: Recurrence relations and fast algorithms