Abstract
We investigate the computation and stability of hierarchical Newton interpolation formulas using \(\Re \)-Leja sequences. We carry out a thorough study, in particular from the angle of rounding errors (underflow/overflow), cost, and numerical stability. Furthermore, conditionings of Newton formulas are addressed and moderate estimates are derived.
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
