Applied Numerical Analysis Quiz #2

Size: px
Start display at page:

Download "Applied Numerical Analysis Quiz #2"

Transcription

1 Applied Numerical Analysis Quiz #2 Modules 3 and 4 Name: Student number: DO NOT OPEN UNTIL ASKED Instructions: Make sure you have a machine-readable answer form. Write your name and student number in the spaces above, and on the answer form. Fill in the answer form neatly to avoid risk of incorrect marking. Fill in the version number of your quiz (see bottom right, A-D) on the answer form. Use only pencil on the answer form, and correct with a rubber. This quiz requires a calculator. Each question has exactly one correct answer. Correct answers will receive 5 points, unanswered questions point, incorrect answers 0 points. This quiz has 0 questions and 4 pages in total. Quiz 205, Versie: D

2 Module 3: Advanced interpolation Question Let φ(x) be a cubic spline on x [a, b]. What is the most that can be said about φ (x) in general? B: It is discontunous C: It is continuous, i.e. φ C 0 ([a, b]) D: It is once continuously differentiable, i.e. φ C ([a, b]) E: It is twice continuously differentiable, i.e. φ C 2 ([a, b]) F: It is infinitely differentiable, i.e. φ C ([a, b]) Question 2 Consider the quadratic function f(x) = x 2 on the interval x [, ]. Samples of f(x) are taken at x 0 =, x = 0, and x 2 =. Which of the following methods, when applied to these samples, will give an exact interpolation of f(x) on the interval? a. Polynomial interpolation b. Linear spline interpolation c. Cubic spline interpolation with natural BCs (φ (x 0 ) = φ (x 2 ) = 0) d. Cubic spline interpolation with clamped BCs (φ (x 0 ) = f (x 0 ) and φ (x 2 ) = f (x 2 )) B: None C: All D: a E: a, c, d F: a, c G: a, d H: b Question 3 Again a cubic spline is used to approximate f(x) = x 2 on the interval x [, ] using samples at x 0 =, x = 0, and x 2 =. The two branches of the spline are: { S 0 (x) = a 0 (x + ) 3 + b 0 (x + ) 2 + c 0 (x + ) + d 0 if x < 0, φ(x) = S (x) = a x 3 + b x 2 + c x + d if 0 x Natural BCs are used, i.e. φ (x 0 ) = φ (x 2 ) = 0. Further it is known that a 0 = 2 and b 0 = 0. What is the value of a? B: 3 2 C: D: 2 E: 0 F: 2 G: H: 3 2 Question 4 Consider tensor-product polynomial interpolation in 2d, with grid consisting of the rectangular lattice with nodes X ij = (x i, y j ), with x = (0,, 2, 3, 4) and y = (0, 2, ). Which of the following monomials are represented exactly by the interpolation? a. xy b. x 4 y 2 c. x 2 y 2 d. x 2 B: All C: None D: a, b, c E: d F: a, c, d G: b H: a, b 2 Quiz 205, Versie: D

3 Question 5 In radial-basis function interpolation a different radial function can be used at each node. Consider interpolation in d on the 3-node grid x 0 =, x = 0, and x 2 =. Each node has a corresponding basis function: ϕ 0 (x) = 0 x +, ϕ (x) = x, ϕ 2 (x) = 0 x. By setting up the interpolation conditions for the interpolant φ(x) = a 0 ϕ 0 (x) + a ϕ (x) + a 2 ϕ 2 (x), determine the value of a 0, given that f 0 =, f = 0, and f 2 = 2, and that a 2 = 40. B: 5 2 C: 3 2 D: 2 E: 0 F: 2 G: 3 2 H: 5 2 Module 4: Numerical differentiation and Integration Question 6 When deriving cubic splines we developed the system of equations: h 6 M i + 2h 3 M i + h 6 M i+ = f i+ f i h f i f i, h for the unknowns M i. The right-hand side of this equation (for a fixed i) looks a bit like a difference formula for some derivative of f(x) based on three samples f(x i h), f(x i ) and f(x i + h). What is it approximating? [Hint: Taylor...] B: f (x i ) C: hf (x i ) D: 2hf (x i ) E: f (x i ) F: hf (x i ) G: 2hf (x i ) H: 6h 2 f (x i ) Question 7 Difference rules can be found by differentiating a polynomial interpolant. Consider a 3-node grid (x 0, x, x 2 ) = ( h, 0, h), with corresponding function values (f 0, f, f 2 ). Using a Lagrange basis, first find a quadratic interpolant, and then differentiate it. Obtain an approximation of f (h/3), of the form: ( ) h f 3 h (a 0f 0 + a f + a 2 f 2 ), Which of the following is the resulting approximation of f (x) at x = h 3? B: h ( f 0 + f ) C: 2h ( f 0 + f 2 ) D: 3h ( 2f 0 f + 3f 2 ) E: 6h ( f 0 2f + 3f 2 ) F: 6h ( f 0 4f + 5f 2 ) G: 6h ( 4f 0 f + 5f 2 ) Question 8 Simpson s rule defined on the interval [, ] is: The same rule on a general interval [a, b] is: f(x) dx 3 f( ) f(0) + 3 f() b f(x) dx = a i=0 Determine the weights w and w 2, where h := b a. 2 w i f(x i ). 3 Quiz 205, Versie: D

4 B: w = and w 2 = C: w = h 6 and w 2 = h 6 D: w = 2h 3 and w 2 = h 6 E: w = h 6 and w 2 = 2h 3 F: w = 4h 3 and w 2 = h 3 G: w = h 3 and w 2 = 4h 3 H: w = h and w 2 = 2h Question 9 For a function of two variables f(x, y), we would like a finite-difference approximation of 2 f x y at (x 0, y 0 ). This can be achieved by using forward-differences in x: f x (x 0, y 0 ) φ(x 0, y 0 ) := f(x 0 + x, y 0 ) f(x 0, y 0 ) x and then applying forward-differences in y to the function φ. Using the notation f 00 := f(x 0, y 0 ), f 0 := f(x 0 + x, y 0 ), f 0 := f(x 0, y 0 + y), f := f(x 0 + x, y 0 + y) What is the resulting expression for 2 f x y? B: (f f 00 )/( x y) C: (f 0 f 0 )/( x y) D: (f f 0 f 0 + f 00 )/( x y) E: (f f 0 + f 0 f 00 )/( x y) F: (f + f 0 f 0 f 00 )/( x y) G: (f 0 + f 0 2f 00 )/( x y) Question 0 From polynomial interpolation we know the interpolation error (Cauchy). For f(x) approximated by an N + point polynomial interpolant p N, the error at a point x is: where the nodal polynomial E(f; x) := f(x) p N (x) = f (N+) (ξ) (N + )! ω N+ (x) := N (x x i ). i=0 ω N+ (x), Using this formula, and assuming f (N+) (ξ) = (for all x), which of the following is an estimate for the error in Simpson s rule for an integral on the interval [ h, h]? (Note: Simpson s rule has nodes at x = ( h, 0, h).) B: 0 C: h 3 /2 D: h 3 /2 E: h 3 /48 F: h 4 /2 G: h 4 /2 H: h 4 /48 4 Quiz 205, Versie: D

5 5 Quiz 205, Versie: D

6 6 Quiz 205, Versie: D

7 7 Quiz 205, Versie: D

8 8 Quiz 205, Versie: D

9 9 Quiz 205, Versie: D

10 0 Quiz 205, Versie: D

Cubic Splines MATH 375. J. Robert Buchanan. Fall Department of Mathematics. J. Robert Buchanan Cubic Splines

Cubic 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 information

Applied Numerical Analysis Homework #3

Applied Numerical Analysis Homework #3 Applied Numerical Analysis Homework #3 Interpolation: Splines, Multiple dimensions, Radial Bases, Least-Squares Splines Question Consider a cubic spline interpolation of a set of data points, and derivatives

More information

Jim Lambers MAT 460/560 Fall Semester Practice Final Exam

Jim 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 information

Lagrange Interpolation and Neville s Algorithm. Ron Goldman Department of Computer Science Rice University

Lagrange Interpolation and Neville s Algorithm. Ron Goldman Department of Computer Science Rice University Lagrange Interpolation and Neville s Algorithm Ron Goldman Department of Computer Science Rice University Tension between Mathematics and Engineering 1. How do Mathematicians actually represent curves

More information

Exam 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: 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

University of British Columbia Math 307, Final

University of British Columbia Math 307, Final 1 University of British Columbia Math 307, Final April 23, 2012 3.30-6.00pm Name: Student Number: Signature: Instructor: Instructions: 1. No notes, books or calculators are allowed. A MATLAB/Octave formula

More information

Math 113 Winter 2005 Departmental Final Exam

Math 113 Winter 2005 Departmental Final Exam Name Student Number Section Number Instructor Math Winter 2005 Departmental Final Exam Instructions: The time limit is hours. Problem consists of short answer questions. Problems 2 through are multiple

More information

Interpolation Theory

Interpolation 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 information

Taylor Series and Numerical Approximations

Taylor Series and Numerical Approximations Taylor Series and Numerical Approximations Hilary Weller h.weller@reading.ac.uk August 7, 05 An introduction to the concept of a Taylor series and how these are used in numerical analysis to find numerical

More information

UNIT-II INTERPOLATION & APPROXIMATION

UNIT-II INTERPOLATION & APPROXIMATION UNIT-II INTERPOLATION & APPROXIMATION LAGRANGE POLYNAMIAL 1. Find the polynomial by using Lagrange s formula and hence find for : 0 1 2 5 : 2 3 12 147 : 0 1 2 5 : 0 3 12 147 Lagrange s interpolation formula,

More information

(0, 0), (1, ), (2, ), (3, ), (4, ), (5, ), (6, ).

(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 information

We consider the problem of finding a polynomial that interpolates a given set of values:

We 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 information

MA2501 Numerical Methods Spring 2015

MA2501 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 information

Bindel, Spring 2012 Intro to Scientific Computing (CS 3220) Week 12: Monday, Apr 16. f(x) dx,

Bindel, Spring 2012 Intro to Scientific Computing (CS 3220) Week 12: Monday, Apr 16. f(x) dx, Panel integration Week 12: Monday, Apr 16 Suppose we want to compute the integral b a f(x) dx In estimating a derivative, it makes sense to use a locally accurate approximation to the function around the

More information

2013/2014 SEMESTER 1 MID-TERM TEST. 1 October :30pm to 9:30pm PLEASE READ THE FOLLOWING INSTRUCTIONS CAREFULLY:

2013/2014 SEMESTER 1 MID-TERM TEST. 1 October :30pm to 9:30pm PLEASE READ THE FOLLOWING INSTRUCTIONS CAREFULLY: 2013/2014 SEMESTER 1 MID-TERM TEST MA1505 MATHEMATICS I 1 October 2013 8:30pm to 9:30pm PLEASE READ THE FOLLOWING INSTRUCTIONS CAREFULLY: 1. This test paper consists of TEN (10) multiple choice questions

More information

3.1 Interpolation and the Lagrange Polynomial

3.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 information

Chapter 1 Numerical approximation of data : interpolation, least squares method

Chapter 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 information

Applied Numerical Analysis (AE2220-I) R. Klees and R.P. Dwight

Applied 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 information

Chapter 3 Interpolation and Polynomial Approximation

Chapter 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 information

Input: A set (x i -yy i ) data. Output: Function value at arbitrary point x. What for x = 1.2?

Input: 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 information

Lecture 10 Polynomial interpolation

Lecture 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 information

Physics 331 Introduction to Numerical Techniques in Physics

Physics 331 Introduction to Numerical Techniques in Physics Physics 331 Introduction to Numerical Techniques in Physics Instructor: Joaquín Drut Lecture 12 Last time: Polynomial interpolation: basics; Lagrange interpolation. Today: Quick review. Formal properties.

More information

Fourth Order RK-Method

Fourth Order RK-Method Fourth Order RK-Method The most commonly used method is Runge-Kutta fourth order method. The fourth order RK-method is y i+1 = y i + 1 6 (k 1 + 2k 2 + 2k 3 + k 4 ), Ordinary Differential Equations (ODE)

More information

Interpolation (Shape Functions)

Interpolation (Shape Functions) Mètodes Numèrics: A First Course on Finite Elements Interpolation (Shape Functions) Following: Curs d Elements Finits amb Aplicacions (J. Masdemont) http://hdl.handle.net/2099.3/36166 Dept. Matemàtiques

More information

Final Year M.Sc., Degree Examinations

Final Year M.Sc., Degree Examinations QP CODE 569 Page No Final Year MSc, Degree Examinations September / October 5 (Directorate of Distance Education) MATHEMATICS Paper PM 5: DPB 5: COMPLEX ANALYSIS Time: 3hrs] [Max Marks: 7/8 Instructions

More information

Data Analysis-I. Interpolation. Soon-Hyung Yook. December 4, Soon-Hyung Yook Data Analysis-I December 4, / 1

Data Analysis-I. Interpolation. Soon-Hyung Yook. December 4, Soon-Hyung Yook Data Analysis-I December 4, / 1 Data Analysis-I Interpolation Soon-Hyung Yook December 4, 2015 Soon-Hyung Yook Data Analysis-I December 4, 2015 1 / 1 Table of Contents Soon-Hyung Yook Data Analysis-I December 4, 2015 2 / 1 Introduction

More information

Notation Nodes are data points at which functional values are available or at which you wish to compute functional values At the nodes fx i

Notation Nodes are data points at which functional values are available or at which you wish to compute functional values At the nodes fx i LECTURE 6 NUMERICAL DIFFERENTIATION To find discrete approximations to differentiation (since computers can only deal with functional values at discrete points) Uses of numerical differentiation To represent

More information

Math 113 Winter 2005 Key

Math 113 Winter 2005 Key Name Student Number Section Number Instructor Math Winter 005 Key Departmental Final Exam Instructions: The time limit is hours. Problem consists of short answer questions. Problems through are multiple

More information

NUMERICAL 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. 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 information

Interpolation and Approximation

Interpolation 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 information

Module 11 Lesson 3. Polynomial Functions Quiz. Some questions are doubled up if a pool wants to be set up to randomize the questions.

Module 11 Lesson 3. Polynomial Functions Quiz. Some questions are doubled up if a pool wants to be set up to randomize the questions. Module 11 Lesson 3 Polynomial Functions Quiz Some questions are doubled up if a pool wants to be set up to randomize the questions. Question 1: Short answer/fill in the blank Find the limit graphically:

More information

Interpolation and extrapolation

Interpolation 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 information

Lecture Note 3: Polynomial Interpolation. Xiaoqun Zhang Shanghai Jiao Tong University

Lecture 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 information

COURSE Numerical integration of functions

COURSE Numerical integration of functions COURSE 6 3. Numerical integration of functions The need: for evaluating definite integrals of functions that has no explicit antiderivatives or whose antiderivatives are not easy to obtain. Let f : [a,

More information

MA3457/CS4033: Numerical Methods for Calculus and Differential Equations

MA3457/CS4033: Numerical Methods for Calculus and Differential Equations MA3457/CS4033: Numerical Methods for Calculus and Differential Equations Course Materials P A R T II B 14 2014-2015 1 2. APPROXIMATION CLASS 9 Approximation Key Idea Function approximation is closely related

More information

Some notes on Chapter 8: Polynomial and Piecewise-polynomial Interpolation

Some 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 information

Numerical Methods-Lecture VIII: Interpolation

Numerical Methods-Lecture VIII: Interpolation Numerical Methods-Lecture VIII: Interpolation (See Judd Chapter 6) Trevor Gallen Fall, 2015 1 / 113 Motivation Most solutions are functions Many functions are (potentially) high-dimensional Want a way

More information

Numerical Methods. King Saud University

Numerical 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 information

Math 578: Assignment 2

Math 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 information

Scientific Computing

Scientific 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 information

AP Calculus (BC) Chapter 9 Test No Calculator Section Name: Date: Period:

AP Calculus (BC) Chapter 9 Test No Calculator Section Name: Date: Period: WORKSHEET: Series, Taylor Series AP Calculus (BC) Chapter 9 Test No Calculator Section Name: Date: Period: 1 Part I. Multiple-Choice Questions (5 points each; please circle the correct answer.) 1. The

More information

Lecture 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 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 information

BACHELOR OF COMPUTER APPLICATIONS (BCA) (Revised) Term-End Examination December, 2015 BCS-054 : COMPUTER ORIENTED NUMERICAL TECHNIQUES

BACHELOR OF COMPUTER APPLICATIONS (BCA) (Revised) Term-End Examination December, 2015 BCS-054 : COMPUTER ORIENTED NUMERICAL TECHNIQUES No. of Printed Pages : 5 BCS-054 BACHELOR OF COMPUTER APPLICATIONS (BCA) (Revised) Term-End Examination December, 2015 058b9 BCS-054 : COMPUTER ORIENTED NUMERICAL TECHNIQUES Time : 3 hours Maximum Marks

More information

Chapter 8: Taylor s theorem and L Hospital s rule

Chapter 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 information

8.3 Numerical Quadrature, Continued

8.3 Numerical Quadrature, Continued 8.3 Numerical Quadrature, Continued Ulrich Hoensch Friday, October 31, 008 Newton-Cotes Quadrature General Idea: to approximate the integral I (f ) of a function f : [a, b] R, use equally spaced nodes

More information

5. Hand in the entire exam booklet and your computer score sheet.

5. 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 information

Simpson s 1/3 Rule Simpson s 1/3 rule assumes 3 equispaced data/interpolation/integration points

Simpson s 1/3 Rule Simpson s 1/3 rule assumes 3 equispaced data/interpolation/integration points CE 05 - Lecture 5 LECTURE 5 UMERICAL ITEGRATIO COTIUED Simpson s / Rule Simpson s / rule assumes equispaced data/interpolation/integration points Te integration rule is based on approximating fx using

More information

FINITE DIFFERENCES. Lecture 1: (a) Operators (b) Forward Differences and their calculations. (c) Backward Differences and their calculations.

FINITE DIFFERENCES. Lecture 1: (a) Operators (b) Forward Differences and their calculations. (c) Backward Differences and their calculations. FINITE DIFFERENCES Lecture 1: (a) Operators (b) Forward Differences and their calculations. (c) Backward Differences and their calculations. 1. Introduction When a function is known explicitly, it is easy

More information

Unit 1 Vocabulary. A function that contains 1 or more or terms. The variables may be to any non-negative power.

Unit 1 Vocabulary. A function that contains 1 or more or terms. The variables may be to any non-negative power. MODULE 1 1 Polynomial A function that contains 1 or more or terms. The variables may be to any non-negative power. 1 Modeling Mathematical modeling is the process of using, and to represent real world

More information

Math Numerical Analysis Mid-Term Test Solutions

Math 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 information

Preliminary Examination in Numerical Analysis

Preliminary 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 information

Integration, differentiation, and root finding. Phys 420/580 Lecture 7

Integration, differentiation, and root finding. Phys 420/580 Lecture 7 Integration, differentiation, and root finding Phys 420/580 Lecture 7 Numerical integration Compute an approximation to the definite integral I = b Find area under the curve in the interval Trapezoid Rule:

More information

Chapter 4: Interpolation and Approximation. October 28, 2005

Chapter 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 information

CS 450 Numerical Analysis. Chapter 8: Numerical Integration and Differentiation

CS 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 information

you 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

you 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 information

CS 323: Numerical Analysis and Computing

CS 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 information

Numerical Methods I: Polynomial Interpolation

Numerical 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

Test Codes : MIA (Objective Type) and MIB (Short Answer Type) 2007

Test Codes : MIA (Objective Type) and MIB (Short Answer Type) 2007 Test Codes : MIA (Objective Type) and MIB (Short Answer Type) 007 Questions will be set on the following and related topics. Algebra: Sets, operations on sets. Prime numbers, factorisation of integers

More information

There is a unique function s(x) that has the required properties. It turns out to also satisfy

There is a unique function s(x) that has the required properties. It turns out to also satisfy Numerical Analysis Grinshpan Natural Cubic Spline Let,, n be given nodes (strictly increasing) and let y,, y n be given values (arbitrary) Our goal is to produce a function s() with the following properties:

More information

Numerical Solutions to Partial Differential Equations

Numerical Solutions to Partial Differential Equations Numerical Solutions to Partial Differential Equations Zhiping Li LMAM and School of Mathematical Sciences Peking University Numerical Methods for Partial Differential Equations Finite Difference Methods

More information

Test 3 Version A. On my honor, I have neither given nor received inappropriate or unauthorized information at any time before or during this test.

Test 3 Version A. On my honor, I have neither given nor received inappropriate or unauthorized information at any time before or during this test. Student s Printed Name: Instructor: CUID: Section: Instructions: You are not permitted to use a calculator on any portion of this test. You are not allowed to use any textbook, notes, cell phone, laptop,

More information

Numerical Methods I Orthogonal Polynomials

Numerical Methods I Orthogonal Polynomials Numerical Methods I Orthogonal Polynomials Aleksandar Donev Courant Institute, NYU 1 donev@courant.nyu.edu 1 Course G63.2010.001 / G22.2420-001, Fall 2010 Nov. 4th and 11th, 2010 A. Donev (Courant Institute)

More information

CIV-E1060 Engineering Computation and Simulation Examination, December 12, 2017 / Niiranen

CIV-E1060 Engineering Computation and Simulation Examination, December 12, 2017 / Niiranen CIV-E16 Engineering Computation and Simulation Examination, December 12, 217 / Niiranen This examination consists of 3 problems rated by the standard scale 1...6. Problem 1 Let us consider a long and tall

More information

Numerical Analysis Preliminary Exam 10.00am 1.00pm, January 19, 2018

Numerical 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 information

Go over the illustrated examples in each section.

Go over the illustrated examples in each section. Math 242 Fall 2009 Please before you start the practice problems, go over the illustrated examples in each section first. Cover up the solutions and try to work out the answers on your own. Practice Problems

More information

Do not turn over until you are told to do so by the Invigilator.

Do not turn over until you are told to do so by the Invigilator. UNIVERSITY OF EAST ANGLIA School of Mathematics Main Series UG Examination 216 17 INTRODUCTION TO NUMERICAL ANALYSIS MTHE612B Time allowed: 3 Hours Attempt QUESTIONS 1 and 2, and THREE other questions.

More information

Interpolation APPLIED PROBLEMS. Reading Between the Lines FLY ROCKET FLY, FLY ROCKET FLY WHAT IS INTERPOLATION? Figure Interpolation of discrete data.

Interpolation APPLIED PROBLEMS. Reading Between the Lines FLY ROCKET FLY, FLY ROCKET FLY WHAT IS INTERPOLATION? Figure Interpolation of discrete data. WHAT IS INTERPOLATION? Given (x 0,y 0 ), (x,y ), (x n,y n ), find the value of y at a value of x that is not given. Interpolation Reading Between the Lines Figure Interpolation of discrete data. FLY ROCKET

More information

Engg. Math. II (Unit-IV) Numerical Analysis

Engg. Math. II (Unit-IV) Numerical Analysis Dr. Satish Shukla of 33 Engg. Math. II (Unit-IV) Numerical Analysis Syllabus. Interpolation and Curve Fitting: Introduction to Interpolation; Calculus of Finite Differences; Finite Difference and Divided

More information

CS 323: Numerical Analysis and Computing

CS 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 information

Algebra 1. Predicting Patterns & Examining Experiments. Unit 5: Changing on a Plane Section 4: Try Without Angles

Algebra 1. Predicting Patterns & Examining Experiments. Unit 5: Changing on a Plane Section 4: Try Without Angles Section 4 Examines triangles in the coordinate plane, we will mention slope, but not angles (we will visit angles in Unit 6). Students will need to know the definition of collinear, isosceles, and congruent...

More information

n 1 f n 1 c 1 n+1 = c 1 n $ c 1 n 1. After taking logs, this becomes

n 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 information

Sections 7.1, 7.2: Sums, differences, products of polynomials CHAPTER 7: POLYNOMIALS

Sections 7.1, 7.2: Sums, differences, products of polynomials CHAPTER 7: POLYNOMIALS Sections 7.1, 7.2: Sums, differences, products of polynomials CHAPTER 7: POLYNOMIALS Quiz results Average 73%: high h score 100% Problems: Keeping track of negative signs x = + = + Function notation f(x)

More information

1 Lecture 8: Interpolating polynomials.

1 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 information

Hermite Interpolation

Hermite Interpolation Jim Lambers MAT 77 Fall Semester 010-11 Lecture Notes These notes correspond to Sections 4 and 5 in the text Hermite Interpolation Suppose that the interpolation points are perturbed so that two neighboring

More information

Interpolation. 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 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 information

Secondary Math 3 Honors - Polynomial and Polynomial Functions Test Review

Secondary Math 3 Honors - Polynomial and Polynomial Functions Test Review Name: Class: Date: Secondary Math 3 Honors - Polynomial and Polynomial Functions Test Review 1 Write 3x 2 ( 2x 2 5x 3 ) in standard form State whether the function is even, odd, or neither Show your work

More information

Midterm Review. Igor Yanovsky (Math 151A TA)

Midterm 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 information

2-2: Evaluate and Graph Polynomial Functions

2-2: Evaluate and Graph Polynomial Functions 2-2: Evaluate and Graph Polynomial Functions What is a polynomial? -A monomial or sum of monomials with whole number exponents. Degree of a polynomial: - The highest exponent of the polynomial How do we

More information

5.3. Polynomials and Polynomial Functions

5.3. Polynomials and Polynomial Functions 5.3 Polynomials and Polynomial Functions Polynomial Vocabulary Term a number or a product of a number and variables raised to powers Coefficient numerical factor of a term Constant term which is only a

More information

University of Illinois at Urbana-Champaign College of Engineering

University of Illinois at Urbana-Champaign College of Engineering University of Illinois at Urbana-Champaign College of Engineering CEE 570 Finite Element Methods (in Solid and Structural Mechanics) Spring Semester 2014 Quiz #2 April 14, 2014 Name: SOLUTION ID#: PS1.:

More information

Quick-and-Easy Factoring. of lower degree; several processes are available to fi nd factors.

Quick-and-Easy Factoring. of lower degree; several processes are available to fi nd factors. Lesson 11-3 Quick-and-Easy Factoring BIG IDEA Some polynomials can be factored into polynomials of lower degree; several processes are available to fi nd factors. Vocabulary factoring a polynomial factored

More information

A High-Order Galerkin Solver for the Poisson Problem on the Surface of the Cubed Sphere

A High-Order Galerkin Solver for the Poisson Problem on the Surface of the Cubed Sphere A High-Order Galerkin Solver for the Poisson Problem on the Surface of the Cubed Sphere Michael Levy University of Colorado at Boulder Department of Applied Mathematics August 10, 2007 Outline 1 Background

More information

1 Piecewise Cubic Interpolation

1 Piecewise Cubic Interpolation Piecewise Cubic Interpolation Typically the problem with piecewise linear interpolation is the interpolant is not differentiable as the interpolation points (it has a kinks at every interpolation point)

More information

Find a common monomial factor. = 2y 3 (y + 3)(y 3) Difference of two squares

Find a common monomial factor. = 2y 3 (y + 3)(y 3) Difference of two squares EXAMPLE 1 Find a common monomial factor Factor the polynomial completely. a. x 3 + 2x 2 15x = x(x 2 + 2x 15) Factor common monomial. = x(x + 5)(x 3) Factor trinomial. b. 2y 5 18y 3 = 2y 3 (y 2 9) Factor

More information

t dt Estimate the value of the integral with the trapezoidal rule. Use n = 4.

t dt Estimate the value of the integral with the trapezoidal rule. Use n = 4. Trapezoidal Rule We have already found the value of an integral using rectangles in the first lesson of this module. In this section we will again be estimating the value of an integral using geometric

More information

CS412: Introduction to Numerical Methods

CS412: 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 information

LECTURE 16 GAUSS QUADRATURE In general for Newton-Cotes (equispaced interpolation points/ data points/ integration points/ nodes).

LECTURE 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 information

Empirical Models Interpolation Polynomial Models

Empirical Models Interpolation Polynomial Models Mathematical Modeling Lia Vas Empirical Models Interpolation Polynomial Models Lagrange Polynomial. Recall that two points (x 1, y 1 ) and (x 2, y 2 ) determine a unique line y = ax + b passing them (obtained

More information

SMOOTH APPROXIMATION OF DATA WITH APPLICATIONS TO INTERPOLATING AND SMOOTHING. Karel Segeth Institute of Mathematics, Academy of Sciences, Prague

SMOOTH APPROXIMATION OF DATA WITH APPLICATIONS TO INTERPOLATING AND SMOOTHING. Karel Segeth Institute of Mathematics, Academy of Sciences, Prague SMOOTH APPROXIMATION OF DATA WITH APPLICATIONS TO INTERPOLATING AND SMOOTHING Karel Segeth Institute of Mathematics, Academy of Sciences, Prague CONTENTS The problem of interpolating and smoothing Smooth

More information

Numerical Methods I: Interpolation (cont ed)

Numerical 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 information

USHA RAMA COLLEGE OF ENGINEERING & TECHNOLOGY

USHA RAMA COLLEGE OF ENGINEERING & TECHNOLOGY Code No: R007/R0 Set No. I B.Tech I Semester Supplementary Examinations, Feb/Mar 04 MATHEMATICAL METHODS ( Common to Civil Engineering, Electrical & Electronics Engineering, Computer Science & Engineering,

More information

LHS Algebra Pre-Test

LHS Algebra Pre-Test Your Name Teacher Block Grade (please circle): 9 10 11 12 Course level (please circle): Honors Level 1 Instructions LHS Algebra Pre-Test The purpose of this test is to see whether you know Algebra 1 well

More information

CHAPTER 3 Further properties of splines and B-splines

CHAPTER 3 Further properties of splines and B-splines CHAPTER 3 Further properties of splines and B-splines In Chapter 2 we established some of the most elementary properties of B-splines. In this chapter our focus is on the question What kind of functions

More information

Algorithms and Data Structures Final Lesson

Algorithms and Data Structures Final Lesson Algorithms and Data Structures Final Lesson Michael Schwarzkopf https://www.uni weimar.de/de/medien/professuren/medieninformatik/grafische datenverarbeitung Bauhaus University Weimar July 11, 2018 (Corrected

More information

Bilinear Quadrilateral (Q4): CQUAD4 in GENESIS

Bilinear Quadrilateral (Q4): CQUAD4 in GENESIS Bilinear Quadrilateral (Q4): CQUAD4 in GENESIS The Q4 element has four nodes and eight nodal dof. The shape can be any quadrilateral; we ll concentrate on a rectangle now. The displacement field in terms

More information

2, or x 5, 3 x 0, x 2

2, or x 5, 3 x 0, x 2 Pre-AP Algebra 2 Lesson 2 End Behavior and Polynomial Inequalities Objectives: Students will be able to: use a number line model to sketch polynomials that have repeated roots. use a number line model

More information

MAFS Algebra 1. Polynomials. Day 15 - Student Packet

MAFS Algebra 1. Polynomials. Day 15 - Student Packet MAFS Algebra 1 Polynomials Day 15 - Student Packet Day 15: Polynomials MAFS.91.A-SSE.1., MAFS.91.A-SSE..3a,b, MAFS.91.A-APR..3, MAFS.91.F-IF.3.7c I CAN rewrite algebraic expressions in different equivalent

More information

Northwood High School Algebra 2/Honors Algebra 2 Summer Review Packet

Northwood High School Algebra 2/Honors Algebra 2 Summer Review Packet Northwood High School Algebra 2/Honors Algebra 2 Summer Review Packet This assignment should serve as a review of the Algebra 1 skills necessary for success. Our hope is that this review will keep your

More information

Examination paper for TMA4215 Numerical Mathematics

Examination 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 information

SPLINE INTERPOLATION

SPLINE 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 information