Recurrence relations and fast algorithms
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3172037 (Why is no real title available?)
- scientific article; zbMATH DE number 274379 (Why is no real title available?)
- A Divide-and-Conquer Algorithm for the Symmetric Tridiagonal Eigenproblem
- A Fast Algorithm for the Calculation of the Roots of Special Functions
- A Stable and Efficient Algorithm for the Rank-One Modification of the Symmetric Eigenproblem
- A fast spherical filter with uniform resolution
- Calculation of Gauss Quadrature Rules
- Fast Algorithms for Spherical Harmonic Expansions
- Fast algorithms for spherical harmonic expansions. II.
- Preconditioned, Adaptive, Multipole-Accelerated Iterative Methods for Three-Dimensional First-Kind Integral Equations of Potential Theory
- Recurrence relations and fast algorithms
Cited in
(12)- SuperDC: superfast divide-and-conquer eigenvalue decomposition with improved stability for rank-structured matrices
- Fast algorithms using orthogonal polynomials
- Recurrence relations and fast algorithms
- scientific article; zbMATH DE number 4007552 (Why is no real title available?)
- A Hermite-based shallow water solver for a thin ``ocean over a rotating sphere
- Fast recurrence relation for computer-generated-hologram
- Preconditioned Legendre spectral Galerkin methods for the non-separable elliptic equation
- Steerable principal components for space-frequency localized images
- An algorithm for finding recurrence relations of binomial sums and its complexity
- Revisiting the concentration problem of vector fields within a spherical cap: a commuting differential operator solution
- An extra-component method for evaluating fast matrix-vector multiplication with special functions
- An algorithm for the rapid evaluation of special function transforms
This page was built for publication: Recurrence relations and fast algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1045714)