Error bounds for the numerical evaluation of Legendre polynomials by a three-term recurrence (Q2035853): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: $\mathcal{O}(1)$ Computation of Legendre Polynomials and Gauss--Legendre Nodes and Weights for Parallel Computing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast and Accurate Computation of Gauss--Legendre and Gauss--Jacobi Quadrature Nodes and Weights / rank
 
Normal rank
Property / cites work
 
Property / cites work: Accuracy and Stability of Numerical Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Evaluation of Chebyshev polynomials by a three-term recurrence in floating-point arithmetic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inequalities involving Gegenbauer polynomials and their tangent lines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Evaluation of Legendre polynomials by a three-term recurrence in floating-point arithmetic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast and Rigorous Arbitrary-Precision Computation of Gauss--Legendre Quadrature Nodes and Weights / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3579593 / rank
 
Normal rank

Revision as of 01:33, 26 July 2024

scientific article
Language Label Description Also known as
English
Error bounds for the numerical evaluation of Legendre polynomials by a three-term recurrence
scientific article

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references