Interpolation. Chapter Interpolation. 7.2 Existence, Uniqueness and conditioning
|
|
- Clarence Gray
- 5 years ago
- Views:
Transcription
1 76
2 Chapter 7 Interpolation 7.1 Interpolation Definition Interpolation of a given function f defined on an interval [a,b] by a polynomial p: Given a set of specified points {(t i,y i } n with {t i} [a,b], the polynomial p of degree n 1 satisfying p(t i ) = y i, i = 1,,n is called an polynomial interpolation. The points {t i } are called nodes. 7.2 Existence, Uniqueness and conditioning be any linearly inde- More generally, we can use other bases. Let {φ j (t)} n j=1 pendent set of functions and set f(t) = n x j φ j (t). If we require f to interpolate the data {(t i,y i )} m, then we have f(t i ) = j=1 n x j φ j (t i ) = y i, i = 1,2,,m, j=1 which gives a system of equations Ax = y. 77
3 78 CHAPTER 7. INTERPOLATION 7.3 Polynomial Interpolation Monomial Interpolation We let P n (x) be the set of all polynomial of degree less or equal to n. To interpolate n+1 data by polynomials, we let k = n. Most naive choice is to let φ j (t) = t j, j = 0,1,,n Theorem For a given set of data {(t i,y i } n i=0, there exist a unique polynomial p P n (x) such that p(t i ) = y i, i = 1,2,,n. Proof. We want to find a polynomial of the form p = x 0 + x 1 t + + x n t n such that p(t i ) = y i, for i = 0,...,n, i.e, p(t 0 ) = x 0 +x 1 t 0 + +x n t n 0 = y 0 p(t n ) = x 0 +x 1 t n + +x n t n n = y n. In matrix form, 1 t 0 t n 0 1 t 1 t n x 0 y =. (7.1) 1 t n t n x n y n n The equation (7.1) involves a Van der Monde matrix whose determinant is i>j (t i t j ). Thus a unique solution exists as long as the interpolation points are distinct. Use nested multiplication(horner s method) for polynomial evaluations. A basis for V = P n A naive basis for P n (x) is {1,x,x 2,...,x n }. Is it convenient? No! There are other bases, and usually other bases are better. (1) To compute the coefficients in (7.1), one has to solve a linear system. (2) Moreover, the Van der Monde matrix is ill-conditioned.
4 7.3. POLYNOMIAL INTERPOLATION 79 Example Consider x y = 1+ǫ ( )x y = 1. (7.2) Without ǫ, the exact solution is x = 0,y = 1, while with ǫ perturbation, x = 10 9 ǫ, y = 10 9 ǫ 1 ǫ! Why Polynomial Interpolation? For example consider e x or sinx. How to evaluate or integrate them? (1) On a computer we approximate a given function by only arithmetic operations which is done by polynomial interpolation. Taylor series is rarely used. So Find a polynomial p(x) s.t. p(x i ) = e x i for i = 1,2,. This is better than Taylor series which loses accuracy when x is large. (non uniform error) Taylor series requires higher order derivatives which may be difficult to obtain or unavailable. (2) It is easier to handle Polynomial interpolations systematically (in solving the p.d.e. or integrations) Lagrange basis Suppose we wish to construct a linear interpolation with two points t 1 and t 2. Define Then L 1 (t) = t t 2 t 1 t 2, L 2 (t) = t t 1 t 2 t 1. L 1 (t 1 ) = 1, L 1 (t 2 ) = 0 L 2 (t 1 ) = 0, L 2 (t 2 ) = 1. Now given any data f(t 1 ) = y 1, f(t 2 ) = y 2, we can construct a linear interpolant by l(t) = y 1 L 1 (t)+y 2 L 2 (t). (7.3) We now generalize this. Given distinct nodes t 1,t 2,,t n, we construct polynomials L n,i (t)(i = 1,,n) such that L n,i (t j ) = δ ij, j = 1,,n. We can
5 80 CHAPTER 7. INTERPOLATION easily see that L n,i has the following form: L n,i (t) = C We set n (t t j ), for some C. j i L n,i (t i ) = C j i(t i t j ) = 1. Then we obtain C = 1/ j i (t i t j ) and hence L n,i (t) = j i (t t j ) (t i t j ). These are the Lagrange basis polynomials. Now using these, one can readily construction a polynomial interpolation. Proposition Let f C[a,b] and let p n 1 be the unique element of P n 1 (x) such that f(t i ) = p n (t i ), i = 1,1,...,n. Then the Lagrange interpolating polynomial is given by p n (t) = n f(t i ) (t t j ) (t i t j ). j i Newton s form of interpolating polynomial We now describe an efficient way of calculating the coefficients of an interpolating polynomial. Assume {(t i,y i } n is the given data set. In the Newton form of interpolating polynomial the following basis is taken: {1,(t t 1 ),(t t 1 )(t t 2 ),,(t t 1 )(t t 2 ) (t t n 1 )} We compute p n 1 (t) by induction. Since p n 1 (t) is one degree higher than p n 2 (t), one can set p n 1 (t) = p n 2 (t)+x n π n 1 (t), where j 1 π j (t) = (t t k ), j = 1,,n 1. k=1
6 7.3. POLYNOMIAL INTERPOLATION 81 Hence n 1 p n 1 (t) = p n 2 (t)+x n (t t i ) n 2 n 1 = p n 3 (t)+x n 1 (t t i )+x n (t t i ) n 1 = x 1 +x 2 (t t 1 )+x 3 (t t 1 )(t t 2 )+ +x n (t t i ). If we denote f[t 1,...,t k ] for x k, then p n 1 (t) = n k=1 (t t i ) x k k 1 n k=1 k 1 f[t 1,...,t k ] (t t i ). (7.4) This is called the Newton s form of interpolation and f[t 1,...,t k ] are called the divided difference. Now we study how to compute x k. Computing the divided difference Now we show how to compute f[t 1,...,t k ] efficiently. Assume p j (t) is constructed. For any j, p j+1 (t) = p j (t)+x j+1 π j+1 (t) is a polynomial of degree j that interpolates the same j points as p j. The free parameter x j+1 is chosen to so that p j+1 interpolates (j +1)-st points, i.e., Hence p j+1 (t j+1 ) = p j (t j+1 )+x j+1 π j+1 (t j+1 ) = y j+1. x j+1 = y j+1 p j (t j+1 ). π j+1 (t j+1 ) But in practice this formula is neither efficient nor stable for large k. It is known that x k = f[t 1,...,t k ] = f[t 2,...,t k ] f[t 1,...,t k 1 ] t k t 1. (7.5) Thus Newton s formula is useful when a new point of interpolation is added to an existing interpolation. Example Suppose we are given t 1,...,t n and p n. If we have one more
7 82 CHAPTER 7. INTERPOLATION point t n+1. Then p n is constructed by adding one more term to p n 1 : By (7.5) n 1 p n (t) = p n 1 (t)+f[t 1,...,t n 1,t n ] (t t i ). (7.6) Example (1) f[t i ] = f(t i ). (2) f[t 1,t 2 ] = f[t 2] f[t 1 ] t 2 t 1 = f(t 2) f(t 1 ) t 2 t 1. (3) f[t 1,t 2,t 3 ] = f[t 2,t 3 ] f[t 1,t 2 ] t 3 t 1. (4) p 2 (t) = f(t 1 )+f[t 1,t 2 ](t t 1 )+f[t 1,t 2,t 3 ](t t 1 )(t t 2 ). i=0 t 1 f[t 1 ] f[t 1,t 2 ] f[t 1,t 2,t 3 ] f[t 1,t 2,t 3,t 4 ] t 2 f[t 2 ] f[t 2,t 3 ] f[t 2,t 3,t 4 ] t 3 f[t 3 ] f[t 3,t 4 ] t 4 f[t 4 ] Orthogonal Polynomial Let <, > be the weighted inner product defined by < p,q >= b a p(t)q(t)w(t) dt. We say p,q are orthogonal w.r.t w if < p,q >= 0. If w = 1 on [ 1,1] then the orthogonal polynomials are Legendre polynomials. p 0 (t) = 1 2 (3t2 1), p 3 (t) = 1 2 (5t3 3t) p 4 (t) = 1 8 (35t4 30t 2 +3), p 5 (t) = 1 8 (63t5 70t 3 +15t) p 6 (t) = 1 24 (7 33t6 63 5t t 2 5)... Three-term recurrence relation of the form: p k+1 (t) = (α k t+β k )p k (t) γ k p k 1 (t) For Legendre polynomials, we have (k +1)P k+1 (t) = (2k +1)tP k (t) kp k 1 (t).
8 7.3. POLYNOMIAL INTERPOLATION 83 Table 7.1: Orthogonal Polynomials Name Symbol Interval Weight Legendre P k [ 1,1] 1 Chebysheff 1st T k [ 1,1] (1 t 2 ) 1/2 Chebysheff 2nd U k [ 1,1] (1 t 2 ) 1/2 Jacobi (α,β > 1) J k [ 1,1] (1 t) α (1+t) β Laguerre L k [0, ) e t Hermite H k (, ) e t Interpolating continuous function-chebysheff polynomials Thus we may assume f(x) = x n+1 and consider the following problem: We wish to have equi-oscillation property: To minimize n i=0 (x x i), we want to enforce uniform oscillations. This suggest a polynomial whose behavior is similar to a trigonometric function. Assume [a, b] = [ 1, 1]. Note that coskθ oscillates between 1 and 1 (k +1 times in [0,π]), i.e., coskθ j = ( 1) j, for θ j = jπ k, j = 0,,k. We let θ = cos 1 t and consider coskcos 1 t, i.e., T k (t) = cos[kcos 1 t], x [ 1,1]. Recall the addition formula for cosine function: coskθ +cos(k 2)θ = 2cosθcos(k 1)θ. Thus we obtain a recurrence relation T k+1 (t)+t k 1 (t) = 2tT k (t), k = 1,2,... From this we get T 0 = 1, T 1 (t) = t, T 2 (t) = 2t 2 1, T 3 (t) = 4t 3 3t,8t 4 8t 2 +1,16t 5 20t 3 +5t, So the coefficient of T k is 2 k 1, its maximum oscillation. T k (t) is called
9 84 CHAPTER 7. INTERPOLATION Chebysheff polynomial of the first kind. T k (t) = cos[kcos 1 x] = 2 k 1 (t t 0 )(t t 1 ) (t t n 1 ) (7.7) and hence max (t t 0 )(t t 1 ) (t t n 1 ) 2 1 k. (7.8) This is useful in interpolating(if the error term is given by the Chebysheff polynomial(up to certain constant factor), then the maximum error is distributed uniformly over the interval. Thus, we use these points to construct a polynomial interpolation for general f, and expect the error term f (k) (ξ) (k)! k 1 (t t i ) i=0 of this approximation is reasonably small in the maximum norm. Such points are called Chebysheff points. Since T k (t) = 0 at points where kcos 1 t = (2i 1)π/2, i.e., the Chebysheff points on [ 1,1] are ( ) (2i 1)π t k = cos, i = 1,...,k. 2k (Sometimes they use the extrema, t k = cos ( ) iπ k, i = 0,...,k. These are also called Chebysheff points) then If f C n [ 1,1] and p n 1 (x) is a interpolating polynomial at t 1,,t n f(t) p n 1 (t) = f(n) (ξ) n! n (t t i ). (7.9) Assume f (n) (ξ) M forallt [t 1,t n ]andh = max(t i+1 t i ), then(roughly) In particular, if f(t) = t n, then max f(t) p n 1 (t) Mhn t 4n. (7.10) f(t) p n 1 (t) = n (t t i ) and f(t) p n 1 (t) = 2 1 k. Polynomial of degree n has the tendency of n 1 oscillation(has n 1 local extreme points). Thus, if the interval is fixed i=0
10 7.3. POLYNOMIAL INTERPOLATION Figure 7.1: Chebysheff points on [ 1,1], n = 2 and n = 3 and n gets higher(as a result the interpolating points will get close together), it may oscillate unnecessarily. Indeed the following example by Runge shows it. Example (Runge). Given {(x i,f(x i )) i = 0,1,...,n}, let f(x) = 1 1+x 2 on [ 5,5] h = b a 2n, x k = kh, k = n,...,n. Interpolate f(x) by polynomial of degree 2n. p 2n ( 5k n ) = f(5k n ), k = 0,±1,...,±n. Runge showed lim n f(x) p 2n (x) =. Thus Runge s example shows higher degree polynomial is not always good for interpolation. This suggests us to use lower degree polynomial on each subinterval.
11 86 CHAPTER 7. INTERPOLATION 7.4 Piecewise Polynomial Interpolation Hermite Cubic Interpolation Cubic Spline Interpolation A spline is a piecewise polynomial of degree k that is continuous differentiable k 1-times. Take cubic C 2 here. Let y = f C 2 [a,b], a = t 1 <...,< t n = b. We wish to construct s(x), a C 2 [a,b]- interpolation which is piecewise cubic polynomial on I k = [t k 1,t k ], k = 1,,n 1. Conditions : (1) 2 function values on each intervals, so 2(n 1) conditions. (2) k = 1,,n 2, (interior derivative) (3) k = 1,,n 12. (interior second derivative) Since we have cubic polynomial in each interval I k = [t k 1,t k ], k = 1,,n 1, we have 4(n 1) unknowns. So we have two free parameters. We have the following options : Specify first derivatives at two end points Specify second derivatives(to zero- we get natural spline) at two end points Either t 2 or t n 1 is Not a knot. (Treat either of the two end intervals as one) B-Splines There are basis functions for splines of all degrees.
Scientific Computing: An Introductory Survey
Scientific Computing: An Introductory Survey Chapter 7 Interpolation Prof. Michael T. Heath Department of Computer Science University of Illinois at Urbana-Champaign Copyright c 2002. Reproduction permitted
More informationOutline. 1 Interpolation. 2 Polynomial Interpolation. 3 Piecewise Polynomial Interpolation
Outline Interpolation 1 Interpolation 2 3 Michael T. Heath Scientific Computing 2 / 56 Interpolation Motivation Choosing Interpolant Existence and Uniqueness Basic interpolation problem: for given data
More informationNumerical Methods I: Polynomial Interpolation
1/31 Numerical Methods I: Polynomial Interpolation Georg Stadler Courant Institute, NYU stadler@cims.nyu.edu November 16, 2017 lassical polynomial interpolation Given f i := f(t i ), i =0,...,n, we would
More information(0, 0), (1, ), (2, ), (3, ), (4, ), (5, ), (6, ).
1 Interpolation: The method of constructing new data points within the range of a finite set of known data points That is if (x i, y i ), i = 1, N are known, with y i the dependent variable and x i [x
More informationWe consider the problem of finding a polynomial that interpolates a given set of values:
Chapter 5 Interpolation 5. Polynomial Interpolation We consider the problem of finding a polynomial that interpolates a given set of values: x x 0 x... x n y y 0 y... y n where the x i are all distinct.
More informationLecture Note 3: Polynomial Interpolation. Xiaoqun Zhang Shanghai Jiao Tong University
Lecture Note 3: Polynomial Interpolation Xiaoqun Zhang Shanghai Jiao Tong University Last updated: October 24, 2013 1.1 Introduction We first look at some examples. Lookup table for f(x) = 2 π x 0 e x2
More informationLecture Note 3: Interpolation and Polynomial Approximation. Xiaoqun Zhang Shanghai Jiao Tong University
Lecture Note 3: Interpolation and Polynomial Approximation Xiaoqun Zhang Shanghai Jiao Tong University Last updated: October 10, 2015 2 Contents 1.1 Introduction................................ 3 1.1.1
More information1 Review of Interpolation using Cubic Splines
cs412: introduction to numerical analysis 10/10/06 Lecture 12: Instructor: Professor Amos Ron Cubic Hermite Spline Interpolation Scribes: Yunpeng Li, Mark Cowlishaw 1 Review of Interpolation using Cubic
More informationScientific Computing
2301678 Scientific Computing Chapter 2 Interpolation and Approximation Paisan Nakmahachalasint Paisan.N@chula.ac.th Chapter 2 Interpolation and Approximation p. 1/66 Contents 1. Polynomial interpolation
More informationNumerical Analysis: Interpolation Part 1
Numerical Analysis: Interpolation Part 1 Computer Science, Ben-Gurion University (slides based mostly on Prof. Ben-Shahar s notes) 2018/2019, Fall Semester BGU CS Interpolation (ver. 1.00) AY 2018/2019,
More informationCubic Splines MATH 375. J. Robert Buchanan. Fall Department of Mathematics. J. Robert Buchanan Cubic Splines
Cubic Splines MATH 375 J. Robert Buchanan Department of Mathematics Fall 2006 Introduction Given data {(x 0, f(x 0 )), (x 1, f(x 1 )),...,(x n, f(x n ))} which we wish to interpolate using a polynomial...
More informationLectures 9-10: Polynomial and piecewise polynomial interpolation
Lectures 9-1: Polynomial and piecewise polynomial interpolation Let f be a function, which is only known at the nodes x 1, x,, x n, ie, all we know about the function f are its values y j = f(x j ), j
More informationChapter 4: Interpolation and Approximation. October 28, 2005
Chapter 4: Interpolation and Approximation October 28, 2005 Outline 1 2.4 Linear Interpolation 2 4.1 Lagrange Interpolation 3 4.2 Newton Interpolation and Divided Differences 4 4.3 Interpolation Error
More informationx x2 2 + x3 3 x4 3. Use the divided-difference method to find a polynomial of least degree that fits the values shown: (b)
Numerical Methods - PROBLEMS. The Taylor series, about the origin, for log( + x) is x x2 2 + x3 3 x4 4 + Find an upper bound on the magnitude of the truncation error on the interval x.5 when log( + x)
More informationExam 2. Average: 85.6 Median: 87.0 Maximum: Minimum: 55.0 Standard Deviation: Numerical Methods Fall 2011 Lecture 20
Exam 2 Average: 85.6 Median: 87.0 Maximum: 100.0 Minimum: 55.0 Standard Deviation: 10.42 Fall 2011 1 Today s class Multiple Variable Linear Regression Polynomial Interpolation Lagrange Interpolation Newton
More informationPreliminary Examination in Numerical Analysis
Department of Applied Mathematics Preliminary Examination in Numerical Analysis August 7, 06, 0 am pm. Submit solutions to four (and no more) of the following six problems. Show all your work, and justify
More informationUniversity of Houston, Department of Mathematics Numerical Analysis, Fall 2005
4 Interpolation 4.1 Polynomial interpolation Problem: LetP n (I), n ln, I := [a,b] lr, be the linear space of polynomials of degree n on I, P n (I) := { p n : I lr p n (x) = n i=0 a i x i, a i lr, 0 i
More informationSPLINE INTERPOLATION
Spline Background SPLINE INTERPOLATION Problem: high degree interpolating polynomials often have extra oscillations. Example: Runge function f(x = 1 1+4x 2, x [ 1, 1]. 1 1/(1+4x 2 and P 8 (x and P 16 (x
More informationNumerical Analysis Preliminary Exam 10 am to 1 pm, August 20, 2018
Numerical Analysis Preliminary Exam 1 am to 1 pm, August 2, 218 Instructions. You have three hours to complete this exam. Submit solutions to four (and no more) of the following six problems. Please start
More informationPolynomials. p n (x) = a n x n + a n 1 x n 1 + a 1 x + a 0, where
Polynomials Polynomials Evaluation of polynomials involve only arithmetic operations, which can be done on today s digital computers. We consider polynomials with real coefficients and real variable. p
More information1 Lecture 8: Interpolating polynomials.
1 Lecture 8: Interpolating polynomials. 1.1 Horner s method Before turning to the main idea of this part of the course, we consider how to evaluate a polynomial. Recall that a polynomial is an expression
More informationMA2501 Numerical Methods Spring 2015
Norwegian University of Science and Technology Department of Mathematics MA5 Numerical Methods Spring 5 Solutions to exercise set 9 Find approximate values of the following integrals using the adaptive
More informationComputational Physics
Interpolation, Extrapolation & Polynomial Approximation Lectures based on course notes by Pablo Laguna and Kostas Kokkotas revamped by Deirdre Shoemaker Spring 2014 Introduction In many cases, a function
More information3.1 Interpolation and the Lagrange Polynomial
MATH 4073 Chapter 3 Interpolation and Polynomial Approximation Fall 2003 1 Consider a sample x x 0 x 1 x n y y 0 y 1 y n. Can we get a function out of discrete data above that gives a reasonable estimate
More informationwhich arises when we compute the orthogonal projection of a vector y in a subspace with an orthogonal basis. Hence assume that P y = A ij = x j, x i
MODULE 6 Topics: Gram-Schmidt orthogonalization process We begin by observing that if the vectors {x j } N are mutually orthogonal in an inner product space V then they are necessarily linearly independent.
More informationNumerical Methods I: Interpolation (cont ed)
1/20 Numerical Methods I: Interpolation (cont ed) Georg Stadler Courant Institute, NYU stadler@cims.nyu.edu November 30, 2017 Interpolation Things you should know 2/20 I Lagrange vs. Hermite interpolation
More informationChapter 1 Numerical approximation of data : interpolation, least squares method
Chapter 1 Numerical approximation of data : interpolation, least squares method I. Motivation 1 Approximation of functions Evaluation of a function Which functions (f : R R) can be effectively evaluated
More informationLecture 10 Polynomial interpolation
Lecture 10 Polynomial interpolation Weinan E 1,2 and Tiejun Li 2 1 Department of Mathematics, Princeton University, weinan@princeton.edu 2 School of Mathematical Sciences, Peking University, tieli@pku.edu.cn
More informationCHAPTER 4. Interpolation
CHAPTER 4 Interpolation 4.1. Introduction We will cover sections 4.1 through 4.12 in the book. Read section 4.1 in the book on your own. The basic problem of one-dimensional interpolation is this: Given
More informationPiecewise Polynomial Interpolation
Piecewise Polynomial Interpolation 1 Piecewise linear interpolation Suppose we have data point (x k,y k ), k =0, 1,...N. A piecewise linear polynomial that interpolates these points is given by p(x) =p
More informationPolynomial Interpolation Part II
Polynomial Interpolation Part II Prof. Dr. Florian Rupp German University of Technology in Oman (GUtech) Introduction to Numerical Methods for ENG & CS (Mathematics IV) Spring Term 2016 Exercise Session
More informationINTERPOLATION. and y i = cos x i, i = 0, 1, 2 This gives us the three points. Now find a quadratic polynomial. p(x) = a 0 + a 1 x + a 2 x 2.
INTERPOLATION Interpolation is a process of finding a formula (often a polynomial) whose graph will pass through a given set of points (x, y). As an example, consider defining and x 0 = 0, x 1 = π/4, x
More informationDepartment of Applied Mathematics Preliminary Examination in Numerical Analysis August, 2013
Department of Applied Mathematics Preliminary Examination in Numerical Analysis August, 013 August 8, 013 Solutions: 1 Root Finding (a) Let the root be x = α We subtract α from both sides of x n+1 = x
More informationCS 257: Numerical Methods
CS 57: Numerical Methods Final Exam Study Guide Version 1.00 Created by Charles Feng http://www.fenguin.net CS 57: Numerical Methods Final Exam Study Guide 1 Contents 1 Introductory Matter 3 1.1 Calculus
More informationTwo hours. To be provided by Examinations Office: Mathematical Formula Tables. THE UNIVERSITY OF MANCHESTER. 29 May :45 11:45
Two hours MATH20602 To be provided by Examinations Office: Mathematical Formula Tables. THE UNIVERSITY OF MANCHESTER NUMERICAL ANALYSIS 1 29 May 2015 9:45 11:45 Answer THREE of the FOUR questions. If more
More informationOrthogonal polynomials
Orthogonal polynomials Gérard MEURANT October, 2008 1 Definition 2 Moments 3 Existence 4 Three-term recurrences 5 Jacobi matrices 6 Christoffel-Darboux relation 7 Examples of orthogonal polynomials 8 Variable-signed
More informationJim Lambers MAT 460/560 Fall Semester Practice Final Exam
Jim Lambers MAT 460/560 Fall Semester 2009-10 Practice Final Exam 1. Let f(x) = sin 2x + cos 2x. (a) Write down the 2nd Taylor polynomial P 2 (x) of f(x) centered around x 0 = 0. (b) Write down the corresponding
More informationFixed point iteration and root finding
Fixed point iteration and root finding The sign function is defined as x > 0 sign(x) = 0 x = 0 x < 0. It can be evaluated via an iteration which is useful for some problems. One such iteration is given
More informationLinear maps. Matthew Macauley. Department of Mathematical Sciences Clemson University Math 8530, Spring 2017
Linear maps Matthew Macauley Department of Mathematical Sciences Clemson University http://www.math.clemson.edu/~macaule/ Math 8530, Spring 2017 M. Macauley (Clemson) Linear maps Math 8530, Spring 2017
More informationNovember 20, Interpolation, Extrapolation & Polynomial Approximation
Interpolation, Extrapolation & Polynomial Approximation November 20, 2016 Introduction In many cases we know the values of a function f (x) at a set of points x 1, x 2,..., x N, but we don t have the analytic
More informationInterpolation and extrapolation
Interpolation and extrapolation Alexander Khanov PHYS6260: Experimental Methods is HEP Oklahoma State University October 30, 207 Interpolation/extrapolation vs fitting Formulation of the problem: there
More informationNumerical Analysis Preliminary Exam 10.00am 1.00pm, January 19, 2018
Numerical Analysis Preliminary Exam 0.00am.00pm, January 9, 208 Instructions. You have three hours to complete this exam. Submit solutions to four (and no more) of the following six problems. Please start
More informationPART IV Spectral Methods
PART IV Spectral Methods Additional References: R. Peyret, Spectral methods for incompressible viscous flow, Springer (2002), B. Mercier, An introduction to the numerical analysis of spectral methods,
More informationLECTURE NOTES ELEMENTARY NUMERICAL METHODS. Eusebius Doedel
LECTURE NOTES on ELEMENTARY NUMERICAL METHODS Eusebius Doedel TABLE OF CONTENTS Vector and Matrix Norms 1 Banach Lemma 20 The Numerical Solution of Linear Systems 25 Gauss Elimination 25 Operation Count
More informationApplied Math 205. Full office hour schedule:
Applied Math 205 Full office hour schedule: Rui: Monday 3pm 4:30pm in the IACS lounge Martin: Monday 4:30pm 6pm in the IACS lounge Chris: Tuesday 1pm 3pm in Pierce Hall, Room 305 Nao: Tuesday 3pm 4:30pm
More information2
1 Notes for Numerical Analysis Math 54 by S. Adjerid Virginia Polytechnic Institute and State University (A Rough Draft) 2 Contents 1 Polynomial Interpolation 5 1.1 Review...............................
More informationInput: A set (x i -yy i ) data. Output: Function value at arbitrary point x. What for x = 1.2?
Applied Numerical Analysis Interpolation Lecturer: Emad Fatemizadeh Interpolation Input: A set (x i -yy i ) data. Output: Function value at arbitrary point x. 0 1 4 1-3 3 9 What for x = 1.? Interpolation
More informationPiecewise Polynomial Interpolation
Piecewise Polynomial Interpolation 1 Piecewise linear interpolation Suppose we have data point (x k,y k ), k =0, 1,...N. A piecewise linear polynomial that interpolates these points is given by p(x) =p
More informationInterpolation and Approximation
Interpolation and Approximation The Basic Problem: Approximate a continuous function f(x), by a polynomial p(x), over [a, b]. f(x) may only be known in tabular form. f(x) may be expensive to compute. Definition:
More informationCS 450 Numerical Analysis. Chapter 8: Numerical Integration and Differentiation
Lecture slides based on the textbook Scientific Computing: An Introductory Survey by Michael T. Heath, copyright c 2018 by the Society for Industrial and Applied Mathematics. http://www.siam.org/books/cl80
More informationAdvanced Computational Fluid Dynamics AA215A Lecture 2 Approximation Theory. Antony Jameson
Advanced Computational Fluid Dynamics AA5A Lecture Approximation Theory Antony Jameson Winter Quarter, 6, Stanford, CA Last revised on January 7, 6 Contents Approximation Theory. Least Squares Approximation
More information11.10a Taylor and Maclaurin Series
11.10a 1 11.10a Taylor and Maclaurin Series Let y = f(x) be a differentiable function at x = a. In first semester calculus we saw that (1) f(x) f(a)+f (a)(x a), for all x near a The right-hand side of
More informationOne dimension and tensor products. 2.1 Legendre and Jacobi polynomials
Part I, Chapter 2 One dimension and tensor products This chapter presents important examples of finite elements, first in one space dimension, then in multiple space dimensions using tensor product techniques.
More informationCS412: Introduction to Numerical Methods
CS412: Introduction to Numerical Methods MIDTERM #1 2:30PM - 3:45PM, Tuesday, 03/10/2015 Instructions: This exam is a closed book and closed notes exam, i.e., you are not allowed to consult any textbook,
More informationSome notes on Chapter 8: Polynomial and Piecewise-polynomial Interpolation
Some notes on Chapter 8: Polynomial and Piecewise-polynomial Interpolation See your notes. 1. Lagrange Interpolation (8.2) 1 2. Newton Interpolation (8.3) different form of the same polynomial as Lagrange
More information2. Interpolation. Closing the Gaps of Discretization...
2. Interpolation Closing the Gaps of Discretization... Numerisches Programmieren, Hans-Joachim Bungartz page 1 of 48 2.1. Preliminary Remark The Approximation Problem Problem: Approximate a (fully or partially
More informationAdditional exercises with Numerieke Analyse
Additional exercises with Numerieke Analyse March 10, 017 1. (a) Given different points x 0, x 1, x [a, b] and scalars y 0, y 1, y, z 1, show that there exists at most one polynomial p P 3 with p(x i )
More informationApproximation Theory
Approximation Theory Function approximation is the task of constructing, for a given function, a simpler function so that the difference between the two functions is small and to then provide a quantifiable
More informationInner Product Spaces An inner product on a complex linear space X is a function x y from X X C such that. (1) (2) (3) x x > 0 for x 0.
Inner Product Spaces An inner product on a complex linear space X is a function x y from X X C such that (1) () () (4) x 1 + x y = x 1 y + x y y x = x y x αy = α x y x x > 0 for x 0 Consequently, (5) (6)
More informationyou expect to encounter difficulties when trying to solve A x = b? 4. A composite quadrature rule has error associated with it in the following form
Qualifying exam for numerical analysis (Spring 2017) Show your work for full credit. If you are unable to solve some part, attempt the subsequent parts. 1. Consider the following finite difference: f (0)
More informationLECTURE 16 GAUSS QUADRATURE In general for Newton-Cotes (equispaced interpolation points/ data points/ integration points/ nodes).
CE 025 - Lecture 6 LECTURE 6 GAUSS QUADRATURE In general for ewton-cotes (equispaced interpolation points/ data points/ integration points/ nodes). x E x S fx dx hw' o f o + w' f + + w' f + E 84 f 0 f
More informationMath 578: Assignment 2
Math 578: Assignment 2 13. Determine whether the natural cubic spline that interpolates the table is or is not the x 0 1 2 3 y 1 1 0 10 function 1 + x x 3 x [0, 1] f(x) = 1 2(x 1) 3(x 1) 2 + 4(x 1) 3 x
More informationChapter 3 Interpolation and Polynomial Approximation
Chapter 3 Interpolation and Polynomial Approximation Per-Olof Persson persson@berkeley.edu Department of Mathematics University of California, Berkeley Math 128A Numerical Analysis Polynomial Interpolation
More information12.0 Properties of orthogonal polynomials
12.0 Properties of orthogonal polynomials In this section we study orthogonal polynomials to use them for the construction of quadrature formulas investigate projections on polynomial spaces and their
More informationNumerical Analysis: Approximation of Functions
Numerical Analysis: Approximation of Functions Mirko Navara http://cmp.felk.cvut.cz/ navara/ Center for Machine Perception, Department of Cybernetics, FEE, CTU Karlovo náměstí, building G, office 104a
More informationNumerische Mathematik
Numer. Math. (997) 76: 479 488 Numerische Mathematik c Springer-Verlag 997 Electronic Edition Exponential decay of C cubic splines vanishing at two symmetric points in each knot interval Sang Dong Kim,,
More informationInterpolation. 1. Judd, K. Numerical Methods in Economics, Cambridge: MIT Press. Chapter
Key References: Interpolation 1. Judd, K. Numerical Methods in Economics, Cambridge: MIT Press. Chapter 6. 2. Press, W. et. al. Numerical Recipes in C, Cambridge: Cambridge University Press. Chapter 3
More informationSection 5.2 Series Solution Near Ordinary Point
DE Section 5.2 Series Solution Near Ordinary Point Page 1 of 5 Section 5.2 Series Solution Near Ordinary Point We are interested in second order homogeneous linear differential equations with variable
More informationClass notes: Approximation
Class notes: Approximation Introduction Vector spaces, linear independence, subspace The goal of Numerical Analysis is to compute approximations We want to approximate eg numbers in R or C vectors in R
More informationA Note on Multiplicity Weight of Nodes of Two Point Taylor Expansion
Applied Mathematical Sciences, Vol, 207, no 6, 307-3032 HIKARI Ltd, wwwm-hikaricom https://doiorg/02988/ams2077302 A Note on Multiplicity Weight of Nodes of Two Point Taylor Expansion Koichiro Shimada
More information256 Summary. D n f(x j ) = f j+n f j n 2n x. j n=1. α m n = 2( 1) n (m!) 2 (m n)!(m + n)!. PPW = 2π k x 2 N + 1. i=0?d i,j. N/2} N + 1-dim.
56 Summary High order FD Finite-order finite differences: Points per Wavelength: Number of passes: D n f(x j ) = f j+n f j n n x df xj = m α m dx n D n f j j n= α m n = ( ) n (m!) (m n)!(m + n)!. PPW =
More informationMath Numerical Analysis Mid-Term Test Solutions
Math 400 - Numerical Analysis Mid-Term Test Solutions. Short Answers (a) A sufficient and necessary condition for the bisection method to find a root of f(x) on the interval [a,b] is f(a)f(b) < 0 or f(a)
More informationMATH ASSIGNMENT 07 SOLUTIONS. 8.1 Following is census data showing the population of the US between 1900 and 2000:
MATH4414.01 ASSIGNMENT 07 SOLUTIONS 8.1 Following is census data showing the population of the US between 1900 and 2000: Years after 1900 Population in millions 0 76.0 20 105.7 40 131.7 60 179.3 80 226.5
More informationCubic Splines. Antony Jameson. Department of Aeronautics and Astronautics, Stanford University, Stanford, California, 94305
Cubic Splines Antony Jameson Department of Aeronautics and Astronautics, Stanford University, Stanford, California, 94305 1 References on splines 1. J. H. Ahlberg, E. N. Nilson, J. H. Walsh. Theory of
More informationThis ODE arises in many physical systems that we shall investigate. + ( + 1)u = 0. (λ + s)x λ + s + ( + 1) a λ. (s + 1)(s + 2) a 0
Legendre equation This ODE arises in many physical systems that we shall investigate We choose We then have Substitution gives ( x 2 ) d 2 u du 2x 2 dx dx + ( + )u u x s a λ x λ a du dx λ a λ (λ + s)x
More informationLecture 1: Interpolation and approximation
ecture notes on Variational and Approximate Methods in Applied Mathematics - A Peirce UBC ecture : Interpolation and approximation (Compiled 6 August 207 In this lecture we introduce the concept of approximation
More informationExamination paper for TMA4215 Numerical Mathematics
Department of Mathematical Sciences Examination paper for TMA425 Numerical Mathematics Academic contact during examination: Trond Kvamsdal Phone: 93058702 Examination date: 6th of December 207 Examination
More informationApproximation theory
Approximation theory Xiaojing Ye, Math & Stat, Georgia State University Spring 2019 Numerical Analysis II Xiaojing Ye, Math & Stat, Georgia State University 1 1 1.3 6 8.8 2 3.5 7 10.1 Least 3squares 4.2
More informationBSM510 Numerical Analysis
BSM510 Numerical Analysis Polynomial Interpolation Prof. Manar Mohaisen Department of EEC Engineering Review of Precedent Lecture Polynomial Regression Multiple Linear Regression Nonlinear Regression Lecture
More informationInterpolation Theory
Numerical Analysis Massoud Malek Interpolation Theory The concept of interpolation is to select a function P (x) from a given class of functions in such a way that the graph of y P (x) passes through the
More informationPolynomial Interpolation
Capter 4 Polynomial Interpolation In tis capter, we consider te important problem of approximatinga function fx, wose values at a set of distinct points x, x, x,, x n are known, by a polynomial P x suc
More informationNumerical integration and differentiation. Unit IV. Numerical Integration and Differentiation. Plan of attack. Numerical integration.
Unit IV Numerical Integration and Differentiation Numerical integration and differentiation quadrature classical formulas for equally spaced nodes improper integrals Gaussian quadrature and orthogonal
More information5. Hand in the entire exam booklet and your computer score sheet.
WINTER 2016 MATH*2130 Final Exam Last name: (PRINT) First name: Student #: Instructor: M. R. Garvie 19 April, 2016 INSTRUCTIONS: 1. This is a closed book examination, but a calculator is allowed. The test
More informationIntroduction to Numerical Analysis
Université de Liège Faculté des Sciences Appliquées Introduction to Numerical Analysis Edition 2015 Professor Q. Louveaux Department of Electrical Engineering and Computer Science Montefiore Institute
More informationOutline. 1 Boundary Value Problems. 2 Numerical Methods for BVPs. Boundary Value Problems Numerical Methods for BVPs
Boundary Value Problems Numerical Methods for BVPs Outline Boundary Value Problems 2 Numerical Methods for BVPs Michael T. Heath Scientific Computing 2 / 45 Boundary Value Problems Numerical Methods for
More informationbe the set of complex valued 2π-periodic functions f on R such that
. Fourier series. Definition.. Given a real number P, we say a complex valued function f on R is P -periodic if f(x + P ) f(x) for all x R. We let be the set of complex valued -periodic functions f on
More informationGlobal polynomial interpolants suffer from the Runge Phenomenon if the data sites (nodes) are not chosen correctly.
Piecewise polynomial interpolation Global polynomial interpolants suffer from the Runge Phenomenon if the data sites (nodes) are not chosen correctly. In many applications, one does not have the freedom
More informationThere are two things that are particularly nice about the first basis
Orthogonality and the Gram-Schmidt Process In Chapter 4, we spent a great deal of time studying the problem of finding a basis for a vector space We know that a basis for a vector space can potentially
More informationPolynomial Interpolation
Chapter Polynomial Interpolation. Introduction Suppose that we have a two sets of n + real numbers {x i } n+ i= and {y i} n+ i=, and that the x i are strictly increasing: x < x < x 2 < < x n. Interpolation
More informationCubic Splines; Bézier Curves
Cubic Splines; Bézier Curves 1 Cubic Splines piecewise approximation with cubic polynomials conditions on the coefficients of the splines 2 Bézier Curves computer-aided design and manufacturing MCS 471
More informationInterpolation Atkinson Chapter 3, Stoer & Bulirsch Chapter 2, Dahlquist & Bjork Chapter 4 Topics marked with are not on the exam
Interpolation Atkinson Chapter 3, Stoer & Bulirsch Chapter 2, Dahlquist & Bjork Chapter 4 Topics marked with are not on the exam 1 Polynomial interpolation, introduction Let {x i } n 0 be distinct real
More informationn 1 f n 1 c 1 n+1 = c 1 n $ c 1 n 1. After taking logs, this becomes
Root finding: 1 a The points {x n+1, }, {x n, f n }, {x n 1, f n 1 } should be co-linear Say they lie on the line x + y = This gives the relations x n+1 + = x n +f n = x n 1 +f n 1 = Eliminating α and
More informationCHAPTER 10 Shape Preserving Properties of B-splines
CHAPTER 10 Shape Preserving Properties of B-splines In earlier chapters we have seen a number of examples of the close relationship between a spline function and its B-spline coefficients This is especially
More information8.2 Discrete Least Squares Approximation
Chapter 8 Approximation Theory 8.1 Introduction Approximation theory involves two types of problems. One arises when a function is given explicitly, but we wish to find a simpler type of function, such
More informationNumerical Methods I: Numerical Integration/Quadrature
1/20 Numerical Methods I: Numerical Integration/Quadrature Georg Stadler Courant Institute, NYU stadler@cims.nyu.edu November 30, 2017 umerical integration 2/20 We want to approximate the definite integral
More informationInterpolation & Polynomial Approximation. Hermite Interpolation I
Interpolation & Polynomial Approximation Hermite Interpolation I Numerical Analysis (th Edition) R L Burden & J D Faires Beamer Presentation Slides prepared by John Carroll Dublin City University c 2011
More informationInterpolation. Escuela de Ingeniería Informática de Oviedo. (Dpto. de Matemáticas-UniOvi) Numerical Computation Interpolation 1 / 34
Interpolation Escuela de Ingeniería Informática de Oviedo (Dpto. de Matemáticas-UniOvi) Numerical Computation Interpolation 1 / 34 Outline 1 Introduction 2 Lagrange interpolation 3 Piecewise polynomial
More informationMath 411 Preliminaries
Math 411 Preliminaries Provide a list of preliminary vocabulary and concepts Preliminary Basic Netwon's method, Taylor series expansion (for single and multiple variables), Eigenvalue, Eigenvector, Vector
More informationQ 0 x if x 0 x x 1. S 1 x if x 1 x x 2. i 0,1,...,n 1, and L x L n 1 x if x n 1 x x n
. - Piecewise Linear-Quadratic Interpolation Piecewise-polynomial Approximation: Problem: Givenn pairs of data points x i, y i, i,,...,n, find a piecewise-polynomial Sx S x if x x x Sx S x if x x x 2 :
More informationf (r) (a) r! (x a) r, r=0
Part 3.3 Differentiation v1 2018 Taylor Polynomials Definition 3.3.1 Taylor 1715 and Maclaurin 1742) If a is a fixed number, and f is a function whose first n derivatives exist at a then the Taylor polynomial
More information