Abstract
We study numerical properties of Clenshaw's algorithm for summing the series w = ∑n = 0Nbnpn where pn satisfy the linear three-term recurrence relation. We prove that under natural assumptions Clenshaw's algorithm is backward stable with respect to the data bn, n = 0,N.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
