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)

Similar documents
AIMS Exercise Set # 1

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.

Jim Lambers MAT 460/560 Fall Semester Practice Final Exam

(f(x) P 3 (x)) dx. (a) The Lagrange formula for the error is given by

Virtual University of Pakistan

LECTURE NOTES ELEMENTARY NUMERICAL METHODS. Eusebius Doedel

TABLE OF CONTENTS INTRODUCTION, APPROXIMATION & ERRORS 1. Chapter Introduction to numerical methods 1 Multiple-choice test 7 Problem set 9

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

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

CS 257: Numerical Methods

Preface. 2 Linear Equations and Eigenvalue Problem 22

Numerical Methods for Engineers. and Scientists. Applications using MATLAB. An Introduction with. Vish- Subramaniam. Third Edition. Amos Gilat.

Math Numerical Analysis Mid-Term Test Solutions

Computational Methods. Systems of Linear Equations

Review. Numerical Methods Lecture 22. Prof. Jinbo Bi CSE, UConn

Department of Applied Mathematics and Theoretical Physics. AMA 204 Numerical analysis. Exam Winter 2004

Math 578: Assignment 2

NUMERICAL MATHEMATICS AND COMPUTING

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

MATHEMATICAL METHODS INTERPOLATION

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

MTH603 FAQ + Short Questions Answers.

Chapter 5 HIGH ACCURACY CUBIC SPLINE APPROXIMATION FOR TWO DIMENSIONAL QUASI-LINEAR ELLIPTIC BOUNDARY VALUE PROBLEMS

Page No.1. MTH603-Numerical Analysis_ Muhammad Ishfaq

KINGS COLLEGE OF ENGINEERING DEPARTMENT OF MATHEMATICS ACADEMIC YEAR / EVEN SEMESTER QUESTION BANK

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

1 Number Systems and Errors 1

Fixed point iteration and root finding

JACOBI S ITERATION METHOD

Computational Methods

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

Review Questions REVIEW QUESTIONS 71

Cayley-Hamilton Theorem

Numerical Analysis & Computer Programming

AMSC/CMSC 466 Problem set 3

PARTIAL DIFFERENTIAL EQUATIONS

Department of Mathematics California State University, Los Angeles Master s Degree Comprehensive Examination in. NUMERICAL ANALYSIS Spring 2015

Name of the Student: Unit I (Solution of Equations and Eigenvalue Problems)

M.SC. PHYSICS - II YEAR

Numerical interpolation, extrapolation and fi tting of data

Numerical Methods - Numerical Linear Algebra

Preliminary/Qualifying Exam in Numerical Analysis (Math 502a) Spring 2012

HOMEWORK PROBLEMS FROM STRANG S LINEAR ALGEBRA AND ITS APPLICATIONS (4TH EDITION)

Exact and Approximate Numbers:

Numerical Methods. Scientists. Engineers

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

Lectures 9-10: Polynomial and piecewise polynomial interpolation

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

Applied Numerical Analysis

Introduction - Motivation. Many phenomena (physical, chemical, biological, etc.) are model by differential equations. f f(x + h) f(x) (x) = lim

COURSE Numerical methods for solving linear systems. Practical solving of many problems eventually leads to solving linear systems.

1 Solutions to selected problems

Numerical Methods with MATLAB

Numerical Analysis. A Comprehensive Introduction. H. R. Schwarz University of Zürich Switzerland. with a contribution by

Introduction to Applied Linear Algebra with MATLAB

Today s class. Linear Algebraic Equations LU Decomposition. Numerical Methods, Fall 2011 Lecture 8. Prof. Jinbo Bi CSE, UConn

Solving Linear Systems of Equations

Mathematics Qualifying Exam Study Material

Cheat Sheet for MATH461

Hani Mehrpouyan, California State University, Bakersfield. Signals and Systems

SOLUTION OF EQUATION AND EIGENVALUE PROBLEMS PART A( 2 MARKS)

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

Lecture Note 7: Iterative methods for solving linear systems. Xiaoqun Zhang Shanghai Jiao Tong University

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

Numerical Methods. King Saud University

Preliminary Examination in Numerical Analysis

MATH 3321 Sample Questions for Exam 3. 3y y, C = Perform the indicated operations, if possible: (a) AC (b) AB (c) B + AC (d) CBA

Chap 3. Linear Algebra

NUMERICAL COMPUTATION IN SCIENCE AND ENGINEERING

CS 323: Numerical Analysis and Computing

Computation Fluid Dynamics

Review of matrices. Let m, n IN. A rectangle of numbers written like A =

Introduction to Numerical Analysis

Mathematical Methods for Numerical Analysis and Optimization

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

CS227-Scientific Computing. Lecture 4: A Crash Course in Linear Algebra

MAT 460: Numerical Analysis I. James V. Lambers

MecE 390 Final examination, Winter 2014

10.2 ITERATIVE METHODS FOR SOLVING LINEAR SYSTEMS. The Jacobi Method

Problem Set (T) If A is an m n matrix, B is an n p matrix and D is a p s matrix, then show

USHA RAMA COLLEGE OF ENGINEERING & TECHNOLOGY

Computational Methods in Civil Engineering

CPE 310: Numerical Analysis for Engineers

PLC Papers. Created For:

Numerical Analysis. Introduction to. Rostam K. Saeed Karwan H.F. Jwamer Faraidun K. Hamasalh

Chapter Two: Numerical Methods for Elliptic PDEs. 1 Finite Difference Methods for Elliptic PDEs

Linear Algebra Practice Problems

Exam in TMA4215 December 7th 2012

Numerical Analysis Preliminary Exam 10 am to 1 pm, August 20, 2018

Math 411 Preliminaries

Midterm for Introduction to Numerical Analysis I, AMSC/CMSC 466, on 10/29/2015

An Introduction to Numerical Analysis. James Brannick. The Pennsylvania State University

Interpolation. Chapter Interpolation. 7.2 Existence, Uniqueness and conditioning

Introductory Numerical Analysis

235 Final exam review questions

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

Introduction to PDEs and Numerical Methods Lecture 7. Solving linear systems

CS 323: Numerical Analysis and Computing

MTH5112 Linear Algebra I MTH5212 Applied Linear Algebra (2017/2018)

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

Transcription:

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) is approximated by the first four terms of this series. 2. Set up a divided-difference table for a function f(x) which takes the values: f() =, f(2) =.2, f(4) =.8 and f(5) = 24.75. Express the cubic interpolating polynomial in Newton form, and use it to estimate f(3). 3. Use the divided-difference method to find a polynomial of least degree that fits the values shown: x : 2 3 y : 7 5 (b) x : 3 2 4 5 y : 2 6 4 2 4. Use the following values to form a divided difference table x.5 2 3 3.5 4 log x.769.33.4772.5447.626 Interpolate for log 2.4 and log.2, using third-degree interpolation polynomials in Newton form. 5. The function e x is tabulated at intervals of. between x = and x =. Find an upper bound on the truncation error incurred by using linear interpolation in this table. You would, of course, make a sensible choice of interpolation nodes for any interpolation you wished to carry out. 6. The values of log x for x = 2., 2.5, 3. are to be used to estimate log(2.37) by quadratic interpolation. Use the truncation error theorem to prove that the resulting approximation is an underestimate, and obtain upper and lower bounds for its truncation error. Calculate the quadratic approximation and compare the actual error with your bounds. 7. Set up a divided difference table for the following data: x..2.4.6.8 2. f(x) 2.25.73.97.7.43 3.5 Show that a cubic polynomial in x fits the data, and find that polynomial. 8. How small must the interval h be to guarantee that the global truncation error has magnitude less than 6 when the trapezium rule is used to evaluate 2 exp( x2 ) dx? 9. By repeated application of the trapezium rule, or otherwise, compute, correct to four significant figures, π 2.3 sin 2 x dx.

. Starting with the trapezium rule with steplengths.8,.4,.2 and., use Romberg s method to estimate the value of.8 exp( x 2 ) dx. How many figures of your answer do you believe to be correct?. By any suitable method calculate +.2x 3 dx correct to five decimal places. Describe the method you used. 2. Use the table below to estimate 3 f(x) dx as accurately as you can. How many figures of your answer do you believe to be correct? x..5 2. 2.5 3. f(x) 3.24 4.42569 6.424 8.34.46675 3. Use the trapezium rule to obtain estimates T (h), with h =, /2, /4, /8 and /6, for the integral e cos 2πx dx. Tabulate the ratios T (h) T (h/2) T (h/2) T (h/4). Would Romberg s method help here? Explain. How accurate do you think your best estimate of this integral is? 4. Verify that the formula e x f(x) dx f() is exact when f(x) is a polynomial of first degree, but not when f(x) is a quadratic. 5. Apply a Taylor series method to the initial-value problem y = t y, y() = 2, to evaluate y(.) and y(.2) correct to five significant figures. Compare with the exact solution. 6. Find y(.2) correct to four decimal places, given that y = ty, y() =, y () =. 7. Apply Euler s method to the initial-value problem y = t y, y() = 2, to estimate y(.) and y(.2). Try steplengths.2,. and.5. Compare with your results for Problem 5, and discuss. 8. Write y = ty as a pair of equations of first order. Hence apply Euler s method, with steplengths. and.5, to estimate y(.2), given that y() = = y (). Use Richardson extrapolation. Compare with Problem 6. On the basis of that comparison, estimate how small the steplength would need to be to give an error of less than 5 in the approximation for y(.2) computed by Euler s method. 9. Given that y = sin(ty) and y() =, estimate y(.2) by using a second-order Runge-Kutta formula, with steplength h =.2 and (b) with h =.. Use Richardson extrapolation on the results. Conclusions?

2. Use a second-order Runge-Kutta method, with steplength., to estimate y(.2), given that dy dt = sin(y2 ), with y() = Keep five decimal places in your calculations. 2. Write the differential equation y = ye t as a pair of equations of first order. The initial conditions are y() = = y (). Use SIMULINK to find y() correct to five decimal places. Describe how you did the calculation and how you know you have achieved the required accuracy. 3 2 2 3 2 6 5 22. Let A =, B =, C =, D =. 4 4 5 4 5 2 3 Evaluate the following expressions or give reasons why they are undefined. 4A, 3C, 3(A B), A + B + C, C D, A + A T, C T + D T, AB, CD. 4 2 8 2 9 23. Let K = 3 2, L = 2 6, a =, b =. 2 5 8 6 4 5 Evaluate the following expressions or give reasons why they are undefined. 3K + 4L, 3(a 4b), K + a, a + a T, 2a T + 3b T, Ka, bl, b T L. 24. Find a 2 2 matrix A such that A 2 =. 25. With a particular choice of axes in a plane, the coordinates of a point P are (x, x 2 ). If we rotate the axes anticlockwise through an angle θ in the plane, the coordinates of P with respect to the new axes are (x, x 2 ), and ( x ) x cos θ sin θ = A where A =. sin θ cos θ Show that x 2 x 2 A n cos nθ sin nθ = sin nθ cos nθ for any positive integer n. (First try A 2.) What does this mean geometrically? 26. Find the value of q for which elimination fails, in the system 3 6 x =. 6 q 4 x 2 (b) For this value of q, what happens to our first geometrical interpretation (two intersecting lines)? (c) What number should replace 4 on the right-hand side to make the system solvable for this q? 27. A and B are n n matrices. Simplify as much as possible the expression (ABA 2 )A(AB 2 ). 28. By using Gaussian elimination to obtain a contradiction, show that the following set of equations has no solution. 3x +2x 2 x 3 4x 4 = x x 2 +3x 3 x 4 = 4 2x +x 2 3x 3 = 6 x 2 +8x 3 5x 4 = 3

29. Solve the following tridiagonal system of five equations: where a 2 = 2, a 3 = and a 4 = 2. 5x 2x 2 = 5 2x r +5x r 2x r+ = a r, r = 2, 3, 4 2x 4 +5x 5 = 5 3. Solve the following equations by Gaussian elimination with partial pivoting and (b) by carrying out row scaling first and then using Gaussian elimination with partial pivoting. Keep four significant figures, rounding after each arithmetic operation. What is the exact solution? 2.x + 24x 2 + 4x 3 = 642.27x + 2.5x 2 +.963x 3 = 5.22.6x + 2.2x 2 + 3.x 3 = 6.7 3. Solve the equations /2 /3 x /2 /3 /4 x 2 = /3 /4 /5 x 3 exactly and (b) keeping three significant figures and rounding after each arithmetic operation. Comment on the result. 32. Prove that (A ) = A, where A is a non-singular square matrix. 33. By geometrical considerations guess the form of the inverse of the matrix A in Problem 25. Check by pre- and post-multiplying your guess by A. 34. Show how the vector z = B (2A + I)(C + A)b may be computed by using vector and matrix arithmetic operations and solving linear equations, without computing any matrix inverse. Here A, B and C are n n matrices, I is the n n identity matrix, and b is a column vector having n elements. 35. Find the eigenvalues and three linearly independent eigenvectors of each of the matrices 2 4 3 and. 5 6 7 36. Prove that the eigenvalues of an upper or lower triangular matrix are its diagonal elements. 37. If you can in each of the following cases find a matrix W such that the given matrix A when rewritten as W AW is diagonal. 3 3 7 5 2 2 2, (b), (c), (d) 2 4 3. 5 5 2 2 2 2 38. Solve the first-order system dz 3 4 dt = z with z() =. 4 3 6

39. Find the general solution of each of the following first-order systems. See Problem 37. dz 2 2 dt = dz 2 z, (b) 5 dt = z. 5 2 In case (b) find the particular solution such that z() = (, 2) T. 4. Find the characteristic equation of each of the following matrices. If the matrix is nonsingular, use the Cayley-Hamilton theorem to compute its inverse. 2 2, (b) 2, (c). 5 3 3 4. Use the Jacobi and Gauss-Seidel methods to solve the equations x + x 2 + x 3 = 5 x + x 2 + x 3 = 24 x + x 2 + x 3 = 33 Do at least three iterations for each method. What is the exact solution? 42. Rearrange the following equations so that the coefficient matrix is diagonally dominant. Then carry out several Gauss-Seidel iterations. 6x + x 2 x 3 = 3 x + x 2 + 7x 3 = 7 x + 5x 2 + x 3 = 43. Find the cubic spline S(x) with knots,,, such that S( ) = = S(), S() =, S ( ) = 3/2 and S () = 3/2. 44. The function e x is to be approximated by an interpolating cubic spline function with knots x i = i/2, (i =,, 2, 3, 4). Using the exact values of the first derivative of e x at the end points, find the values k i, (i =, 2, 3), of the first derivative of the spline function at the interior knots. Find an explicit expression for the spline function on the interval [,.5]. 45. Given that f(x ) = y and f(x ) = y, find the natural interpolating cubic spline for f(x) with knots x and x. 46. Find a, b and c such that this is a cubic spline function: { x S(x) = 3, x 2 (x )3 + a(x ) 2 + b(x ) + c, x 3. 47. Calculate 38. 38 as accurately as you can, keeping five significant figures and rounding after each arithmetic operation. How accurate is your result? 48. How would you calculate for values of x near 4? x 2 4 x

49. For f(x) = x 4 ( 2 cos x + e x2) show, by Taylor expansion or otherwise, that lim x f(x) = 5/2. What results does your calculator give when this formula is used for x = m with m =, 2, 3, 4, 5? Explain the results. Calculate f(.) correct to five decimal places. 5. The Bessel function of the first kind, of order zero, may be defined as J (x) = n= ( ) n (x/2) 2n (n!) 2. Evaluate J (.2) correct to six decimal places. Write out the first six (or more) terms of the series with x = 2. Noting that J (2) =.6723 to six decimal places, explain why term by term summation of the series is not a good way to calculate J (x) for large values of x. 5. Calculate f(.) correct to six decimal places, where f(x) = exp( 2x2 ). x sin x 52. Keeping three significant figures and chopping after each arithmetic operation, compute k= first by summing from to, and then by summing from to. Which is the more accurate and why? 53. An example of ill-conditioning. Compare the solutions of the following pairs of equations: k 2 x x 2 =, x.x 2 = (b) x x 2 =, x.99999x 2 =. The MATLAB command cond(a) gives a condition number for the matrix A; use it for the coefficient matrices of those equations. The bigger that number the worse the condition of the matrix. The best possible value is ; the condition number cannot be smaller than that. 54. Evaluate, correct to three decimal places, (i) exp(x 2 ) x 2 dx, (ii).5 x e x dx, (iii) exp( x 2 ) dx. [Hint for (iii): for x k >, x 2 kx.] 55. Describe how you would evaluate each of the following integrals numerically: dx x /2 + x /3, sin x x dx, cos x x dx.

56. Use appropriate approximations to estimate f (x) for each value of x in the table below. Which do you think is the most accurate approximation, and why? x.49.5.5 f(x).294.73.27 57. The values of f(x) tabulated below are correct to 6 decimal places. x.3.32.34.36.38 f(x).43993.49897.564.6276.6964 Use the second-order central difference formula, with Richardson extrapolation, to estimate f (.34). Comment on the possible truncation and rounding errors in your result. 58. By Taylor expansion, find the leading term in the truncation error of the approximation f (x) [4f(x + h) 3f(x) f(x + 2h)]/2h. If there is a possible error, of magnitude not exceeding ɛ, in each function value, what is the largest possible resulting error in the approximation for f (x)? How does this compare with the second-order central difference formula for f (x)? 59. Prove that, if f is four times continuously differentiable, f(x + h) 2f(x) + f(x h) = h 2 f (x) + 2 h4 f iv (ζ) for some ζ in the interval (x h, x+h). Hence write down an expression for the truncation error in the formula f f(x + h) 2f(x) + f(x h) (x) h 2. Use this, with h =.2 and with h =.4, to approximate the second derivative f (.34) from the table in Problem 57. Find an upper bound on the error, in each of those approximations, arising from rounding errors in the tabulated data. Would it be sensible to use Richardson extrapolation in this case?