Docsity
Docsity

Prepare for your exams
Prepare for your exams

Study with the several resources on Docsity


Earn points to download
Earn points to download

Earn points by helping other students or get them with a premium plan


Guidelines and tips
Guidelines and tips

Computational Mathematics Exam Questions (MA584/04) - University of Kent, Study notes of Economic statistics

The questions and instructions for a stage 2 computational mathematics exam held at the university of kent in may 2004. The exam covers topics such as bisection method, newton-raphson method, gaussian elimination, and numerical integration. Students are required to solve problems involving roots, ill-conditioned problems, and linear equation systems.

Typology: Study notes

2010/2011

Uploaded on 10/04/2011

claire67
claire67 🇬🇧

4.6

(5)

265 documents

1 / 6

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
MA584/04
UNIVERSITY OF KENT
FACULTY OF SCIENCE, TECHNOLOGY AND MEDICAL STUDIES
STAGE 2 EXAMINATION
COMPUTATIONAL MATHEMATICS
Saturday, 29th May 2004: 9.30 a.m. to 11.30 a.m.
This paper contains FIVE questions. Candidates should not
attempt more than THREE questions. Each question will be
marked out of 40.
Approved calculators are permitted.
pf3
pf4
pf5

Partial preview of the text

Download Computational Mathematics Exam Questions (MA584/04) - University of Kent and more Study notes Economic statistics in PDF only on Docsity!

UNIVERSITY OF KENT

FACULTY OF SCIENCE, TECHNOLOGY AND MEDICAL STUDIES

STAGE 2 EXAMINATION

COMPUTATIONAL MATHEMATICS

Saturday, 29th May 2004: 9.30 a.m. to 11.30 a.m. This paper contains FIVE questions. Candidates should not attempt more than THREE questions. Each question will be marked out of 40. Approved calculators are permitted.

  1. (a) Show that the equation x cos x − sin x = 0 has a root that lies between x = 4.49 and x = 4.50. Apply two steps of the method of bisection to narrow the interval containing the root, and then use one step of the Newton-Raphson method to obtain an accurate estimate for the root. [15 marks] (b) What is an ill-conditioned problem, and why are ill-conditioned problems difficult to solve numerically? [5 marks] (c) Explain the meaning of the following statement and why it is an important practical feature of the method of Gaussian elimination :- “The count of the floating-point arithmetic operations performed when Gaussian elim- ination is employed to solve an n × n linear equation system is approximately 23 n^3 for large n.” [10 marks] (d) If Tn denotes the composite trapezium rule approximation for

I =

0

√1 + ex (^) dx

when the range of integration from 0 to 1 is divided into n parts, then T 4 = 1. 643885098 T 8 = 1. 642513170 T 16 = 1. 642170132 Use this data to construct a portion of the Romberg array associated with the integral I, and write down the best estimate for the value of I that you can. [10 marks]

  1. (a) Suppose φ(x) is a continuous real-valued function defined for a ≤ x ≤ b and whose values all satisfy a ≤ φ(x) ≤ b. Draw and label a diagram to illustrate the fact that the equation φ(x) = x has a root. Describe briefly the method of simple iteration for determining a root. How may the number of iterative steps be predicted if an error tolerance is set for an acceptable estimate of that root. [12 marks] (b) The real root of the cubic equation x^3 + px + q = 0 with p > 0 is given by Cardan’s formula x = 3

(^12) {√R − q} − 3

(^12) {√R + q} where R = 4( p 3 )^3 + q^2. (You are not asked to prove Cardan’s formula.) (i) Verify that Cardan’s formula correctly finds the real root of x^3 + 9x + 26 = 0 (ii) Use Cardan’s formula to calculate the real root of x^3 + 987x + 1 = 0 writing down all the significant figures produced by your calculator both for x and also for key intermediate quantities that the formula entails. (iii) Apply the method of simple iteration to solve the equation in (ii), by taking φ(x) = − 9871 (1 + x^3 ), a = −1 and b = 0; verify the condition a ≤ φ(x) ≤ b and account for the very rapid convergence. What is the reason for the difference in the estimates for the root produced by the two solution processes, and why is the iteration method to be preferred? (iv) Why may Cardan’s formula be inadequate if p and q are very large in magnitude? For the cubic equation x^3 + 3. 5 × 1035 x + 5 × 1050 = 0 find the real root by first making the scaling substitution x = 10sy and choosing an appropriate value for the integer s. [28 marks]

  1. (a) Describe briefly the method of Gaussian elimination in its role as the basis of a com- puter algorithm for solving an n × n linear equation system Ax = b. Illustrate your answer by using this method to solve the 3 × 3 sytem for which

A =

 (^) and b =

What difficulties might be encountered if the elimination were implemented, on a computer, without partial pivoting? [20 marks] (b) Write down a formula that expresses the condition number κ(A) of an invertible matrix A in terms of matrix norms. Suppose Ax = b and Ay = b + δb are neighbouring linear equation systems. State, but do not prove, an inequality that relates ‖ x − y ‖ / ‖ x ‖, ‖ δb ‖ / ‖ b ‖, and the condition number κ(A). Consider the two linear equation systems shown : write down, by inspection, the solution vector x for linear equation system 1, and verify that y =

[ 13. 75

]

is the solution vector for linear equation system 2.

  1. 7 x 1 + 4. 9 x 2 = 9. 6

  2. 1 x 1 + 5. 3 x 2 = 10. 4

  3. 7 y 1 + 4. 9 y 2 = 9. 5

  4. 1 y 1 + 5. 3 y 2 = 10. 5 system 1 system 2 Calculate ‖ x − y ‖ / ‖ x ‖ and ‖ δb ‖ / ‖ b ‖, and hence show that κ(A) > 103. Is the coefficient matrix A of these linear equation systems ill-conditioned? (Give reasons for your answer.) [20 marks]

[turn over ]