Accurate evaluation of polynomials in Legendre basis (Q2336684): Difference between revisions
From MaRDI portal
Changed an Item |
Created claim: Wikidata QID (P12): Q59052157, #quickstatements; #temporary_batch_1711015421434 |
||
(4 intermediate revisions by 3 users not shown) | |||
Property / describes a project that uses | |||
Property / describes a project that uses: XBLAS / rank | |||
Normal rank | |||
Property / describes a project that uses | |||
Property / describes a project that uses: mctoolbox / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1155/2014/742538 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2099417434 / rank | |||
Normal rank | |||
Property / Wikidata QID | |||
Property / Wikidata QID: Q59052157 / rank | |||
Normal rank |
Latest revision as of 12:12, 21 March 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
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