A fast and simple algorithm for the computation of Legendre coefficients
From MaRDI portal
(Redirected from Publication:629903)
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)- On the efficient parallel computation of Legendre transforms
- Arnoldi-based model order reduction for linear systems with inhomogeneous initial conditions
- Dimension reduction for \(k\)-power bilinear systems using orthogonal polynomials and Arnoldi algorithm
- On the optimal estimates and comparison of Gegenbauer expansion coefficients
- Fast algorithms for the multi-dimensional Jacobi polynomial transform
- scientific article; zbMATH DE number 6459708 (Why is no real title available?)
- On fast algorithms for the evaluation of Legendre coefficients
- 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
- Model order reduction of MIMO bilinear systems by multi-order Arnoldi method
- On expansions in orthogonal polynomials
- On the convergence rates of Legendre approximation
- Reconstruction of sparse Legendre and Gegenbauer expansions
- Fast and accurate computation of Chebyshev coefficients in the complex plane
- A Hybrid Analytical-Numerical Technique for Elliptic PDEs
- On rapid computation of expansions in ultraspherical polynomials
- On the computation of discrete Legendre polynomial coefficients
- \(\mathcal{O}(1)\) computation of Legendre polynomials and Gauss-Legendre nodes and weights for parallel computing
- A fast FFT-based discrete Legendre transform
- A faster multipole Legendre-Chebyshev transform
- A fast, simple, and stable Chebyshev-Legendre transform using an asymptotic formula
- Representation of sparse Legendre expansions
- 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
- An algorithm for the convolution of Legendre series
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)
