How to overcome the numerical instability of the scheme of divided differences?

Details How to overcome the numerical instability of the scheme of divided differences? How to overcome the numerical instability of the scheme of divided differences?

2004-07-12

arxiv.org/abs/math/0407195v1

Mathematics

Numerical Analysis

19 pages, 4 figures

Scientific paper

The scheme of divided differences is widely used in many approximation and interpolation problems. Computing the Newton coefficients of the interpolating polynomial is the first step of the Bj\"{o}rck and Pereyra algorithm for solving Vandermonde systems of equations (Cf. \cite{bjorck: 70}). Very often this algorithm produces very accurate solution. The problem of determining the Newton coefficients is intimately related with the problem of evaluation the Lagrange interpolating polynomial, which can be realized by many algorithms. For these reasons we use the uniform approach and analyze also Aitken's algorithm of the evaluation of an interpolating polynomial. We propose new algorithms that are always numerically stable with respect to perturbation in the function values and more accurate than the Aitken's algorithm and the scheme of divided differences, even for complex data.

Affiliated with

Also associated with

No associations

Rating

How to overcome the numerical instability of the scheme of divided differences? does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with How to overcome the numerical instability of the scheme of divided differences?, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and How to overcome the numerical instability of the scheme of divided differences? will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-58389