Error analysis of an algorithm for summing certain finite series
From MaRDI portal
Publication:5545038
DOI10.1017/S1446788700005267zbMath0159.45104MaRDI QIDQ5545038
Publication date: 1968
Published in: Journal of the Australian Mathematical Society (Search for Journal in Brave)
Related Items
Evaluation of Chebyshev polynomials by a three-term recurrence in floating-point arithmetic ⋮ Rounding error analysis of linear recurrences using generating series ⋮ The three-term recursion for Chebyshev polynomials is mixed forward-backward stable ⋮ Accurate polynomial root-finding methods for symmetric tridiagonal matrix eigenproblems ⋮ Accurate evaluation of a polynomial in Chebyshev form ⋮ On algorithms for the summation of certain special functions ⋮ Stability of parallel algorithms to evaluate Chebyshev series ⋮ Rounding error bounds for the Clenshaw and Forsythe algorithms for the evaluation of orthogonal polynomial series ⋮ Evaluation of Chebyshev Polynomials on Intervals and Application to Root Finding
Cites Work