CALCULUS Understanding Its Concepts and Methods
Home Contents Index
Neville's polynomial interpolation algorithm
Neville's Iterated Interpolation Algorithm starts with n + 1 constant functions ci(x) = yi, uses pairs of such functions to construct linear functions through pairs of points, then uses pairs of these linear functions to produce quadratic polynomials that go through three consecutive points, and so forth, until it produces a polynomial of degree at most n that goes through all n + 1 points.
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
Copyright © 2006 Darel Hardy, Fred Richman, Carol Walker, Robert Wisner. All rights reserved. Except upon the express prior permission in writing, from the authors, no part of this work may be reproduced, transcribed, stored electronically, or transmitted in any form by any method.