Accurate evaluation of polynomials in Legendre basis (Q2336684): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / Wikidata QID
 
Property / Wikidata QID: Q59052157 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4791752 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4199478 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4904857 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5849046 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unified rounding error bound for polynomial evaluation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rounding error propagation in polynomial evaluation schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4522497 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rounding error bounds for the Clenshaw and Forsythe algorithms for the evaluation of orthogonal polynomial series / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial evaluation and associated polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Backward stability of Clenshaw's algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Accurate Sum and Dot Product / rank
 
Normal rank
Property / cites work
 
Property / cites work: Accurate evaluation of the \(k\)-th derivative of a polynomial and its application / rank
 
Normal rank
Property / cites work
 
Property / cites work: Accurate evaluation of a polynomial and its derivative in Bernstein form / rank
 
Normal rank
Property / cites work
 
Property / cites work: Accurate evaluation of a polynomial in Chebyshev form / rank
 
Normal rank
Property / cites work
 
Property / cites work: High-precision computation: mathematical physics and dynamics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Accuracy and Stability of Numerical Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4349924 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A floating-point technique for extending the available precision / rank
 
Normal rank
Property / cites work
 
Property / cites work: Accurate Floating-Point Product and Exponentiation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A General Condition Number for Polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Design, implementation and testing of extended and mixed precision BLAS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for accurate, validated and fast polynomial evaluation / rank
 
Normal rank

Latest revision as of 00:40, 21 July 2024

scientific article
Language Label Description Also known as
English
Accurate evaluation of polynomials in Legendre basis
scientific article

    Statements

    Accurate evaluation of polynomials in Legendre basis (English)
    0 references
    0 references
    0 references
    0 references
    19 November 2019
    0 references
    Summary: This paper presents a compensated algorithm for accurate evaluation of a polynomial in Legendre basis. Since the coefficients of the evaluated polynomial are fractions, we propose to store these coefficients in two floating point numbers, such as double-double format, to reduce the effect of the coefficients' perturbation. The proposed algorithm is obtained by applying error-free transformation to improve the Clenshaw algorithm. It can yield a full working precision accuracy for the ill-conditioned polynomial evaluation. Forward error analysis and numerical experiments illustrate the accuracy and efficiency of the algorithm.
    0 references
    0 references
    0 references
    0 references

    Identifiers