Evaluation of Chebyshev polynomials by a three-term recurrence in floating-point arithmetic (Q1647657): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q5558293 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast algorithm for evaluation of normalized Hermite functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Error analysis of an algorithm for summing certain finite series / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5533821 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Accuracy and Stability of Numerical Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Error Analysis of the Modified Clenshaw Method for Evaluating Chebyshev and Fourier Series / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3579593 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The three-term recursion for Chebyshev polynomials is mixed forward-backward stable / rank
 
Normal rank

Latest revision as of 01:26, 16 July 2024

scientific article
Language Label Description Also known as
English
Evaluation of Chebyshev polynomials by a three-term recurrence in floating-point arithmetic
scientific article

    Statements

    Evaluation of Chebyshev polynomials by a three-term recurrence in floating-point arithmetic (English)
    0 references
    0 references
    0 references
    0 references
    26 June 2018
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    Chebyshev polynomials
    0 references
    three-term recurrence
    0 references
    floating-point arithmetic
    0 references
    upper and lower error bound
    0 references
    0 references
    0 references
    0 references
    0 references