O(1) computation of Legendre polynomials and Gauss-Legendre nodes and weights for parallel computing
From MaRDI portal
Publication:2909301
algorithmscomplexityGauss-Legendre quadratureLegendre polynomialsnumerical examplesparallel computation
Orthogonal polynomials and functions of hypergeometric type (Jacobi, Laguerre, Hermite, Askey scheme, etc.) (33C45) Approximate quadratures (41A55) Computation of special functions and constants, construction of tables (65D20) Numerical quadrature and cubature formulas (65D32) Parallel numerical computation (65Y05)
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
Cited in
(32)- A fractional Gauss-Jacobi quadrature rule for approximating fractional integrals and derivatives
- On the numerical solution of second order ordinary differential equations in the high-frequency regime
- On the nonoscillatory phase function for Legendre's differential equation
- Error bounds for the numerical evaluation of Legendre polynomials by a three-term recurrence
- Fast and reliable high-accuracy computation of Gauss-Jacobi quadrature
- Computing the associated Legendre polynomials through a matrix-eigenvalue algorithm
- On the numerical evaluation of the prolate spheroidal wave functions of order zero
- An iterative domain decomposition, spectral finite element method on non-conforming meshes suitable for high frequency Helmholtz problems
- On nodal point sets for flux reconstruction
- On convergence rates of Fejér and Gauss-Chebyshev quadrature rules
- Fast and backward stable transforms between spherical harmonic expansions and bivariate Fourier series
- Fast, reliable and unrestricted iterative computation of Gauss-Hermite and Gauss-Laguerre quadratures
- On the efficient parallel computation of Legendre transforms
- An improved error bound on Gauss quadrature
- On the numerical calculation of the roots of special functions satisfying second order ordinary differential equations
- Construction and implementation of asymptotic expansions for Jacobi-type orthogonal polynomials
- Explicit barycentric weights for polynomial interpolation in the roots or extrema of classical orthogonal polynomials
- Reconstruction of sparse Legendre and Gegenbauer expansions
- Fast and Rigorous Arbitrary-Precision Computation of Gauss--Legendre Quadrature Nodes and Weights
- Noniterative computation of Gauss-Jacobi quadrature
- Fast variants of the Golub and Welsch algorithm for symmetric weight functions in Matlab
- <scp>ParaStieltjes</scp>: Parallel computation of Gauss quadrature rules using a <scp>Parareal</scp>‐like approach for the Stieltjes procedure
- On efficient computation of highly oscillatory retarded potential integral equations
- Rapidly computing sparse Legendre expansions via sparse Fourier transforms
- The fast implementation of higher order Hermite-Fejér interpolation
- On interpolation approximation: convergence rates for polynomial interpolation for functions of limited regularity
- On the computation of Gaussian quadrature rules for Chebyshev sets of linearly independent functions
- Fast algorithms using orthogonal polynomials
- High-order asymptotic expansions of Gaussian quadrature rules with classical and generalized weight functions
- A faster multipole Legendre-Chebyshev transform
- A variational framework for the complexity of PDE solutions
- Polynomial-augmented neural networks (PANNs) with weak orthogonality constraints for enhanced function and PDE approximation
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)
