Error bounds for the numerical evaluation of Legendre polynomials by a three-term recurrence
From MaRDI portal
Publication:2035853
DOI10.1553/etna_vol54s323zbMath1464.65021OpenAlexW3154259272MaRDI QIDQ2035853
Sebastian Schmutzhard, Tomasz Hrycak
Publication date: 25 June 2021
Published in: ETNA. Electronic Transactions on Numerical Analysis (Search for Journal in Brave)
Full work available at URL: http://etna.mcs.kent.edu/volumes/2021-2030/vol54/abstract.php?vol=54&pages=323-332
Computation of special functions and constants, construction of tables (65D20) Numerical approximation and evaluation of special functions (33F05) Numerical aspects of recurrence relations (65Q30)
Uses Software
Cites Work
- Unnamed Item
- Evaluation of Chebyshev polynomials by a three-term recurrence in floating-point arithmetic
- $\mathcal{O}(1)$ Computation of Legendre Polynomials and Gauss--Legendre Nodes and Weights for Parallel Computing
- Fast and Rigorous Arbitrary-Precision Computation of Gauss--Legendre Quadrature Nodes and Weights
- Accuracy and Stability of Numerical Algorithms
- Inequalities involving Gegenbauer polynomials and their tangent lines
- Fast and Accurate Computation of Gauss--Legendre and Gauss--Jacobi Quadrature Nodes and Weights
- Evaluation of Legendre polynomials by a three-term recurrence in floating-point arithmetic
This page was built for publication: Error bounds for the numerical evaluation of Legendre polynomials by a three-term recurrence