A fast and simple algorithm for the computation of Legendre coefficients
From MaRDI portal
hypergeometric functionLegendre polynomialsfast Fourier transformCauchy theoremalgorithm analytic functiontruncated Taylor expansion
Elliptic functions and integrals (33E05) Integration, integrals of Cauchy type, integral representations of analytic functions in the complex plane (30E20) Approximation in the complex plane (30E10) Numerical methods for discrete and fast Fourier transforms (65T50) Software, source code, etc. for problems pertaining to special functions (33-04)
Recommendations
Cites work
- scientific article; zbMATH DE number 3150170 (Why is no real title available?)
- scientific article; zbMATH DE number 3273551 (Why is no real title available?)
- A Fast Algorithm for the Evaluation of Legendre Expansions
- Accuracy and stability of computing high-order derivatives of analytic functions by Cauchy integrals
- Fast algorithms for discrete polynomial transforms
- Highly oscillatory quadrature
- Is Gauss Quadrature Better than Clenshaw–Curtis?
- The spectral problem for a class of highly oscillatory Fredholm integral operators
Cited in
(27)- How much faster does the best polynomial approximation converge than Legendre projection?
- On the efficient parallel computation of Legendre transforms
- On rapid computation of expansions in ultraspherical polynomials
- A faster multipole Legendre-Chebyshev transform
- On the computation of discrete Legendre polynomial coefficients
- scientific article; zbMATH DE number 6459708 (Why is no real title available?)
- On fast algorithms for the evaluation of Legendre coefficients
- An algorithm for the convolution of Legendre series
- Representation of sparse Legendre expansions
- Arnoldi-based model order reduction for linear systems with inhomogeneous initial conditions
- Preconditioned Legendre spectral Galerkin methods for the non-separable elliptic equation
- Dimension reduction for \(k\)-power bilinear systems using orthogonal polynomials and Arnoldi algorithm
- A Hybrid Analytical-Numerical Technique for Elliptic PDEs
- On expansions in orthogonal polynomials
- \(\mathcal{O}(1)\) computation of Legendre polynomials and Gauss-Legendre nodes and weights for parallel computing
- An algorithm for the numerical evaluation of the associated Legendre functions that runs in time independent of degree and order
- On the convergence rates of Legendre approximation
- Fast polynomial transforms based on Toeplitz and Hankel matrices
- On the optimal estimates and comparison of Gegenbauer expansion coefficients
- Model order reduction of MIMO bilinear systems by multi-order Arnoldi method
- A fast FFT-based discrete Legendre transform
- Fast algorithms for the multi-dimensional Jacobi polynomial transform
- A matrix method for fractional Sturm-Liouville problems on bounded domain
- Rapidly computing sparse Legendre expansions via sparse Fourier transforms
- Reconstruction of sparse Legendre and Gegenbauer expansions
- A fast, simple, and stable Chebyshev-Legendre transform using an asymptotic formula
- Fast and accurate computation of Chebyshev coefficients in the complex plane
This page was built for publication: A fast and simple algorithm for the computation of Legendre coefficients
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q629903)
