Scribd
Upload
10 views2 pages

MS QP

The document is the mid-semester examination for a computational methods in engineering course. It contains 4 questions assessing skills in matrix operations, function approximation, polynomial factorization, and solving non-linear equations. Students are instructed to show working steps and use 3 decimal places. The exam covers topics like QR decomposition, inverse matrices, least squares approximation, Newton-Raphson method, and the Gram-Schmidt process.

Uploaded by

P35khushi
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
10 views2 pages

MS QP

The document is the mid-semester examination for a computational methods in engineering course. It contains 4 questions assessing skills in matrix operations, function approximation, polynomial factorization, and solving non-linear equations. Students are instructed to show working steps and use 3 decimal places. The exam covers topics like QR decomposition, inverse matrices, least squares approximation, Newton-Raphson method, and the Gram-Schmidt process.

Uploaded by

P35khushi
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

ESO 208A: Computational Methods in Engineering

Mid-Semester Examination 2018-19-I


Date: Thursday, 20th September, 2018; Venue: L11-17, T111; Duration: 2 hours; Full Marks: 100

Important Instructions:
• Show at least 3 decimal places (floating point representations) for all results and intermediate
steps. You do not need to round-off after every floating-point operation.
• You may use a scientific calculator. Programmable calculators are not allowed.
• You need to show how you arrived at a number using the algorithm. Only showing the final
numbers will be interpreted as being copied from a neighbour and no marks will be awarded.
• This paper contains total 4 questions on two sides of the pages.

1. Consider the matrix (A) given below:

5 1 3
𝐴 = [2 7 6]
3 5 3

a) Compute a QR decomposition of the matrix A using the Gram-Schmidt procedure. 15

b) Using the matrices Q and R computed in (a), back-substitution algorithm and common matrix
operations (i.e., addition, subtraction, multiplication and transpose), compute the inverse of matrix A.
Do not use any other algorithm to compute inverse at any stage. 10

2. Consider the function:


10𝑒 −2𝑡 for 0 ≤ 𝑡 ≤ 1
𝑦={
10𝑒 −(𝑡+1) for 1 ≤ 𝑡 ≤ 2

The function is to be approximated with a single polynomial of the form y = 10 + at + bt2, 0 ≤ t ≤ 2.

a) Compute the values of a and b such that the square of the Euclidean norm of the error (between the
true and the approximate function) is minimum. 10

b) Compute the values of a and b such that the square of the Euclidean semi-norm of the error
(between the true and the approximate function) in the net t = {0, 0.5, 1, 1.5, 2} is minimum. 10

c) If the maximum norm of the error occurs at t = 2.0 for the polynomial obtained in (a) and at t = 1.5
for the polynomial obtained in (b), compute the maximum true relative errors (in %) for these two
polynomials at the points of their respective maximum norm of the errors. From the result, comment
on which polynomial is a better fit to the function with respect to the maximum norm of error. 5

3. a) If an nth order polynomial 𝑝𝑛 (𝑥) = 𝑎0 + 𝑎1 𝑥 + 𝑎2 𝑥 2 + ⋯ + 𝑎𝑛 𝑥 𝑛 is divided by a 3rd order


polynomial (x3 – α1x2 – α2x – α3), which is an exact factor, the resulting polynomial is of the form
𝑞𝑛−3 (𝑥) = 𝑏3 + 𝑏4 𝑥 + 𝑏5 𝑥 2 + ⋯ + 𝑏𝑛 𝑥 𝑛−3 . Derive an algorithm to estimate the bi’s as functions of
ai’s and αi’s. 15

(b) Find an expression for the remainder term for your algorithm of computing bi’s if (x3 – α1x2 – α2x –
α3) is not an exact factor. 5

(c) Use the algorithm derived in (a) to estimate the other two roots of the polynomial shown below if
three of the roots are 1, –1 and 2. 5

x5 – 4x4 + 5x3 – 6x + 4 = 0

ESO208A: Mid-Sem 1 of 2 Please Turn Over


4.a) Solve the following system of non-linear equations using Newton-Raphson method. Starting from
x0 = 1 and y0 = 1, compute the roots with a relative approximate error of less than 0.1%. 12

4x3 – 27xy2 + 25 = 0
4x2y – 3y3 – 1 = 0

b) The equation ex – x2 – 2x – 2 = 0 has a root near x = 2.5. In order to compute the root using the
Fixed Point method with the initial guess x0 = 2.5, which of the following iteration scheme(s) can be
used? If there are more than one usable scheme(s), which one will converge faster? Justify your
answer. 13

𝑥𝑘 +𝑙𝑛(𝑥𝑘 2 +2𝑥𝑘 +2)


(i) 𝑥𝑘+1 = 2
(ii) 𝑥𝑘+1 = √𝑒 𝑥𝑘 − 2𝑥𝑘 − 2

𝑒 𝑥𝑘 −2
(iii) 𝑥𝑘+1 = 𝑥𝑘 +2
(iv) 𝑥𝑘+1 = 𝑙𝑛(𝑥𝑘 2 + 2𝑥𝑘 + 2)

Following three algorithms are given which may be useful to solve the questions:

Algorithm 1

𝑏𝑛 𝑏𝑖 − ∑𝑛𝑗=𝑖+1 𝑎𝑖𝑗 𝑥𝑗
𝑥𝑛 = ; 𝑥𝑖 = ; 𝑖 = (𝑛 − 1), (𝑛 − 2), … 3, 2, 1
𝑎𝑛𝑛 𝑎𝑖𝑖

Algorithm 2

∆𝒙 𝕁(𝒙(𝑘) ) = −𝒇(𝒙(𝑘) ); 𝒙(𝑘+1) = 𝒙(𝑘) + ∆𝒙

Algorithm 3
𝑘
(1) 𝒂(1) (𝑘+1) (𝑘+1) 𝑇 𝒛(𝑘+1)
𝒒 = ; 𝒛 =𝒂 − ∑(𝒂(𝑘+1) 𝒒(𝑖) )𝒒(𝑖) ; 𝒒(𝑘+1) =
‖𝒂(1) ‖2 𝑖=1
‖𝒛(𝑘+1) ‖2

𝑇
𝑟𝑖𝑗 = 𝒒(𝑖) 𝒂(𝑗)

ESO208A: Mid-Sem 2 of 2 Please Turn Over

You might also like