Math Numerical Analysis Mid-Term Test Solutions

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

Math 473: Practice Problems for Test 1, Fall 2011, SOLUTIONS

Edexcel GCE Further Pure Mathematics (FP1) Required Knowledge Information Sheet. Daniel Hammocks

Lösning: Tenta Numerical Analysis för D, L. FMN011,

Q 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

Jim Lambers MAT 460/560 Fall Semester Practice Final Exam

Root Finding (and Optimisation)

x x2 2 + x3 3 x4 3. Use the divided-difference method to find a polynomial of least degree that fits the values shown: (b)

CHAPTER 2 POLYNOMIALS KEY POINTS

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.

Two hours. To be provided by Examinations Office: Mathematical Formula Tables. THE UNIVERSITY OF MANCHESTER. 29 May :45 11:45

Integration of Rational Functions by Partial Fractions

Secondary Math 3 Honors - Polynomial and Polynomial Functions Test Review

Math 128A: Homework 2 Solutions

Integration of Rational Functions by Partial Fractions

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

MATH ASSIGNMENT 07 SOLUTIONS. 8.1 Following is census data showing the population of the US between 1900 and 2000:

Math /Foundations of Algebra/Fall 2017 Numbers at the Foundations: Real Numbers In calculus, the derivative of a function f(x) is defined

Roots and Coefficients Polynomials Preliminary Maths Extension 1

Preliminary Examination in Numerical Analysis

Midterm Review. Igor Yanovsky (Math 151A TA)

MS 2001: Test 1 B Solutions

5.3. Polynomials and Polynomial Functions

Practice Test - Chapter 2

Solution of Algebric & Transcendental Equations

Chapter 4: Interpolation and Approximation. October 28, 2005

The problems that follow illustrate the methods covered in class. They are typical of the types of problems that will be on the tests.

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

1 Review of Interpolation using Cubic Splines

Homework and Computer Problems for Math*2130 (W17).

Applied Numerical Analysis Homework #3

Polynomial functions right- and left-hand behavior (end behavior):

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

Exam 2. Average: 85.6 Median: 87.0 Maximum: Minimum: 55.0 Standard Deviation: Numerical Methods Fall 2011 Lecture 20

A monomial or sum of monomials

Math 578: Assignment 2

Lectures 9-10: Polynomial and piecewise polynomial interpolation

Introductory Numerical Analysis

Numerical Solution of f(x) = 0

Mathematics (MEI) Advanced Subsidiary GCE Core 1 (4751) June 2010

1) The line has a slope of ) The line passes through (2, 11) and. 6) r(x) = x + 4. From memory match each equation with its graph.

CS 323: Numerical Analysis and Computing

Algebra III Chapter 2 Note Packet. Section 2.1: Polynomial Functions

MATH10001 Mathematical Workshop Graph Fitting Project part 2

Motivation: We have already seen an example of a system of nonlinear equations when we studied Gaussian integration (p.8 of integration notes)

Lecture 10 Polynomial interpolation

Practice Test - Chapter 2

Mathematics (MEI) Advanced Subsidiary GCE Core 1 (4751) May 2010

Continuity. MATH 161 Calculus I. J. Robert Buchanan. Fall Department of Mathematics

Numerical techniques to solve equations

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

March Algebra 2 Question 1. March Algebra 2 Question 1

PART I Lecture Notes on Numerical Solution of Root Finding Problems MATH 435

Lecture 7. Root finding I. 1 Introduction. 2 Graphical solution

NUMERICAL ANALYSIS PROBLEMS

3.1 Introduction. Solve non-linear real equation f(x) = 0 for real root or zero x. E.g. x x 1.5 =0, tan x x =0.

Root Finding: Close Methods. Bisection and False Position Dr. Marco A. Arocha Aug, 2014

PLC Papers. Created For:

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

Section 0.2 & 0.3 Worksheet. Types of Functions

ROOT FINDING REVIEW MICHELLE FENG

Solution of Nonlinear Equations

Assessment Exemplars: Polynomials, Radical and Rational Functions & Equations

, a 1. , a 2. ,..., a n

Polynomial Functions

MATH 3795 Lecture 12. Numerical Solution of Nonlinear Equations.

MA2501 Numerical Methods Spring 2015

Math123 Lecture 1. Dr. Robert C. Busby. Lecturer: Office: Korman 266 Phone :

Numerical interpolation, extrapolation and fi tting of data

Curve Fitting and Interpolation

Chapter 2 notes from powerpoints

MA 1128: Lecture 19 4/20/2018. Quadratic Formula Solving Equations with Graphs

Chapter 8. Exploring Polynomial Functions. Jennifer Huss

Section 3.2 Polynomial Functions and Their Graphs

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

Chapter Five Notes N P U2C5

CHAPTER-II ROOTS OF EQUATIONS

Quadratic and Polynomial Inequalities in one variable have look like the example below.

CM2104: Computational Mathematics General Maths: 2. Algebra - Factorisation

Chapter 3 Interpolation and Polynomial Approximation

Bisection and False Position Dr. Marco A. Arocha Aug, 2014

Problems on Numerical Methods for Engineers. Pedro Fortuny Ayuso. EPIG, Gijón. Universidad de Oviedo address:

Math 175 MT#1 Additional Material Study Sheet

Numerical and Statistical Methods

STOP, a i+ 1 is the desired root. )f(a i) > 0. Else If f(a i+ 1. Set a i+1 = a i+ 1 and b i+1 = b Else Set a i+1 = a i and b i+1 = a i+ 1

Scientific Computing

2.4 The Precise Definition of a Limit

INTERPOLATION. 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. 1. Judd, K. Numerical Methods in Economics, Cambridge: MIT Press. Chapter

Numerical and Statistical Methods

CS 323: Numerical Analysis and Computing

Chapter 1- Polynomial Functions

Maths Class 11 Chapter 5 Part -1 Quadratic equations

15 Nonlinear Equations and Zero-Finders

6x 2 8x + 5 ) = 12x 8

The highest degree term is x $, therefore the function is degree 4 (quartic) c) What are the x-intercepts?

R x n. 2 R We simplify this algebraically, obtaining 2x n x n 1 x n x n

Contraction Mappings Consider the equation

Unit 2 Rational Functionals Exercises MHF 4UI Page 1

Finding the Roots of f(x) = 0. Gerald W. Recktenwald Department of Mechanical Engineering Portland State University

Transcription:

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) and f(b) are of opposite sign. (b) The bisection method is applied to the function y = (x )(x 3)(x 4) (graph given below). The initial interval used for the method is [a,b] = [0, ]. Which root will the method converge to(circle it on the graph). 0 0 - -0-0 3 4 For the first iteration c =.. At x =., the function is positive. Since the function is negative at x = 0, we move b over to. Then the only root left is the root at x =, so the method must converge to. (c) The MATLAB command format long, pi*cos(pi/) returns ans =.936706937790e-6 Complete each of the following statements regarding the accuracy of the approximation method used by MATLAB to compute π cos(π/). The absolute error in MATLAB s approximation to π cos(π/) is:.936706937790e-6 The relative error in MATLAB s approximation to π cos(π/) is (fill in the most appropriate answer). Undefined or infinite. (d) Give one advantage of using Newton s Divided Difference to construct an interpolating polynomial over using Langrange interpolation. The main advantage is that it is easy to add more interpolation points

. Consider the sum, S = Use 3 digit rounding in each step of the following calculations. (a) Find S by adding up the terms in increasing order. Here is the result from each calculation i= i 3 + 0. =.3.3 + 0.0370 =.7.7 + 0.06 =.9.9 +.008 =.0. (b) Find S by adding up the terms in decreasing order. 0.008 + 0.06 = 0.036 0.036 + 0.0370 = 0.0606 0.0606 + 0. = 0.86 + 0.86 =.9. (c) If the true answer is S.866037 find the relative error in each of the above calculations. Relative error for part a):.0.866037.8667 0.0 Relative error for part b):.9.866037.8667 0.0037 (d) When adding up a group of numbers with different magnitudes is it better to start with the smaller numbers or the larger. Why? The relative error for part b) is roughly /3 that of the relative error for part a). The reason is that when you add a small number to a very larger number and then round off, you loose many of the digits in the small number. If this only happens once or twice it doesn t have any effect. However after many additions, the effect can grow and have cause the relative error of the resulting calculation to become significant. Useful Table i 3 4 i 3 0. 0.03703703704 0.0600000 0.008 3. Show that Newton s method applied to a linear function f(x) = mx + b,m 0

will converge to a root on the first iteration. f (x) = m, so the iteration formula is x i+ = x i f(x i) f (x i ), = x i mx i + b m, = mx i mx i b m = b m, So, given any x 0, x = b m the root. 4. Consider the following data set i 3 4 x i 0 y i 7 - (a) Construct a divided difference table for the data. This is where most of the work is done, I will just give the table x i f[x i ] f[x i,x i+ ] f[x i,x i+,x i+ ] f[x i,x i+,x i+,x i+3 ] 0 7 3 - - 6 - (b) Using the table find a quadratic polynomial going through the first 3 points{(x i,y i )} 3 i=. The quadratic is given by P (x) = + x x(x ) (c) Find a polynomial going through all the points. Given the following data set: P 3 (x) = + x x(x ) + 6 x(x )(x ) i 0 3 x i 3 4 y i..8 3.3 4.6. We wish to find the line P(x) = c 0 + c x which minimizes 3 (P(x i) y i ). Give the linear system which we must solve to find c 0 and c. (You do not need to solve the system) This is just a linear least squares approximation. To find the elements in the matrix, we will need 3, 3 x i, 3 x i, 3 y i and 3 x iy i. To make these calculations I will write out the table 3

x i 3 4 x i 4 9 6 y i..8 3.3 4.6 x i y i. 3.6 9.9 8.4 Adding up the rows, we have, = 4, x i = 0, x i = 30, y i = 0.8, x i y i = 33. So the system we need to solve is given by, ( ) ( ) 4 0 c0 = 0 30 c ( 0.8 33 ). 6. A free cubic spline s for a function f is defined on [, 3] by { s0 (x) = (x ) (x ) s(x) = 3 x < s (x) = a + b(x ) + c(x ) + d(x ) 3 x 3 Find a,b,c,d. First we apply s 0 () = s () this gives us a =. We next apply s 0() = s (). This gives up, b =. Now we apply s 0() = s (). This gives us c = 3. There are two more conditions to apply, the free spline boundary conditions. s 0(0) = 0 is already satisfied. Now we apply s (3) = 0. This gives us d = and we are done. 7. Construct a parametric interpolating polynomial which passes through the following points: i 3 x i - 0 y i 0 0. We start by setting t = n =, so t = 0, t = and t 3 =. We then have the following divided difference tables: t i f[t i ] f[t i,t i+ ] f[t i,t i+,t i+ ] 0-0 0 t i f[t i ] f[t i,t i+ ] f[t i,t i+,t i+ ] 0 0 - -3 4

So the parametric representation of the polynomial is given by, x(t) = + (t 0), y(t) = 0 + (t 0) 3(t 0)(t ).