Accurate evaluation of polynomials in Legendre basis (Q2336684)

From MaRDI portal
Revision as of 12:12, 21 March 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q59052157, #quickstatements; #temporary_batch_1711015421434)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    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
    0 references
    0 references
    0 references