BookRags.com Literature Guides Literature
Guides
Criticism & Essays Criticism &
Essays
Questions & Answers Questions &
Answers
Lesson Plans Lesson
Plans
My Bibliography Periodic Table U.S. Presidents Shakespeare Sonnet Shake-Up
Research Anything:        
History | Encyclopedias | Films | News | Create a Bibliography | More... Login | Register | Help
Not What You Meant?  There are 50 definitions for Neville.

Neville's algorithm

Print-Friendly
About 2 pages (435 words)

Bookmark and Share Know this topic well? Help others and get FREE products!

In mathematics, Neville's algorithm is an algorithm used for polynomial interpolation. Given n + 1 points, there is a unique polynomial of degree n which goes through the given points. Neville's algorithm evaluates this polynomial. Neville's algorithm is based on the Newton form of the interpolating polynomial and the recursion relation for the divided differences. It is similar to Aitken's algorithm, which is nowadays not used.

The algorithm

Given a set of n+1 data points (xi, yi) where no two xi are the same, the interpolating polynomial is the polynomial p of degree at most n with the property

p(xi) = yi for all i = 0,…,n

This polynomial exists and it is unique. Neville's algorithm evaluates the polynomial at some point x. Let pi,j denote the polynomial of degree ji which goes through the points (xk, yk) for k = i, i + 1, …, j. The pi,j satisfy the recurrence relation

<math> p_{i,i}(x) = y_i, \, </math> <math> 0 \le i \le n, \, </math>
<math> p_{i,j}(x) = \frac{(x-x_j)p_{i,j-1}(x) + (x_i-x)p_{i+1,j}(x)}{x_i-x_j}, \, </math> <math> 0\le i < j \le n. \, </math>

This recurrence can calculate p0,n(x), which is the value being sought. This is Neville's algorithm. For instance, for n = 4, one can use the recurrence to fill the triangular tableau below from the left to the right.

<math> p_{0,0}(x) = y_0 \, </math>
<math> p_{0,1}(x) \, </math>
<math> p_{1,1}(x) = y_1 \, </math> <math> p_{0,2}(x) \, </math>
<math> p_{1,2}(x) \, </math> <math> p_{0,3}(x) \, </math>
<math> p_{2,2}(x) = y_2 \, </math> <math> p_{1,3}(x) \, </math> <math> p_{0,4}(x) \, </math>
<math> p_{2,3}(x) \, </math> <math> p_{1,4}(x) \, </math>
<math> p_{3,3}(x) = y_3 \, </math> <math> p_{2,4}(x) \, </math>
<math> p_{3,4}(x) \, </math>
<math> p_{4,4}(x) = y_4 \, </math>

This process yields p0,4(x), the value of the polynomial going through the n + 1 data points (xi, yi) at the point x. This algorithm needs O(n2) elementary arithmetical operations.

References

External links

View More Summaries on Neville's algorithm
 
Ask any question on Neville's algorithm and get it answered FAST!
Answer questions in BookRags Q&A and earn points toward
discounted or even FREE Study Guides and other BookRags products!
Learn more about BookRags Q&A
Copyrights
Neville's algorithm from Wíkipedia. ©2006 by Wíkipedia. Licensed under the GNU Free Documentation License. View a list of authors or edit this article.

Article Navigation
Join BookRagslearn moreJoin BookRags




About BookRags | Customer Service | Report an Error | Terms of Use | Privacy Policy