Numerical Analysis Booklet

MATHEMATICAL PATHSHALA
INDIA’S BEST ONLINE INSTITUTE FOR HIGHER MATHEMATICS
NUMERICAL ANALYSIS ASSIGNMENT-1
GATE MA 2023
1. Let f be a twice continuously differentiable function on [a, b]such that f ′ (x) < 0 and
f ′′ (x) < 0 for all x ∈ (a, b). Let f(ζ) = 0 for some ζ ∈ (a, b). The Newton Raphson
f(xk )
method to compute ζ is given xk+1 = xk − , k = 0, 1, 2, … for an initial guess x0 .
f′ (xk )
If xk ∈ (ζ, b) for some k ≥ 0, then which of the following statements
is(are)correct?
(a) xk+1 > ζ.
(b) xk+1 < ζ.
(c) xk+1 < xk .
f ′(η)
(d) for every η ∈ (ζ, xk ), > 1.
f ′ (x k )
GATE MA 2022
xn−1 1
2. The real sequence generated by the iterative scheme xn = + ,n ≥ 1
2 xn−1
(a) converges to √2, for all x0 ∈ ℝ\{0}.
2
(b) converges to √2, whenever x0 > √ .
3
(c) converges to √2, whenever x0 ∈ (−1, 1)\{0}.
(d) diverges for any x0 ≠ 0.


GATE MA 2021
3. Consider the fixed point iteration xn+1 = φ(xn ) , n ≥ 0
with φ(x) = 3 + (x − 3)3 , x ∈ (2.5, 3.5), and the initial approximation x0 = 3.25.
Then, the order of convergence of the fixed point iteration method is
(a) 1. (b) 4. (c) 3. (d) 2.
4. Let f(x) = x 4 + 2x 3 − 11x 2 − 12x + 36 for x ∈ ℝ. The order of convergence of the
Newton Rapson method
f (x n )
xn+1 = xn − , n ≥ 0 with x0 = 2.1,
f ′ (x n )
for finding the root α = 2 of the equation f(x) = 0 is ⋯
GATE MA 2020
xn−1 3
5. Consider the iterative scheme xn = + ,n ≥ 1
2 xn−1
with initial point x0 > 0. Then, the sequence {xn }
(a) converges only if x0 > 1. (b) converges only if x0 < 3.
(c) converges for any x0 . (d) does not converge for any x0 .
GATE MA 2018
6. Let f ∶ ℝ → ℝ be a twice continuously differentiable function. The order of
convergence of the secant method for finding root of the equation f(x) = 0 is
1 + √5 2 1 + √5 3
(a ) . (b) . (c ) . ( d) .
2 1 + √5 3 1 + √5
GATE MA 2016
7. for the fixed point iteration xk+1 = g(xk ), k = 0, 1, 2, ⋯,
consider the following statements P and Q ∶

2
P ∶ If g(x) = 1 + then the fixed point iteration converges to 2 for all x0 ∈ [1, 100].
x
Q ∶ If g(x) = √2 + x then the fixed point iteration converges to 2 for all x0 ∈ [0, 100]
Which of the above statements hold TRUE?
(a) both P and Q. (b) only P. . (c) only Q (d) neither P nor Q.
GATE MA 2015
8. Suppose that the Newton Raphson method is applied to the equation

2
2x 2 + 1 − ex = 0
with an initial approximation x0 sufficiently close to zero. Then, for the root x = 0,
the order of convergence of the method is equal to ⋯
CSIR NET NOVEMBER 2020

1 2
9. Fix a α ∈ (0,1). Consider the iteration defined by (∗): xk+1 = (x + α), k = 0,1,2, …
2 k
The above iteration has two distinct fixed points ζ1 and ζ2 such that 0 < ζ1 < 1 < ζ2 .
Which of the following statements are true?
(a)The iteration (∗)is equivalent to the recurrence relation

1
xk+1 − ζ1 = (xk + ζ1 )(xk − ζ1 ) , k = 0,1,2, …
2
(b)The iteration (∗)is equivalent to the recurrence relation

1
xk+1 − ζ1 = (xk + ζ2 )(xk − ζ1 ) , k = 0,1,2, …
2

(c) If 0 ≤ x0 < ζ2 , then limk→∞ xk = ζ1 .
(d)If − ζ2 < x0 ≤ 0, then lim xk = ζ1 .

k→∞
CSIR NET (15DECEMBER) 2019
10. Let x = ξ be a solution of x 4 − 3x 2 + x − 10 = 0.
The order of convergence of the iterative method xn+1 = 10 − xn4 + 3xn2 is equal to
(a)1. (b) 2. (c) 3. (d) 4.
CSIR NET JUNE 2019
11. Consider the equation x 2 + ax + b = 0 which has two real roots α and β.
Then, which of the following iteration scheme converges when x0 is choosen
sufficiently close to α?
axn +b ax2n +b
(a)xn+1 = − if |α| > |β|. (b)xn+1 = − if |α| > 1.
xn a
b xn2 + b
(c)xn+1 =− if |α| < |β|. (d)xn+1 =− if 2|α| < |α + β|.
xn + a a
CSIR NET DECEMBER 2018
12. Let f ∶ [0,1] → [0,1] be twice continuously differentiable function with a unique fixed
point f(x∗ ) = x∗ . For a given x0 ∈ (0,1) consider the ireration xn+1 = f(xn ) for n ≥ 0.
If L = maxx∈[0,1] |f ′ (x)| , then which of the following are true?
(a) If L < 1, then xn converges to x.
(b)xn converges to x, provided L ≥ 1.
(c) The error en = xn − x, satisfies |en+1 | < L|en |.


(d) If f ′ (x0 ) = 0, then |en+1 | < C|en |2 for some C > 0.
13. The iterative method xn+1 = g(xn ) for the solution of x 2 − x − 2 = 0
converges quadratically in a neighbourhood of the root x = 2 if g(x) equals
2
2 x2 + 2
(a)x − 2. (b)(x − 2 )2 − 6. (c) 1 + . ( d) .
x 2x − 1
CSIR NET JUNE 2017
14. Let yn satisfy yn = yn−1 + hyn−1 with y0 = 1 (n = 1, 2, ⋯ , N) and for 0 < h < 1,
Nh = 1. Then
(a)yN → e as N → ∞. (b)yN → eh as N → ∞.
(c)yn = (1 + h)n . (d)yn ≥ 1.
xn2 a
15. The values of α and β, such that xn+1 = αxn (3 − ) + βxn (1 + 2 )
a xn
has 3rd order convergence to √a, are

3 1 1 3 2 2 1 3
(a ) α = ,β = . (b) α = ,β = . (c ) α = ,β = . ( d) α = ,β = .
8 8 8 8 8 8 4 4
16. Let f(x) = ax + 100 for a ∈ ℝ. Then, the iteration xn+1 = f(xn ) for n ≥ 0 and x0 = 0
converges for
(a) a = 5. (b) a = 1. (c) a = 0.1. (d) a = 10.

17. Let f(x) = √x + 3 for x ≥ −3. Consider the iteration xx+1 = f(xn ), x0 = 0; n ≥ 0.
The possible limits of the iteration are
(a) − 1. (b) 3. (c) 0. (d)√3 + √3 + √3 + ⋯.
1 2
18. The iteration xn+1 = (xn + ) , n ≥ 0 for a given x0 ≠ 0 is a instance of
2 xn
(a) fixed point iteration for f(x) = x 2 − 2. (b) Newtonʼs method for f(x) = x 2 − 2.
x2 + 2
(c) fixed point iteration for f(x) = . (d) Newtonʼs method for f(x) = x 2 + 2.
2x
19. Let f be a continuous map from the intervale[0,1]into itself and consider the iteration
xn+1 = f(xn ). Which of the following maps will yield a fixed point for f
x2 x2 x2 x2
(a)f(x) = . (b)f(x) = . (c)f(x) = . (d)f(x) = .
4 8 16 32
f(x)
20. Consider the iteration function for Newton′ smethod g(x) = x −
f ′ (x)
and its application to find approximate square root of 2, starting with x0 = 2.
Consider the first and second iterates x1 and x2 , respectively; then
(a)1.5 < x1 ≤ x2 . (b)1.5 < x1 < 2. (c)x1 ≤ 1.5; x2 ≤ 1.5. (d)x1 = 1; x2 < 1.
1 2
21. Consider the iteration xn+1 = (xn + ) , n ≥ 0 for a given x0 ≠ 0. Then
2 xn
(a) xn converges to √2 with order of convergence 1


(b)xn converges to √2 with order of convergence 2
(c)The given iteration is the fixed point for f(x) = x 2 − 2
(d) The given iteration is the Newton′ s method for f(x) = x 2 − 2
ANSWER KEY
1 2 3 4 5 6 7 8 9 10
(a,c) (b) (c) 1 (c) (a) (a) 1 (a, c, d) (a)
11 12 13 14 15 16 17 18 19 20
(a, c, d) (a) (d) (a, c, d) (b) (c) (d) (b, c) (a, b, c, d) (c)
21
(b,d)
GATE MA 2023
1. Let p(x) = x 3 − 2x + 2. If q(x)is the interpolating polynomial of degree less than or
equal to 4 for the data
x -2 -1 0 1 3
q(x) p(-2) p(-1) 2.5 p(1) p(3)
d4 q
. Then the value of at x = 0 is _______________.
dx4
GATE MA 2022
2. If P(x) is a polynomial of degree 5 and

6 6
−1
α = ∑ P(xi ) ( ∏ (xi − xj ) )
i=0 j=0,j≠i
Where x0 , x1 , ⋯ , x6 are distinct points in the interval [2, 3], then the value of
α2 − α + 1 is ⋯
GATE MA 2021
3. If the polynomial p(x) = α + β (x + 2) + γ (x + 2)(x + 1) + δ (x + 2)(x + 1)x
interpolates the data
. Then the value of α + β + γ + δ is


GATE MA 2020
4. Let f(x) = x 4 and let p(x) be the interpolating polynomial of f at nodes 1, 2 and 3.
Then, p(0) is equal to ⋯
GATE MA 2018
5. If p(x) = 2 − (x + 1) + x(x + 1) − βx(x + 1)(x − α) interpolates the points (x, y)
in the table
X -1 0 1 2
Y 2 1 2 -7
Then, α + β = ⋯
GATE MA 2017
6. If the fourth order divided difference of f(x) = αx 4 + 5x 3 + 3x + 2, α ∈ ℝ, at the points
0.1, 0.2, 0.3, 0.4, 0.5 is 5. Then, α equals ⋯
7. Let p(x) be the polynomial of degree at most 2 that interpolates the data (−1,2), (0, 1)
and (1, 2). If q(x) is a polynomial of degree at most 3 such that p(x) + q(x)
interpolates the data (−1, 2), (0, 1), (1, 2) and (2, 11), then q(3) equals …
GATE MA 2016
8. Let the polynomial x 4 be approximated by a polynomial of degree ≤ 2, which
interpolates x 4 at x = −1, 0 and 1. Then, the maximum absolute interpolation
error over the interval [−1, 1] is equal to ⋯
GATE MA 2015

9. Let p(x) be the polynomial of degree at most 3 that passes through the point
(−2, 12), (−1, 1), (0, 2) and (2, −8). Then, the coefficient of x 3 in p(x) is equal to ⋯
GATE MA 2014
10. Let α ∈ ℝ. If αx is the polynomial which interpolates the function f(x) = sin πx on
[−1, 1] at all the zeros of the polynomial 4x 3 − 3x, then α is…
GATE MA 2010
11. Let lk (x), k = 0,1, … , n denote the Lagrange’s fundamental polynomials of degree n for
the nodes x0 , x1 , … , xn . Then the value of ∑nk=0 lk (x) is…
(a) 0
(b) 1
(c) xn + 1
(d) xn + 1
GATE MA 2009
12. Let f: [0, 4] → ℝ be a thrice differentiable continuously differentiable function. Then the
value of f[1,2,3,4] is
f′′ (ξ)
(a) for some ξ ∈ (0,4)
6
f′′ (ξ)
(b) for some ξ ∈ (0,4)
3
f′′′(ξ)
(c) for some ξ ∈ (0,4)
3
f′′′(ξ)
(d) for some ξ ∈ (0,4)
6
CSIR NET NOVEMBER 2020

13. Let f be an infinitely differentiable real valued function on a bounded interval I.
Take n ≥ 1 interpolation points {x0 , x1 , … , xn−1 }. Take n additional points
xn+j = xj + ε, j = 0,1, … , n − 1. Where ε > 0 is such that {x0 , x1 , … , x2n−1 } are all distinct.
Let p2n−1 be the Lagrange′ s interpolation
Polynomial of degree 2n − 1 with the interpolation points {x0 , x1 , … , x2n−1 }
for the function f. Let q2n−1 be the Hermite interpolation polynomial of degree 2n − 1
with the interpolation points {x0 , x1 , … , xn−1 } for the function f .
In the ε → 0 limit, the quantity supx∈I |p2n−1 (x) − q2n−1 (x)|
(a)Does not necessarily converge
1
(b)Converges to
2n
(c)Converges to 0
1
(d)Converges to
2n + 1
14. Let f(x) be a polynomial of unknown degree taking the values
x 0 1 2 3
f(x) 2 7 13 16
1
All the fourth divided differences are − . Then the coefficient of x 3 is
6
1 2
(a ) (b) − (c) 16 ( d) − 1
3 3
CSIR NET JUNE 2016


15. Let H(x) be the cubic Hermite interpolation of (x) = x 4 + 1 on the interval I = [0, 1]
interpolating at x = 0 and x = 1. Then

1
(a) maxx∈I |f(x) − H(x)| =
16
1
(b) The maximum of |f(x) − H(x)| is attained at x =
2
1
(c) maxx∈I |f(x) − H(x)| =
21
1
(d) The maximum of |f(x) − H(x)| is attained at x =
4
CSIR NET JUNE 2015
16. Let f ∶ ℝ → ℝ be a polynomial of the form f(x) = a0 + a1 x + a2 x 2 with a0 , a1 , a2

∈ ℝ and a2 ≠ 0. If
1
E1 = ∫ f(x)dx − [f(−1) + f(1)]
−1
1
1
E2 = ∫ f(x)dx − (f(−1) + 2f(0) + f(1))
−1 2
and |x| is the absolute value of x ∈ ℝ, then
(a)|E1 | < |E2 | (b)|E1 | = 2|E2 | (c)|E1 | = 4|E2 | (d)|E1 | = 8|E2 |
CSIR NET JUNE 2014
17. Let P ∶ ℝ → ℝ be a polynomial of the form P(x) = a0 + a1 x + a2 x 2 with a0 , a1 , a2 ∈ ℝ
and a2 ≠ 0. Let
1
1
E1 = ∫ P(x)dx − [P(0) + P(1)]
0 2
1
1
E2 = ∫ P(x)dx − P( )
0 2

and |x| is the absolute value of x ∈ ℝ, then
(a)|E1 | > |E2 | (b)|E1 | < |E2 | (c)|E1 | = |E2 | (d)|E2 | = 2|E1 |
ANSWER KEY
1 2 3 4 5 6 7 8 9 10
2 6 1 36 3 5 24 0.22- -2 0.45-
0.28 0.47
11 12 13 14 15 16 17 18 19 20
(b) (d) (d) (b) (a, b) (c) (a)
GATE MA 2023
2 2
1. For each fixed c ∈ ℝ, let α = ∫(9x 2 − 5cx 4 )dx . If the value of ∫(9x 2 − 5cx 4 )dx
0 0
obtained by using the Trapezoidal rule is equal to α, then the value of c is______________
αf(a − h) + βf(a) + γf(a + 2h)

2. For h > 0, and let α, β ∈ ℝ, let Dh f(a) = be
6h
three pont formula to to approximate f ′ (a)fo any differentiable
function f: ℝ → ℝ and a ∈ ℝ. If Dh f(a) = f ′ (a) for every polynomial f of degree
less than or equal to 2 and for all a ∈ ℝ, then
(a) α + 2γ = −2
(b) α + 2β − 2γ = 0
(c) α + 2γ = 2
(d) α + 2β − 2γ = 1
GATE MA 2022
3. The first derivative of a function f ∈ C∞ (−3, 3) is approximated by an interpolating
polynomial of degree 2, using the data (−1, f(−1)), (0, f(0)) and (2, f(2)).
It is found that
2
f ′ (0) ≈ − f(−1) + α f(0) + β f(2)
3
1
Then, the value of is
αβ

(a ) 3 (b)6 (c) 9 (d) 12
GATE MA 2021
2
4. If the quadrature formula ∫ x f(x)dx ≈ α f(0) + β f(1) + γ f(2)
0
is exact for all polynomials of degree ≤ 2, then 2β − γ = ⋯
GATE MA 2020
1
5. Let a, b, c ∈ ℝ be such that the quadrature rule ∫ f(x)dx ≈ af(−1) + bf(0) + cf ′ (1)
−1
is exact for all polynomials of degree less than or equal to 2. Then, b is equal to ⋯
(rounded off to two decimal places)
GATE MA 2018
1
6. Let a ∈ (−1, 1) be such that the quadrature rule ∫ f(x) dx ≃ f(−a) + f(a)
−1
is exact for all polynomials of degree less than or equal to 3. Then, 3a2 = ⋯
GATE MA 2017
2
7. If the quadrature rule ∫ f(x)dx ≈ c1 f(0) + 3 f(c2 ), where c1 , c2 ∈ ℝ, is exact for all
0
polynomials of degree ≤ 1. Then, c1 + 3c2 equals ⋯
GATE MA 2016

4 x, 0 ≤ x ≤ 2
8. Let the integral I = ∫0 f(x)dx , where f(x) = {
4 − x, 2 ≤ x ≤ 4
Consider the following statements P and Q
P ∶ If I2 is the value of the integral obtained by the composite trapezoidal rule with two
equal subintervals. Then I2 is exact.
Q: If I3 is the value of the integral obtained by the composite trapezoidal rule with three
equal sub interval. Then I3 is exact.
(a) both P and Q (b) only P (c) only Q (d) neither P nor Q
GATE MA 2015
9. If the trapezoidal rule with single interval [0, 1] is exact for approximating the
1
integral ∫0 (x 3 − cx 2 )dx . Then, the value of c is equal to ⋯
2
10. If, for some α, β ∈ ℝ, the integration formula ∫0 p(x)dx = p(α) + p(β) holds for
all polynomials p(x) of degree at most 3. Then, the value of 3(α − β)2 is equal to ⋯
GATE MA 2014
11. Let the following discrete data be obtained from a curve y = y(x)
x∶ 0 0.25 0.5 0.75 1

y∶ 1 0.9896 0.9589 0.9089 0.8415
Let S be the solid of revoltion obtained by rotating the above curve about the x-axis
between x = 0 and x = 1 and let V denotes its volume. The approximate value of V,
obtained using Simpson’s 1/3rd rule.

GATE MA 2012
12. Given the data:
x 1 2 3 4 5
Y -1 2 -3 4 -5
1 1 1
If the derivative of y(x) is approximated as : y ′ (xk ) ≈ (Δyk + Δ2 yk − Δ3 yk ), then the
h 2 4
value of y ′ (2)is
(a) 4 (b) 8 (c) 12 (d) 16
GATE MA 2011
1
13. The value of the integral I = ∫−1 exp(x 2 ) dx using a rectangular rule is approximated
as 2. Then the approximation error |I − 2| lies in the interval
(a) (2e, 3e] (b) (2/3, 2e] (c) (e/8, 2/3] (d) (0, e/8]
GATE MA 2010
14. The numerical value obtained by applying two point Trapezoidal rule to the integral
1
ln(1 + x)
∫ dx is
0 x
1 1 1
(a) (ln 2 + 1) (b)1/2 (c) (ln 2 − 1) (d) ln 2
2 2 2
GATE MA 2009
1
15. For what values of α and β, the quadrature formula ∫ f(x) dx = αf(−1) + f(β)
−1
is exact for all polynomials of degree ≤ 1?
(a)α = 1, β = 1 (b) α = −1, β = 1 (c) α = 1, β = −1 (d)α = −1, β = −1


16. Let f: [0,2] → ℝ be a twice continuously differentiable function.
2
If ∫ f(x)dx ≈ 2f(1), then the error in the approximation is
0
f′ (ξ) f′ (ξ)
(a ) for some ξ ∈ (0,2) (b) for some ξ ∈ (0,2)
12 2
f′′ (ξ) f′′ (ξ)

(c ) for some ξ ∈ (0,2) ( d) for some ξ ∈ (0,2)
3 6
GATE MA 2008
3 1 1 1
17. If the quadrature formula f (− ) + kf ( ) + f(1) that approximates
2 3 3 2
1
∫−1 f(x)dx is found to be exact for quadratic polynomials, then the value of k is
(a )2 (b)1 (c )0 (d) − 1
GATE MA 2007
1
1
18. Consider the quadrature formula, ∫ |x|f(x)dx ≈ [f(x0 ) + f(x1 )], where x0 and x1 are
−1 2
Quadrature points. Then the highest degree of the polynomial, for which the above
formula is exact, equals.
(a )1 (b)2 (c )3 (d)4
19. The values of α, A, B, C for which the quadrature formula

1
∫ (1 − x)f(x)dx = Af(−α) + Bf(0) + C f(α) is exact for polynomials
−1
of highest possible degree, are

3 5 √5 8 5 √5
(a ) α = √ , A = + ,B = ,C = −
5 9 3 √3 9 9 3 √3
3 5 √5 8 5 √5
(b) α = √ , A = − ,B = ,C = +
5 9 3 √3 9 9 3 √3
3 5 √3 8 5 √3
(c) α = √ , A = (1 − ) , B = , C = (1 + )
5 9 √5 9 9 √5
3 5 √3 8 5 √3
(d) α = √ , A = (1 + ) , B = , C = (1 − )
5 9 √5 9 9 √5
CSIR NET JUNE 2019
20. The values of a, b, c so that the truncation error in the formula

h
∫ f(x)dx = ahf(−h) + bhf(0) + ah f(h) + ch2 f ′ (−h) − ch2 f ′ (h) is minimum, are
−h
7 16 1 7 16 −1
(a ) a = ,b = ,c = (b) a = ,b = ,c =
15 15 15 15 15 15
7 −16 1 7 −16 −1
(c ) a = ,b = ,c = ( d) a = ,b = ,c =
15 15 15 15 15 15
CSIR NET JUNE 2018

h
h
21. The values of a, b, c such that ∫ f(x) dx = h {af(0) + bf ( ) + cf(h)}
0 3
is exact for polynomials f of
degree as high as possible are

3 1 3 2 1
(a) a = 0, b = ,c = (b) a = ,b = ,c =
4 4 4 4 4

2 3 1 1 3
(c ) a = − , b = , c = (d) a = 0, b = ,c =
4 4 4 4 4

n−1
1 1 1 j
22. For f ∈ C[0, 1] and n > 1, let T(f) = [ f(0) + f(1) + ∑ f ( )]
n 2 2 n
j=1
1
be an approximation of the integral I(f) = ∫ f(x)dx.
0
For which of the following functions f is T(f) = I(f)?
(a) 1 + sin 2πnx
(b) 1 + cos 2πnx
(c) sin2 2πnx
(d) cos2 2π(n + 1)x
CSIR NET JUNE 2016
23. Let f ∶ [0, 3] → ℝ be defined by f(x) = |1 − |x − 2|| where |⋅| denotes
the absolute value.

3
Then, the numberical approximation of ∫ f(x)dx , which of the following statements are ture?
0
(a) The composite trapezoid rule with three equal subintervals is exact.
(b) The composite midpoint rule with three equal subintervals is exact
(c) The composite trapezoid rule with four equal subintervals is exact
(d) The composite midpoint rule with four equal subintervals is exact

ANSWER KEY
1 2 3 4 5 6 7 8 9 10
0.24- (a, b) (d) 2 1.70 1 1 (b) 1.5 4
0.25
11 12 13 14 15 16 17 18 19 20
2.81 (b) (b) (a) (c) (c) (a)
21 22 23 24 25 26
(a) (a) (a, b)
GATE MA 2022
1. The initial value problem
dy
= f(x, y), y(x0 ) = y0
dx
is solved by using the following econd order Runge − Kutta mthod:
K1 = hf(xi , yi )
K 2 = h(xi + αh, yi + βK1 )

1
yi+1 = yi + (K1 + 3K 2 ), i ≥ 0,
4
where h is the uniform step length between the points x0 , x1 , … , xn and yi = y(xi ).
Then value of the product αβ is____________
GATE MA 2021
2. The initial value problem
dy
= f(t, y), t > 0, y(0) = 1,
dt
where f(t, y) = −10y, is solved by the following Euler method
yn+1 = yn + h f(t n , yn ), n ≥ 0, with step size h. Then, yn → 0 as n → ∞, provided
(a) 0. 3 < h < 0.4 (b) 0.5 < h < 0.55 (c) 0 < h < 0.2 (d) 0.4 < h < 0.5
GATE MA 2019
dy
3. If the differential equation = √x 2 + y 2 , y(1) = 2
dx
is solved using the Eulerʼs method with step size h = 0.1, then y(1.2) is equal to ⋯

(round off to 2 places of decimal)
GATE MA 2014
4. The fourth order RungeKutta method given by
h
uj+1 = uj + [K1 + 2K 2 + 2K 3 + K 4 ], j = 0,1,2, …
6
du
is used to solve the initial value problem = u, u(0) = α. If u(1) = 1 is obtained
dt
by taking the step size h = 1, then the value of K 4 is …
GATE MA 2012
5. Using Euler ′ s method takingstep size = 0.1, the approximate value of y obtained
dy
corresponding to x = 0.2 for the initial value problem = x 2 + y 2 and y(0) = 1, is
dx
(a) 1.322 (b) 1.122 (c) 1.222 (d)1.110
6. Consider the ordinary differential equation (ODE)
y ′ (x) + y(x) = 0, x > 0

{ ,
y (0) = 1
and the following numerical scheme to solve the ODE

Yn+1 −Yn−1
+ Yn−1 = 0, n ≥ 1
{ 2h ,
Y0 = 1, Y1 = 1
1
If 0 < h < , then which of the following statements are true?
2
(a) (Yn ) → ∞ as n → ∞ (b)(Yn ) → 0 as n → ∞


(c) (Yn ) is bounded (d) maxnh∈[0,T] |y(nh) − Yn | → ∞ as T → ∞
7. Let u(x) satisfy the boundary value problem (BVP)
u′′ + u′ = 0, x ∈ (0,1)
{ u (0) = 0
u (1) = 1
Consider the finite difference approximation to (BVP)

UJ+1 − 2Uj + UJ−1 UJ+1 − UJ−1
+ = 0, j = 1, ⋯ , N − 1
(BVP)h { h2 2h
U0 = 0
UN = 1
Here UJ is an approximation to u(xj ) where xj = jh, j

1
= 0, ⋯ , N is a partition of [0,1] with h = for
N
some positive integer N. Then which of the following are true?
(a) There exists a solution to (BVP)h of the form Uj = ar j + b for some a, b ∈ ℝ with
r ≠ 1 and r satisfying (2 + h)r 2 − 4r + (2 − h) = 0
(b)Uj = (r j − 1)⁄r N − 1 where r satisfies (2 + h)r 2 − 4r + (2 − h) = 0 and r ≠ 1
(c) u is monotonic in x (d)Uj is monotonic in j.
CSIR NET JUNE 2018
8. The forward difference operator is defined as ∆Un = Un+1 . Then which of the
following difference equations has an unbounded general solution?

1
(a)∆2 Un − 3∆Un + 2Un = 0 (b)∆2 Un + ∆Un + Un = 0
4

1
(c)∆2 Un − 2∆Un + 2Un = 0 (d)∆2 Un+1 − ∆2 Un = 0
3
CSIR NET JUNE 2017
9. Let yn satisfy yn = yn−1 + hyn−1 with y0 = 1 (n = 1, 2, ⋯ , N) and for 0 < h < 1,
Nh = 1. Then
(a)yN → e as N → ∞ (b)yN → eh as N → ∞
(c)yn = (1 + h)n (d)yn ≥ 1
10. For a differentiable function f ∶ ℝ → ℝ define the difference quotient
f(x + h) − f(x)
(Dx f)(h) = ;h > 0
h
Consider the numbers of the form ĥ = h(1 + ϵ) for a fixed ϵ > 0 and let
e1 (h) = f ′ (x) − (Dx f)(h)
e2 (h) = (Dx f)(h) − (Dx f)(ĥ)
e(h) = e1 (h) + e2 (h)
If f(x + ĥ) = f(x + h) then
(a)e1 (h) → 0 as h → 0 (b)e2 (h) → 0 as h → 0
ϵf ′ (x)
(c )e 2 (h ) → as h → 0 (d) e(h) → 0 as h → 0
1+ϵ
11. The order of linear multi step method
h
uj+1 = (1 − a)uj + auj−1 + {(a + 3)u′j+1 (3a + 1)u′ j−1 }
4

for solving u′ = f(x, u) is
(a) 2 if a = −1 (b) 2 if a = −2 (c) 3 if a = −1 (d) 3 if a = −2
CSIR NET JUNE 2016
12. Consider the Runge Kutta method of the form
yn+1 = yn + ak1 + bk 2
k1 = hf(xn , yn )
k 2 = hf(xn + αh, yn + βk1 )
to approximate the solution of the initial value problem y ′ (x) = f(x, y(x)), y(x0 ) = y0 .
Which of the following choices of a, b, α and β yield a second order method?

1 1 1 1
(a ) a = , b = , α = 1, β = 1 (b) a = 1, b = 1, α = ,β =
2 2 2 2
1 3 2 2 3 1
(c ) a = ,b = ,α = ,β = ( d) a = , b = , α = 1, β = 1
4 4 3 3 4 4
13. Let y(t) satisfy the differential equation y ′ = λy; y(0) = 1. Then the backward
yn − yn−1
euler method, for n ≥ 1and h > 0 = λyn ; y0 = 1 yields
h
(a) a first order approximation to eλnh
(b) a polynomial approximation to eλnh
(c) a rational function approximation to eλnh
(d) a chebyshev polynomial approximation to eλnh


dy
14. Consider the initial value problem = x + y, y(0) = 1. Then the approximate
dx
value of the solution y(x)at x = 0.2, using improved Euler method, with h = 0.2 is
(a)1.11 (b) 1.20
(c)1.24 (d)1.48
CSIR NET JUNE 2013
15. A Runge kutta method for numerically solving the initial value ordinary differential
equation y ′ = f(x, y);
y(x0 ) = y0 is given by(for small h)
y(x + h) = y(x) + w1 F1 (x, y) + w2 F2 (x, y)
F1 (x, y) = hf(x, y)
F2 (x, y) = hf(x + αh, y + βF1 (x, y)
The objective is to determine the constants w1 , w2 , α and β such that the above formula is
accurate to order 2
(That is, the error term O(h3 )). Which of the following are corect sets of values for these constant?
1 1
(a)w1 = , w1 = , α = 1, β = 1
2 2
1
(b)w1 = 2, w1 = 1, α = , β = 1/2
2
1 2 3
(c)w1 = , w1 = , α = 3/4, β =
3 3 4
3 1
(d)w1 = , w1 = , α = 2, β = 2
4 4
dy
16. Consider the ordinary differential equation = λy; t > 0, y(0) = 1, and the Euler
dt
Yn+1 − Y
scheme with step size h, = λYn ; n ≥ 1, Y0 = 1
h
Which of the following are necessarily true for Y1 which approximates Y(h) = eλh ?
(a)Y1 is a approximation
(b) Y1 is a rational function approximation
(c) Y1 is a trigonometric function approximation
(d)Y1 is a truncation of infinite series
ANSWER KEY
1 2 3 4 5 6 7 8 9 10
0.43- (c) 2.40-2.5 1.01 (c) (b, c) (a, b, c, d) (a, c, d) (a, c, d) (a, c)
0.45
11 12 13 14 15 16
(b, c) (a, c) (a, c) (c) (a, c, d) (a, d)

GATE MA 2023
1. Consider the linear system of equations Ax = b with

3 1 1 2
A = (1 4 1) and b = (3)
2 0 3 4
Which of the following statements are true?
1 1
0
4 3
1 1
(a) The Jacobi iterative matrix is 0
3 3
2
(3 0 0)
(b) The Jacobi iterative method converges for any initial vector
(c) The Gauss Seidel iterative method converges for any initial vector
(d) The spectral radius of the Jacobi iterative matrix is less than 1
GATE MA 2022
α 3 0
2. Let M = [β 3 1] . Consider the following statements:
0 1 2
I ∶ There exists a lower triangular matrix L such that M = LLt , where Lt denotes
transpose of L.
II ∶ Gauss Seidel method for Mx = b (b ∈ ℝ3 ) converges for any initial choice x0 ∈ ℝ3 .
Then
9 9
(a) I is not true when α > ,β = 3 (b) II is not true when α > , β = −1
2 2

3
(c) II is not true when α = 4, β = (d) I is true when α = 5, β = 3
2
GATE MA 2018
3. Consider the following two statements:
0 5
P ∶ The matrix [ ] has infinitely many LU factorizations, where L is lower
0 7
triangular with each diagonal entry 1 and U is upper triangular.
0 0
Q ∶ The matrix [ ] has no LU factorization, where L is lower triangular with each
2 7
diagonal entry 1 and U is upper triangular.
Then, which of the following options is correct?
(a) P is TRUE and Q is FALSE (b) both P and Q are TRUE
(c) P is FALSE and Q is TRUE (d) Both P and Q are FALSE
GATE MA 2017
1 2 1 x 1
4. Let J be teh Jacobi iteration matrix of the linear system [ 2 1 2] [y] = [2].
−4 2 1 z 3
Consider the following statements:
P ∶ One of the eigenvalues of J lies in the interval [2, 3]
Q ∶ The Jacobi iteration converges for the above system
(a) Both P and Q (b) Only P (c) Only Q (d) Neither P nor Q
GATE MA 2014

5. Using the Gauss Seidal iteration method with the initial guess
{0} {0} {0}
{x1 = 3.5, x2 = 2.25, x3 = 1.625} The second approximation
for the solution to the system of equations;
2𝑥1 − 𝑥2 = 7, −𝑥1 + 2𝑥2 − 𝑥3 = 1, −𝑥2 + 2𝑥3 = 1, is

{2} {2} {2}
(𝑎)x1 = 5.3125, x2 = 4.4491, x3 = 2.1563
(b) x1{2} = 5.3125, x2{2} = 4.3125 x3{2} = 2.6563
(c)x1{2} = 5.3125, x2{2} = 4.4491, x3{2} = 2.6563
(d) x1{2} = 5.4991, x2{2} = 4.4991, x3{2} = 2.1563
GATE MA 2012
5 −1 1 x 10
6. Consider the system of equations [2 4 0] [y] = [ 12 ].
1 1 5 z −1
Using Jacobi′ smethod with the initial guess [x (0) y (0) z (0) ]T = [2.0 3.0 0.0]T
, the approximate solution [x (2) y (2) z (2) ]T after two iterations, is
(𝑎)[2.64 −1.70 −1.12]T
(b) [2.64 −1.70 1.12]T
(c)[2.64 1.70 −1.12]T
(d) [2.64 1.70 1.12]T
GATE MA 2011
5 2 1 x1 13
7. Consider the system of equations [− 2 5 y
2] [ 1 ] = [−22].
−1 2 8 z1 14

with the initial guess [x1 (0) x2 (0) x3 (0) ]T = [1 1 1]T , the approximate
solution [x1 (1) x2 (1) x3 (1) ]T after one iteration by the Gauss Seidal method is
(𝑎)[2. −4.4 1.625]T
(b) [2. −4 −3]T
(c)[2. 4.4 1.625]T
( d) [ 2 −4 3]T
CSIR NET 16 SEPT 2022
8. Let A be the following invertible matrix with real positive entries:
1 2
A=( )
8 9
Let G be the associated Gauss Seidel iteration matrix. What are the two eigenvalues of G?
4 4 16 4 4
(a) 0 and (b) 0 and − (c)0 and ( d) and −
3 3 9 3 3
ANSWER KEY
1 2 3 4 5 6 7 8
(b,c,d) (d) (b) (b) (c)

Numerical Analysis Booklet

Uploaded by

Copyright:

Available Formats

Numerical Analysis Booklet

Uploaded by

Document Information

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Numerical Analysis Booklet

Uploaded by

Copyright:

Available Formats

MATHEMATICAL PATHSHALA

INDIA’S BEST ONLINE INSTITUTE FOR HIGHER MATHEMATICS

NUMERICAL ANALYSIS ASSIGNMENT-1

If xk ∈ (ζ, b) for some k ≥ 0, then which of the following statements

(a) xk+1 > ζ.

(b) xk+1 < ζ.

(c) xk+1 < xk .

(a) converges to √2, for all x0 ∈ ℝ\{0}.

(c) converges to √2, whenever x0 ∈ (−1, 1)\{0}.

(d) diverges for any x0 ≠ 0.

INDIA’S BEST ONLINE INSTITUTE FOR HIGHER MATHEMATICS

3. Consider the fixed point iteration xn+1 = φ(xn ) , n ≥ 0

Then, the order of convergence of the fixed point iteration method is

(a) 1. (b) 4. (c) 3. (d) 2.

4. Let f(x) = x 4 + 2x 3 − 11x 2 − 12x + 36 for x ∈ ℝ. The order of convergence of the

Newton Rapson method

for finding the root α = 2 of the equation f(x) = 0 is ⋯

with initial point x0 > 0. Then, the sequence {xn }

(a) converges only if x0 > 1. (b) converges only if x0 < 3.

6. Let f ∶ ℝ → ℝ be a twice continuously differentiable function. The order of

INDIA’S BEST ONLINE INSTITUTE FOR HIGHER MATHEMATICS

7. for the fixed point iteration xk+1 = g(xk ), k = 0, 1, 2, ⋯,

consider the following statements P and Q ∶

Which of the above statements hold TRUE?

8. Suppose that the Newton Raphson method is applied to the equation

the order of convergence of the method is equal to ⋯

CSIR NET NOVEMBER 2020

(a)The iteration (∗)is equivalent to the recurrence relation

(b)The iteration (∗)is equivalent to the recurrence relation

INDIA’S BEST ONLINE INSTITUTE FOR HIGHER MATHEMATICS

(d)If − ζ2 < x0 ≤ 0, then lim xk = ζ1 .

CSIR NET (15DECEMBER) 2019

10. Let x = ξ be a solution of x 4 − 3x 2 + x − 10 = 0.

(a)1. (b) 2. (c) 3. (d) 4.

CSIR NET JUNE 2019

Then, which of the following iteration scheme converges when x0 is choosen

CSIR NET DECEMBER 2018

If L = maxx∈[0,1] |f ′ (x)| , then which of the following are true?

(a) If L < 1, then xn converges to x.

(b)xn converges to x, provided L ≥ 1.

(c) The error en = xn − x, satisfies |en+1 | < L|en |.

INDIA’S BEST ONLINE INSTITUTE FOR HIGHER MATHEMATICS

CSIR NET DECEMBER 2017

13. The iterative method xn+1 = g(xn ) for the solution of x 2 − x − 2 = 0

converges quadratically in a neighbourhood of the root x = 2 if g(x) equals

CSIR NET JUNE 2017

(c)yn = (1 + h)n . (d)yn ≥ 1.

CSIR NET DECEMBER 2016

has 3rd order convergence to √a, are

CSIR NET DECEMBER 2015

(a) a = 5. (b) a = 1. (c) a = 0.1. (d) a = 10.

INDIA’S BEST ONLINE INSTITUTE FOR HIGHER MATHEMATICS

The possible limits of the iteration are

(a) − 1. (b) 3. (c) 0. (d)√3 + √3 + √3 + ⋯.

and its application to find approximate square root of 2, starting with x0 = 2.

Consider the first and second iterates x1 and x2 , respectively; then

(a) xn converges to √2 with order of convergence 1

INDIA’S BEST ONLINE INSTITUTE FOR HIGHER MATHEMATICS

(c)The given iteration is the fixed point for f(x) = x 2 − 2

(d) The given iteration is the Newton′ s method for f(x) = x 2 − 2