INTERPOLATION Background Polynomial Approximation Problem:
|
|
- Bryan Virgil Booker
- 6 years ago
- Views:
Transcription
1 INTERPOLATION Background Polynomial Approximation Problem: given f(x) C[a, b], find P n (x) = a 0 + a 1 x + a 2 x a n x n with P n (x) close to f(x) for x [a, b]. Motivations: f(x) might be difficult to compute, but P n (x) is easy to compute, integrate, differentiate,... Weierstrass Approximation Theorem: if f C[a, b], ɛ > 0, there exists a polynomial P (x) with f(x) P (x) < ɛ x [a, b]. Problem: how to find a good P (x)? Possible solution: Taylor polynomials? P n (x) = f(x 0 )+(x x 0 )f (x 0 )+ +(x x 0 ) n f (n) (x 0 ). But Taylor P n (x) is often bad unless x is close to x 0 ; Taylor polynomial needs derivatives. Another possible solution: interpolating polynomial. Given points x 0, x 1,..., x n, and function values f(x 0 ), f(x 1 ),..., f(x n ), an interpolating polynomial P (x) for f(x) satisifies P (x i ) = f(x i ), i = 0, 1,..., n. Issues: how to find, represent, compute P (x); errors?
2 LAGRANGE INTERPOLATION Lagrange Interpolating Polynomial Linear Interpolation: given x 0, f(x 0 ), x 1, f(x 1 ), point-slope form for interpolating P 1 (x) is P 1 (x) = f(x 0 ) + (x x 0 ) f(x 1) f(x 0 ) x 1 x 0. Lagrange form for interpolating P 1 (x) is P 1 (x) = x x 1 x 0 x 1 f(x 0 ) + x x 0 x 1 x 0 f(x 1 ). Quadratic Interpolation: given (x 0, f(x 0 )), (x 1, f(x 1 )), (x 2, f(x 2 )), point-slope form for interpolating P 2 (x) (see 3.3) is P 2 (x) = f(x 0 ) + (x x 0 ) f(x 1) f(x 0 ) x 1 x 0 +??? Lagrange form for interpolating P 2 (x) is P 2 (x) = (x x 1 )(x x 2 ) (x 0 x 1 )(x 0 x 2 ) f(x 0) + (x x 0)(x x 2 ) (x 1 x 0 )(x 1 x 2 ) f(x 1) + (x x 0)(x x 1 ) (x 2 x 0 )(x 2 x 1 ) f(x 2). 2
3 LAGRANGE INTERPOLATION CONT. Example: f(x) = cos(πx), for x [0, 2] Maxiumum error for x [0, 2]: 2(for P 1 (x)),.61(p 2 (x)),.089(p 4 (x)). 1.5 cos(π x) and Lagrange degree 1, 2, 4 approximations
4 LAGRANGE INTERPOLATION CONT. General Lagrange Interpolation Lagrange Basis functions: given n + 1 distinct x i s L n,k (x) = (x x 0) (x x k 1 )(x x k+1 ) (x x n ) (x k x 0 ) (x k x k 1 )(x k x k+1 ) (x k x n ) n (x x i ) = (x k x i ). i=0, k Notice: L n,k (x j ) = 0, if j k, L n,k (x k ) = 1, and degree of L n,k is n. Lagrange Interpolating Polynomial: given data set D = {(x i, f(x i ))} n i=0, with distinct x i s, the Lagrange interpolating polynomial for D is P (x) = f(x 0 )L n,0 (x) + f(x 1 )L n,1 (x) + + f(x n )L n,n (x) n = f(x k )L n,k (x). k=0 Efficient evaluation: use n n f(x i ) P (x) = (x x i ) w i (x x i ), w i = i=0 i=0 n j=0, i (x i x j ). With precomputed w i s (O(n 2 )), P (x) needs O(n) flops. 4
5 LAGRANGE INTERPOLATION CONT. Theorem: given {f(x i )} n i=0, with distinct x i s, there is a unique polynomial P (x) of degree n which satisfies P (x i ) = f(x i ) for i = 0, 1,..., n. How to find power form for P (x)? Find a i s so that P n (x) = a 0 + a 1 x + a 2 x a n x n. Solve the linear system determined by P n (x i ) = a 0 + a 1 x i + a 2 x 2 i + + a n x n i = f(x i ), i = 0, 1,..., n, for the a i s. In system form V a = f, with Vandermonde matrix 1 x 0 x x n 0 a 0 f(x 0 ) V = 1 x 1 x x n , a = a 1., f = f(x 1 )., 1 x n x 2 n... x n n a n f(x n ) Problems: Cost to find a i s? V is often illconditioned; a i s are often not explicitly needed. 5
6 NEWTON INTERPOLATION Newton Divided Difference Background Motivation: to provide Taylor -like general formula where terms are added successively as degree increases: P n (x) = a 0 + a 1 (x x 0 ) + a 2 (x x 0 )(x x 1 ) + + a n (x x 0 ) (x x n 1 ). Iterative construction of P n : Notice P n (x 0 ) = f(x 0 ) = a 0 ; P n (x 1 ) = f(x 1 ) = f(x 0 ) + a 1 (x 1 x 0 ), so Then a 1 = f(x 1) f(x 0 ) x 1 x 0. P n (x 2 ) = f(x 2 ) = f(x 0 )+a 1 (x 2 x 0 )+a 2 (x 2 x 0 )(x 2 x 1 ), so f(x 2 ) f(x 1 ) x a 2 = 2 x 1 f(x 1) f(x 0 ) x 1 x 0. x 2 x 0 For general case, use divided differences for all a k s. 6
7 DIVIDED DIFF. INTERP. CONT. Divided Differences Notation: the k th divided difference for x i, x i+1,..., x i+k, f(x i ), f(x i+1 ),..., f(x i+k ), is a number denoted by f[x i, x i+1,..., x i+k ]. Divided Difference Formula: using f[x i ] f(x i ) f[x i, x i+1,..., x i+k ] = f[x i+1, x i+2,..., x i+k ] f[x i, x i+1,..., x i+k 1 ] x i+k x i. Divided Difference Table computed row at a time x 0 f[x 0 ] x 1 f[x 1 ] f[x 0, x 1 ] x 2 f[x 2 ] f[x 1, x 2 ] f[x 0, x 1, x 2 ].... x n f[x n ] f[x n 1, x n ] f[x n 2, x n 1, x n ]... f[x 0, x 1,..., x n ] with a k = f[x 0, x 1,..., x k ], k = 0, 1,..., n. Example: find the divided diff. table for the given data x f(x)
8 DIVIDED DIFF. INTERP. CONT. Simple Matlab algorithm for divided diff. table. n = 4; x=[0:n]/n; f=cos(pi*x); % Data Values dd = zeros(1,n+1); for i = 1 : n+1, t = dd(1); dd(1) = f(i); for j = 1 : i-1, dm = t; t = dd(j+1); dd(j+1) = (dd(j)-dm)/(x(i)-x(i-j)); end, d(i) = dd(i); disp([x(i) dd(1:i)]) end % d contains DD coefficients %x s f s DD s e-15 Newton Interpolation Formula: define n P n (x) = f[x 0 ]+ f[x 0, x 1,..., x k ](x x 0 ) (x x k 1 ) k=1 Example: using diagonal from computed DD table: P 4 (x) = Note: actual degree of P 4 is 3. 8
9 DIVIDED DIFF. INTERP. CONT. Computation with DD polynomial: setup cost is O(n 2 ), but nested evaluation costs only O(n) for P (x). Nested evaluation algorithm for P(x) a) set P = f[x 0, x 1,..., x n ], b) for k = n 1 : 1 : 0, set P = f[x 0, x 1,..., x k ] + (x x k )P. Example: find f(0.45)(.15643) given previous data. P 4 (x) = P 4 (.45) = Algorithm steps: k = 4; P = 0; k = 3; P = (.3)0 = ; k = 2; P = (.05) = ; k = 1; P = (.2)( ) = ; k = 0; P = 1 + (.45)( ) = Example: given the DD table below, what is f(x)? % x f(x) 1st 2nd 3rd 4th 5th 6th
10 DIVIDED DIFF. INTERP. CONT. Example: how many degree d polynomials through n points? d = 3, with points (1,-1), (3,2), (4,5)? d = 4? Application Example: efficient function representation. Find a good interpolation approximation for sin(x). a) pick fundamental domain [0, π/2]; for other x s use sin(x) = sin(π x), x [π/2, π], sin(x) = sin(2π x), x [π, 2π], sin(x + 2kπ) = sin(x), x > 2π, with sin(x) = sin( x). b) given ɛ, find smallest d so that P d (x) sin(x) < ɛ. E.g. with evenly spaced x i s d = 3, has P 3 (x) sin(x).0024, d = 4, has P 4 (x) sin(x).00022, d = 5, has P 5 (x) sin(x) , d = 6, has P 6 (x) sin(x) , d = 7, has P 7 (x) sin(x) A single precision interpolating polynomial for sin(x) needs only 8 DD coefficients. 10
11 8 x 10 8 P 7 (x) sin(x) n = 7; x = pi*[0:n]/(2*n); f = sin(x); xt = pi*[0:128]/256; [fv,d] = divdif(x,f,xt); disp(max(abs(fv-sin(xt)))) plot( xt, fv-sin(xt), x, zeros(1,n+1) ); grid on disp(d) % DD diagonal entries
12 DD table computation and interp. poly value function function [ f, d, fp ] = divdif( xs, fs, x, ip ) if nargin < 4, ip = 0; end % Computes DD table for data xs, fs, and % evaluates interp. poly at points in x, % returning poly values in f, derivatives in fp, % and DD table diagonal entries in d. % n = length(xs); dd = zeros(1,n); for i = 1 : n, db = dd(1); dd(1) = fs(i); if ip>0, fprintf( %8.1f%11.2f,xs(i),fs(i)),end % compute and display row i of DD table for j = 1 : i-1, da = db; db = dd(j+1); dd(j+1) = ( dd(j) - da )/( xs(i) - xs(i-j) ); if ip>0, fprintf( %10.4f,dd(j+1)), end end, d(i) = dd(i); if ip>0, fprintf( \n ), end end, f = d(n); fp = 0; % nested poly and derivative values at x points for i = n-1 : -1 : 1, fp = f + (x-xs(i)).*fp; f = d(i) + (x-xs(i)).*f; end % end divdif 12
Interpolation and the Lagrange Polynomial
Interpolation and the Lagrange Polynomial MATH 375 J. Robert Buchanan Department of Mathematics Fall 2013 Introduction We often choose polynomials to approximate other classes of functions. Theorem (Weierstrass
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 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 informationNeville s Method. MATH 375 Numerical Analysis. J. Robert Buchanan. Fall Department of Mathematics. J. Robert Buchanan Neville s Method
Neville s Method MATH 375 Numerical Analysis J. Robert Buchanan Department of Mathematics Fall 2013 Motivation We have learned how to approximate a function using Lagrange polynomials and how to estimate
More informationFunction approximation
Week 9: Monday, Mar 26 Function approximation A common task in scientific computing is to approximate a function. The approximated function might be available only through tabulated data, or it may be
More information1 Motivation for Newton interpolation
cs412: introduction to numerical analysis 09/30/10 Lecture 7: Newton Interpolation Instructor: Professor Amos Ron Scribes: Yunpeng Li, Mark Cowlishaw, Nathanael Fillmore 1 Motivation for Newton interpolation
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 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 informationCS 323: Numerical Analysis and Computing
CS 323: Numerical Analysis and Computing MIDTERM #2 Instructions: This is an open notes exam, i.e., you are allowed to consult any textbook, your class notes, homeworks, or any of the handouts from us.
More informationMath Numerical Analysis
Math 541 - Numerical Analysis Joseph M. Mahaffy, jmahaffy@mail.sdsu.edu Department of Mathematics and Statistics Dynamical Systems Group Computational Sciences Research Center San Diego State University
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 informationMidterm Review. Igor Yanovsky (Math 151A TA)
Midterm Review Igor Yanovsky (Math 5A TA) Root-Finding Methods Rootfinding methods are designed to find a zero of a function f, that is, to find a value of x such that f(x) =0 Bisection Method To apply
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 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 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 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 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 informationCurve Fitting and Interpolation
Chapter 5 Curve Fitting and Interpolation 5.1 Basic Concepts Consider a set of (x, y) data pairs (points) collected during an experiment, Curve fitting: is a procedure to develop or evaluate mathematical
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 informationMath 104A - Homework 3
Math 104A - Homework 3 Due 7/7 2.4.6 Show that the following sequences converge linearly to p = 0. How large must n be before we have p n p 5 10 2? a p n = 1/n. Since p n+1 0 p n 0 = 1/(n + 1) 1/n = n
More informationAssignment 6, Math 575A
Assignment 6, Math 575A Part I Matlab Section: MATLAB has special functions to deal with polynomials. Using these commands is usually recommended, since they make the code easier to write and understand
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 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 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 informationWeek #6 - Taylor Series, Derivatives and Graphs Section 10.1
Week #6 - Taylor Series, Derivatives and Graphs Section 10.1 From Calculus, Single Variable by Hughes-Hallett, Gleason, McCallum et. al. Copyright 005 by John Wiley & Sons, Inc. This material is used by
More informationDepartment of Applied Mathematics and Theoretical Physics. AMA 204 Numerical analysis. Exam Winter 2004
Department of Applied Mathematics and Theoretical Physics AMA 204 Numerical analysis Exam Winter 2004 The best six answers will be credited All questions carry equal marks Answer all parts of each question
More informationA first order divided difference
A first order divided difference For a given function f (x) and two distinct points x 0 and x 1, define f [x 0, x 1 ] = f (x 1) f (x 0 ) x 1 x 0 This is called the first order divided difference of f (x).
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 informationIntro Polynomial Piecewise Cubic Spline Software Summary. Interpolation. Sanzheng Qiao. Department of Computing and Software McMaster University
Interpolation Sanzheng Qiao Department of Computing and Software McMaster University January, 2014 Outline 1 Introduction 2 Polynomial Interpolation 3 Piecewise Polynomial Interpolation 4 Natural Cubic
More informationIntro Polynomial Piecewise Cubic Spline Software Summary. Interpolation. Sanzheng Qiao. Department of Computing and Software McMaster University
Interpolation Sanzheng Qiao Department of Computing and Software McMaster University July, 2012 Outline 1 Introduction 2 Polynomial Interpolation 3 Piecewise Polynomial Interpolation 4 Natural Cubic Spline
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 METHODS. x n+1 = 2x n x 2 n. In particular: which of them gives faster convergence, and why? [Work to four decimal places.
NUMERICAL METHODS 1. Rearranging the equation x 3 =.5 gives the iterative formula x n+1 = g(x n ), where g(x) = (2x 2 ) 1. (a) Starting with x = 1, compute the x n up to n = 6, and describe what is happening.
More information3 Interpolation and Polynomial Approximation
CHAPTER 3 Interpolation and Polynomial Approximation Introduction A census of the population of the United States is taken every 10 years. The following table lists the population, in thousands of people,
More informationCourse Summary Math 211
Course Summary Math 211 table of contents I. Functions of several variables. II. R n. III. Derivatives. IV. Taylor s Theorem. V. Differential Geometry. VI. Applications. 1. Best affine approximations.
More informationThe answer in each case is the error in evaluating the taylor series for ln(1 x) for x = which is 6.9.
Brad Nelson Math 26 Homework #2 /23/2. a MATLAB outputs: >> a=(+3.4e-6)-.e-6;a- ans = 4.449e-6 >> a=+(3.4e-6-.e-6);a- ans = 2.224e-6 And the exact answer for both operations is 2.3e-6. The reason why way
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 informationNumerical Analysis Spring 2001 Professor Diamond
Numerical Analysis Spring 2001 Professor Diamond Polynomial interpolation: The Polynomial Interpolation Problem: Find a polynomial pÿx a 0 a 1 x... a n x n which satisfies the n 1 conditions pÿx 0 y 0,
More information8.7 Taylor s Inequality Math 2300 Section 005 Calculus II. f(x) = ln(1 + x) f(0) = 0
8.7 Taylor s Inequality Math 00 Section 005 Calculus II Name: ANSWER KEY Taylor s Inequality: If f (n+) is continuous and f (n+) < M between the center a and some point x, then f(x) T n (x) M x a n+ (n
More informationNewton s Method and Linear Approximations
Newton s Method and Linear Approximations Curves are tricky. Lines aren t. Newton s Method and Linear Approximations Newton s Method for finding roots Goal: Where is f (x) = 0? f (x) = x 7 + 3x 3 + 7x
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 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 informationChapter 8: Taylor s theorem and L Hospital s rule
Chapter 8: Taylor s theorem and L Hospital s rule Theorem: [Inverse Mapping Theorem] Suppose that a < b and f : [a, b] R. Given that f (x) > 0 for all x (a, b) then f 1 is differentiable on (f(a), f(b))
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 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 informationHomework and Computer Problems for Math*2130 (W17).
Homework and Computer Problems for Math*2130 (W17). MARCUS R. GARVIE 1 December 21, 2016 1 Department of Mathematics & Statistics, University of Guelph NOTES: These questions are a bare minimum. You should
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 informationNumerical Methods. King Saud University
Numerical Methods King Saud University Aims In this lecture, we will... find the approximate solutions of derivative (first- and second-order) and antiderivative (definite integral only). Numerical Differentiation
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 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 informationInverses. Stephen Boyd. EE103 Stanford University. October 28, 2017
Inverses Stephen Boyd EE103 Stanford University October 28, 2017 Outline Left and right inverses Inverse Solving linear equations Examples Pseudo-inverse Left and right inverses 2 Left inverses a number
More informationEVALUATING A POLYNOMIAL
EVALUATING A POLYNOMIAL Consider having a polynomial p(x) = a + a 1 x + a 2 x 2 + + a n x n which you need to evaluate for many values of x. How do you evaluate it? This may seem a strange question, but
More informationMA2501 Numerical Methods Spring 2015
Norwegian University of Science and Technology Department of Mathematics MA2501 Numerical Methods Spring 2015 Solutions to exercise set 7 1 Cf. Cheney and Kincaid, Exercise 4.1.9 Consider the data points
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 informationIntroduction Linear system Nonlinear equation Interpolation
Interpolation Interpolation is the process of estimating an intermediate value from a set of discrete or tabulated values. Suppose we have the following tabulated values: y y 0 y 1 y 2?? y 3 y 4 y 5 x
More informationChapter 4 No. 4.0 Answer True or False to the following. Give reasons for your answers.
MATH 434/534 Theoretical Assignment 3 Solution Chapter 4 No 40 Answer True or False to the following Give reasons for your answers If a backward stable algorithm is applied to a computational problem,
More informationHomework 5 - Solutions
Spring Math 54 Homework 5 - Solutions BF 3.4.4. d. The spline interpolation routine below produces the following coefficients: i a i b i c i d i -..869948.75637848.656598 -.5.9589.487644.9847639.887.9863.34456976.489747
More informationNewton s Method and Linear Approximations
Newton s Method and Linear Approximations Newton s Method for finding roots Goal: Where is f (x) =0? f (x) =x 7 +3x 3 +7x 2 1 2-1 -0.5 0.5-2 Newton s Method for finding roots Goal: Where is f (x) =0? f
More informationQ1. Discuss, compare and contrast various curve fitting and interpolation methods
Q1. Discuss, compare and contrast various curve fitting and interpolation methods McMaster University 1 Curve Fitting Problem statement: Given a set of (n + 1) point-pairs {x i,y i }, i = 0,1,... n, find
More informationNewton's forward interpolation formula
Newton's Interpolation Formulae Interpolation is the process of approximating a given function, whose values are known at N + 1 tabular points, by a suitable polynomial, P N (x) of degree N which takes
More informationMATH 552 Spectral Methods Spring Homework Set 5 - SOLUTIONS
MATH 55 Spectral Methods Spring 9 Homework Set 5 - SOLUTIONS. Suppose you are given an n n linear system Ax = f where the matrix A is tridiagonal b c a b c. A =.........,. a n b n c n a n b n with x =
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 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 informationLösning: Tenta Numerical Analysis för D, L. FMN011,
Lösning: Tenta Numerical Analysis för D, L. FMN011, 090527 This exam starts at 8:00 and ends at 12:00. To get a passing grade for the course you need 35 points in this exam and an accumulated total (this
More informationQR Decomposition. When solving an overdetermined system by projection (or a least squares solution) often the following method is used:
(In practice not Gram-Schmidt, but another process Householder Transformations are used.) QR Decomposition When solving an overdetermined system by projection (or a least squares solution) often the following
More informationNewton s Method and Linear Approximations 10/19/2011
Newton s Method and Linear Approximations 10/19/2011 Curves are tricky. Lines aren t. Newton s Method and Linear Approximations 10/19/2011 Newton s Method Goal: Where is f (x) =0? f (x) =x 7 +3x 3 +7x
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 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 informationCS 323: Numerical Analysis and Computing
CS 323: Numerical Analysis and Computing MIDTERM #2 Instructions: This is an open notes exam, i.e., you are allowed to consult any textbook, your class notes, homeworks, or any of the handouts from us.
More informationMidterm for Introduction to Numerical Analysis I, AMSC/CMSC 466, on 10/29/2015
Midterm for Introduction to Numerical Analysis I, AMSC/CMSC 466, on 10/29/2015 The test lasts 1 hour and 15 minutes. No documents are allowed. The use of a calculator, cell phone or other equivalent electronic
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 informationMath 56 Homework 1 Michael Downs. ne n 10 + ne n (1)
. Problem (a) Yes. The following equation: ne n + ne n () holds for all n R but, since we re only concerned with the asymptotic behavior as n, let us only consider n >. Dividing both sides by n( + ne n
More informationCSL361 Problem set 4: Basic linear algebra
CSL361 Problem set 4: Basic linear algebra February 21, 2017 [Note:] If the numerical matrix computations turn out to be tedious, you may use the function rref in Matlab. 1 Row-reduced echelon matrices
More informationSolutions of Equations in One Variable. Newton s Method
Solutions of Equations in One Variable Newton s Method Numerical Analysis (9th Edition) R L Burden & J D Faires Beamer Presentation Slides prepared by John Carroll Dublin City University c 2011 Brooks/Cole,
More informationA description of a math circle set of activities around polynomials, especially interpolation.
A description of a math circle set of activities around polynomials, especially interpolation. Bob Sachs Department of Mathematical Sciences George Mason University Fairfax, Virginia 22030 rsachs@gmu.edu
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 informationNumerical solutions of nonlinear systems of equations
Numerical solutions of nonlinear systems of equations Tsung-Ming Huang Department of Mathematics National Taiwan Normal University, Taiwan E-mail: min@math.ntnu.edu.tw August 28, 2011 Outline 1 Fixed points
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 information1 Solutions to selected problems
Solutions to selected problems Section., #a,c,d. a. p x = n for i = n : 0 p x = xp x + i end b. z = x, y = x for i = : n y = y + x i z = zy end c. y = (t x ), p t = a for i = : n y = y(t x i ) p t = p
More informationFinite Difference Methods for Boundary Value Problems
Finite Difference Methods for Boundary Value Problems October 2, 2013 () Finite Differences October 2, 2013 1 / 52 Goals Learn steps to approximate BVPs using the Finite Difference Method Start with two-point
More informationConditional Gradient (Frank-Wolfe) Method
Conditional Gradient (Frank-Wolfe) Method Lecturer: Aarti Singh Co-instructor: Pradeep Ravikumar Convex Optimization 10-725/36-725 1 Outline Today: Conditional gradient method Convergence analysis Properties
More informationComputational Methods. Least Squares Approximation/Optimization
Computational Methods Least Squares Approximation/Optimization Manfred Huber 2011 1 Least Squares Least squares methods are aimed at finding approximate solutions when no precise solution exists Find the
More informationTaylor and Maclaurin Series. Approximating functions using Polynomials.
Taylor and Maclaurin Series Approximating functions using Polynomials. Approximating f x = e x near x = 0 In order to approximate the function f x = e x near x = 0, we can use the tangent line (The Linear
More informationTWO METHODS FOR OF EQUATIONS
TWO METHODS FOR FINDING ROOTS OF EQUATIONS Closed (Bracketing) Methods Open Methods Motivation: i In engineering applications, it is often necessary to determine the rootofan of equation when a formula
More information. (a) Express [ ] as a non-trivial linear combination of u = [ ], v = [ ] and w =[ ], if possible. Otherwise, give your comments. (b) Express +8x+9x a
TE Linear Algebra and Numerical Methods Tutorial Set : Two Hours. (a) Show that the product AA T is a symmetric matrix. (b) Show that any square matrix A can be written as the sum of a symmetric matrix
More informationMAE 107 Homework 8 Solutions
MAE 107 Homework 8 Solutions 1. Newton s method to solve 3exp( x) = 2x starting at x 0 = 11. With chosen f(x), indicate x n, f(x n ), and f (x n ) at each step stopping at the first n such that f(x n )
More informationNumerical Marine Hydrodynamics
Numerical Marine Hydrodynamics Interpolation Lagrange interpolation Triangular families Newton s iteration method Equidistant Interpolation Spline Interpolation Numerical Differentiation Numerical Integration
More informationNumerical Methods School of Mechanical Engineering Chung-Ang University
Part 2 Chapter 5 Roots: Bracketing Methods Prof. Hae-Jin Choi hjchoi@cau.ac.kr 1 Overview of Part 2 l To find the roots of general second order polynomial, the quadratic formula is used b b 2 2 - ± - 4ac
More informationTaylor and Maclaurin Series. Approximating functions using Polynomials.
Taylor and Maclaurin Series Approximating functions using Polynomials. Approximating f x = e x near x = 0 In order to approximate the function f x = e x near x = 0, we can use the tangent line (The Linear
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 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 informationEE364a Review Session 7
EE364a Review Session 7 EE364a Review session outline: derivatives and chain rule (Appendix A.4) numerical linear algebra (Appendix C) factor and solve method exploiting structure and sparsity 1 Derivative
More informationChapter 4 No. 4.0 Answer True or False to the following. Give reasons for your answers.
MATH 434/534 Theoretical Assignment 3 Solution Chapter 4 No 40 Answer True or False to the following Give reasons for your answers If a backward stable algorithm is applied to a computational problem,
More informationPuzzle 1 Puzzle 2 Puzzle 3 Puzzle 4 Puzzle 5 /10 /10 /10 /10 /10
MATH-65 Puzzle Collection 6 Nov 8 :pm-:pm Name:... 3 :pm Wumaier :pm Njus 5 :pm Wumaier 6 :pm Njus 7 :pm Wumaier 8 :pm Njus This puzzle collection is closed book and closed notes. NO calculators are allowed
More informationMATH 590: Meshfree Methods
MATH 590: Meshfree Methods Chapter 14: The Power Function and Native Space Error Estimates Greg Fasshauer Department of Applied Mathematics Illinois Institute of Technology Fall 2010 fasshauer@iit.edu
More informationApplied Numerical Analysis (AE2220-I) R. Klees and R.P. Dwight
Applied Numerical Analysis (AE0-I) R. Klees and R.P. Dwight February 018 Contents 1 Preliminaries: Motivation, Computer arithmetic, Taylor series 1 1.1 Numerical Analysis Motivation..........................
More informationMath 365 Homework 5 Due April 6, 2018 Grady Wright
Math 365 Homework 5 Due April 6, 018 Grady Wright 1. (Polynomial interpolation, 10pts) Consider the following three samples of some function f(x): x f(x) -1/ -1 1 1 1/ (a) Determine the unique second degree
More informationPowerPoints organized by Dr. Michael R. Gustafson II, Duke University
Part 5 Chapter 17 Numerical Integration Formulas PowerPoints organized by Dr. Michael R. Gustafson II, Duke University All images copyright The McGraw-Hill Companies, Inc. Permission required for reproduction
More informationPreliminary Examination, Numerical Analysis, August 2016
Preliminary Examination, Numerical Analysis, August 2016 Instructions: This exam is closed books and notes. The time allowed is three hours and you need to work on any three out of questions 1-4 and any
More informationComputing Eigenvalues and/or Eigenvectors;Part 1, Generalities and symmetric matrices
Computing Eigenvalues and/or Eigenvectors;Part 1, Generalities and symmetric matrices Tom Lyche Centre of Mathematics for Applications, Department of Informatics, University of Oslo November 9, 2008 Today
More informationNon-polynomial Least-squares fitting
Applied Math 205 Last time: piecewise polynomial interpolation, least-squares fitting Today: underdetermined least squares, nonlinear least squares Homework 1 (and subsequent homeworks) have several parts
More information