O(1) computation of Legendre polynomials and Gauss-Legendre nodes and weights for parallel computing
DOI10.1137/110855442zbMATH Open1254.65038OpenAlexW1996630560MaRDI QIDQ2909301FDOQ2909301
Authors: B. Michiels, J. Fostier, I. Bogaert 
Publication date: 30 August 2012
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/110855442
Recommendations
- Fast and accurate computation of Gauss-Legendre and Gauss-Jacobi quadrature nodes and weights
- On the efficient parallel computation of Legendre transforms
- A fast and simple algorithm for the computation of Legendre coefficients
- Iteration-free computation of Gauss-Legendre quadrature nodes and weights
- A Fast Algorithm for the Evaluation of Legendre Expansions
algorithmsLegendre polynomialsnumerical examplescomplexityparallel computationGauss-Legendre quadrature
Computation of special functions and constants, construction of tables (65D20) Parallel numerical computation (65Y05) Numerical quadrature and cubature formulas (65D32) Approximate quadratures (41A55) Orthogonal polynomials and functions of hypergeometric type (Jacobi, Laguerre, Hermite, Askey scheme, etc.) (33C45)
Cited In (29)
- On the efficient parallel computation of Legendre transforms
- Noniterative computation of Gauss-Jacobi quadrature
- An iterative domain decomposition, spectral finite element method on non-conforming meshes suitable for high frequency Helmholtz problems
- Fast and reliable high-accuracy computation of Gauss-Jacobi quadrature
- Fast and backward stable transforms between spherical harmonic expansions and bivariate Fourier series
- Fast and Rigorous Arbitrary-Precision Computation of Gauss--Legendre Quadrature Nodes and Weights
- An improved error bound on Gauss quadrature
- On convergence rates of Fejér and Gauss-Chebyshev quadrature rules
- On the computation of Gaussian quadrature rules for Chebyshev sets of linearly independent functions
- High-order asymptotic expansions of Gaussian quadrature rules with classical and generalized weight functions
- On nodal point sets for flux reconstruction
- On efficient computation of highly oscillatory retarded potential integral equations
- Construction and implementation of asymptotic expansions for Jacobi-type orthogonal polynomials
- Error bounds for the numerical evaluation of Legendre polynomials by a three-term recurrence
- On the numerical evaluation of the prolate spheroidal wave functions of order zero
- Computing the associated Legendre polynomials through a matrix-eigenvalue algorithm
- Reconstruction of sparse Legendre and Gegenbauer expansions
- Explicit barycentric weights for polynomial interpolation in the roots or extrema of classical orthogonal polynomials
- The fast implementation of higher order Hermite-Fejér interpolation
- Fast, reliable and unrestricted iterative computation of Gauss-Hermite and Gauss-Laguerre quadratures
- A fractional Gauss-Jacobi quadrature rule for approximating fractional integrals and derivatives
- Fast algorithms using orthogonal polynomials
- Fast variants of the Golub and Welsch algorithm for symmetric weight functions in Matlab
- On the numerical calculation of the roots of special functions satisfying second order ordinary differential equations
- A faster multipole Legendre-Chebyshev transform
- On interpolation approximation: convergence rates for polynomial interpolation for functions of limited regularity
- On the nonoscillatory phase function for Legendre's differential equation
- On the numerical solution of second order ordinary differential equations in the high-frequency regime
- Rapidly computing sparse Legendre expansions via sparse Fourier transforms
This page was built for publication: \(\mathcal{O}(1)\) computation of Legendre polynomials and Gauss-Legendre nodes and weights for parallel computing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2909301)
