A fast and simple algorithm for the computation of Legendre coefficients
DOI10.1007/S00211-010-0352-1zbMATH Open1211.33001OpenAlexW1976782593MaRDI QIDQ629903FDOQ629903
Authors: Arieh Iserles 
Publication date: 10 March 2011
Published in: Numerische Mathematik (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00211-010-0352-1
Recommendations
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)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Is Gauss Quadrature Better than Clenshaw–Curtis?
- Accuracy and stability of computing high-order derivatives of analytic functions by Cauchy integrals
- Fast algorithms for discrete polynomial transforms
- The spectral problem for a class of highly oscillatory Fredholm integral operators
- A Fast Algorithm for the Evaluation of Legendre Expansions
- Highly oscillatory quadrature
Cited In (20)
- On the efficient parallel computation of Legendre transforms
- Arnoldi-based model order reduction for linear systems with inhomogeneous initial conditions
- Title not available (Why is that?)
- On the optimal estimates and comparison of Gegenbauer expansion coefficients
- Fast algorithms for the multi-dimensional Jacobi polynomial transform
- Preconditioned Legendre spectral Galerkin methods for the non-separable elliptic equation
- Fast polynomial transforms based on Toeplitz and Hankel matrices
- How much faster does the best polynomial approximation converge than Legendre projection?
- A matrix method for fractional Sturm-Liouville problems on bounded domain
- On expansions in orthogonal polynomials
- Model order reduction of MIMO bilinear systems by multi-order Arnoldi method
- On the convergence rates of Legendre approximation
- Reconstruction of sparse Legendre and Gegenbauer expansions
- A Hybrid Analytical-Numerical Technique for Elliptic PDEs
- On rapid computation of expansions in ultraspherical polynomials
- Dimension reduction for k-power bilinear systems using orthogonal polynomials and Arnoldi algorithm
- On the computation of discrete Legendre polynomial coefficients
- \(\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
- Rapidly computing sparse Legendre expansions via sparse Fourier transforms
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)
