Error analysis of an algorithm for summing certain finite series

DOI10.1017/S1446788700005267MaRDI QIDQ5545038zbMATH OpenFDO

Authors David Elliott

Publication date 1968

Published in Journal of the Australian Mathematical Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/S1446788700005267

zbMATH Keywords

numerical analysis

Cites work

• An Algorithm for Summing Orthogonal Polynomial Series and their Derivatives with Applications to Curve-Fitting and Interpolation
• Error Analysis of Miller's Recurrence Algorithm

Cited in

(11)

• On algorithms for the summation of certain special functions
• Evaluation of Chebyshev polynomials by a three-term recurrence in floating-point arithmetic
• The three-term recursion for Chebyshev polynomials is mixed forward-backward stable
• Evaluation of Chebyshev Polynomials on Intervals and Application to Root Finding
• Accurate polynomial root-finding methods for symmetric tridiagonal matrix eigenproblems
• Accurate evaluation of a polynomial in Chebyshev form
• Stability of parallel algorithms to evaluate Chebyshev series
• Rounding error bounds for the Clenshaw and Forsythe algorithms for the evaluation of orthogonal polynomial series
• Rounding error analysis of linear recurrences using generating series
• Numerical methods for the simulation of quantum walks and quantum annealing
• Parameterizing intersecting surfaces via invariants

This page was built for publication: Error analysis of an algorithm for summing certain finite series

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5545038)