Partial Differential Equations Test
Uploaded by
Maheswari NaikPartial Differential Equations Test
Uploaded by
Maheswari NaikSRI RAMAKRISHNA ENGINEERING COLLEGE
[Educational Service : SNR Sons Charitable Trust]
[Autonomous Institution, Accredited by NAAC with ‘A’ Grade]
[Approved by AICTE and Permanently Affiliated to Anna University, Chennai]
[ISO 9001-2015 Certified and all eligible programmes Accredited by NBA]
VATTAMALAIPALAYAM, N.G.G.O. COLONY POST, COIMBATORE – 641 022.
Subject Code:16MA208 Subject Name: PARTIAL DIFFERENTIAL EQUATIONS
AND NUMERICAL METHODS
Programme : II B.E Year: II
Semester: III
Branch : MECH Academic year:2020 -2021
Marks: 20x1 = 20 Online Objective Test 3 19.11.2020
1. By using Euler’s method, the value of y at x=0.1 for y'=1,y(0)=1 is _____
a)1 b)1.2 c)1.1 d)1.4
2. In R.K method to evaluate y n +1we need information only at the point _______
( a ) y n +1 ( b ) y n ( c ) y n−1 ( d ) y n+2
3. In Fourth order R.K method the value of ∆ y =¿
1 1 1
(a )
16
( k 1 +2 k 2 +2 k 3 +k 4 ) ( b ) ( k 1 +2 k 2 + k 3+ 2 k 4 ) ( c ) ( k 1+2 k 2 +2 k 3 + k 4 )
6 6
1
(d ) ( k +2 k 2 +2 k 3 + k 4 )
10 1
4. Modified Euler’s method is a _____________.
(a) iterative method (b) Single step method (c) Multistep method (d) Indirect method
5. If y ' =x + y , y ( 1 )=0 , then y ( 1.1 ) by Taylor series method is ____
( a ) 1.1103 ( b ) 0.1103 ( c ) 1.03 ( d ) ¿
6. Milne’s method is a _______ method
( a ) Predictor ( b ) Corrector ( c ) Single step ( d ) Multistep
7. The error in Milne’s corrector formula is _________
14 h 4 ' −h 4 ' h 2 ' h 2 '
(a ) ∆ y0 ( b ) ∆ y0 ( c ) ∆ y0 ( d ) ∆ y0
45 90 90 95
8. The use of RK method gives ______ convergence to the solutions of the differential
equations than Taylor series method
SRI RAMAKRISHNA ENGINEERING COLLEGE
[Educational Service : SNR Sons Charitable Trust]
[Autonomous Institution, Accredited by NAAC with ‘A’ Grade]
[Approved by AICTE and Permanently Affiliated to Anna University, Chennai]
[ISO 9001-2015 Certified and all eligible programmes Accredited by NBA]
VATTAMALAIPALAYAM, N.G.G.O. COLONY POST, COIMBATORE – 641 022.
( a ) quick ( b ) slow ( c ) rare ( d ) ¿
9. To use Milne’s method we need atleast _______ values of y prior to the required values
of y
( a ) One ( b ) Two ( c ) T h ree ( d ) Four
10. The predictor – corrector methods are __________
(a) Multi – step Method (b) Single step method (c) Direct method (d) Indirect method
11. Given y'=-y and y(0)=[Link] value of y at x=0.01 by Euler’s method is ______
a)1.01 b)1.001 c)1.05 d)0.99
12. The R-K method of second order and ________method are the same.
a)Euler b)Modified c)Taylor’s Series method d)Adam’s
13. Taylor series method is a _______ method
( a ) Predictor ( b ) Corrector ( c ) Singlestep ( d ) Multistep
14. The Laplace equation is a ___________ equation.
(a) Elliptic (b) Parabolic (c) hyperbolic (d) None
15. A Poisson equation is of the form ______
(a) (b) (c) (d) None
16. Bender – Schmidt method is used to solve ___________-
(a) 1 – Dimensional wave equation (b) 1 – Dimensional heat equation
(c) Laplace equation (d) Poisson Equation.
17. Standard five point formula is----
1
ui , j = [ u +u +u +u ]
4 i, j+1 i+1 , j+1 i−1, j i+1, j
a)
SRI RAMAKRISHNA ENGINEERING COLLEGE
[Educational Service : SNR Sons Charitable Trust]
[Autonomous Institution, Accredited by NAAC with ‘A’ Grade]
[Approved by AICTE and Permanently Affiliated to Anna University, Chennai]
[ISO 9001-2015 Certified and all eligible programmes Accredited by NBA]
VATTAMALAIPALAYAM, N.G.G.O. COLONY POST, COIMBATORE – 641 022.
1
ui+1, j+1 = [ u +u +u +u ]
4 i , j i, j+1 i−1, j i+1, j
b)
1
ui−1 , j−1= [ ui , j−1 +ui, j+1 +ui−1 , j +u i+1 , j ]
c) 4
1
ui , j = [ u +u +u +u ]
4 i, j−1 i , j+1 i−1, j i+1, j
d)
18. Diagonal five point formula is …..
1
ui+1, j−1 = [ ui−1 , j−1 +u i−1, j+1 +ui, j−1 +u i+1 , j+1 ]
a) 4
1
ui−1 , j−1= [ ui , j +u i−1, j+1 +ui+1, j−1 +ui+1, j+1 ]
b) 4
1
ui , j = [ ui−1 , j−1 +u i−1, j+1 +ui+1, j−1 +ui+1, j+1 ]
c) 4
1
ui−1 , j+1 = [ ui−1 , j +ui−1, j+1 +u i+1 , j−1 +ui+1 , j+1 ]
d) 4
1
λ=
[Link] - Schmidt Recurrence formula when 2
1 1
ui , j = [u
2 i−1 , j + 1
+ui + 1, j ] ui , j −1 = [u
2 i −1 , j −1
+ui +1, j ]
a) b)
1 1
ui , j +1= [u
2 i−1, j
+ui + 1, j +1 ] ui , j +1= [u
2 i−1, j
+ui + 1, j ]
c) d)
20. Period of Oscillation is….
1 2a l 2l
a) 2 a b) l c) a d) a
SRI RAMAKRISHNA ENGINEERING COLLEGE
[Educational Service : SNR Sons Charitable Trust]
[Autonomous Institution, Accredited by NAAC with ‘A’ Grade]
[Approved by AICTE and Permanently Affiliated to Anna University, Chennai]
[ISO 9001-2015 Certified and all eligible programmes Accredited by NBA]
VATTAMALAIPALAYAM, N.G.G.O. COLONY POST, COIMBATORE – 641 022.
Course instructors Programme Assessment Committee HoD
1. [Link]
2. [Link]
3. [Link]
ANSWER KEY
1 c)1.1
2.( b ) y n
1
3.( c ) ( k 1+2 k 2+2 k 3 + k 4 )
6
4. b) Single step method
5. .( b ) 0.1103
6.( d ) Multistep
14 h 4 '
7.( a ) ∆ y0
45
8.( a ) quick
9.( d ) Four
10 (a) Multi – step Method
11.( d)0.99
12. (b)Modified
SRI RAMAKRISHNA ENGINEERING COLLEGE
[Educational Service : SNR Sons Charitable Trust]
[Autonomous Institution, Accredited by NAAC with ‘A’ Grade]
[Approved by AICTE and Permanently Affiliated to Anna University, Chennai]
[ISO 9001-2015 Certified and all eligible programmes Accredited by NBA]
VATTAMALAIPALAYAM, N.G.G.O. COLONY POST, COIMBATORE – 641 022.
13. .( c ) Singlestep
14. (a) Elliptic
(b)
15.
(b) 1 – Dimensional heat equation
16.
1
ui , j = [ u +u +u +u ]
4 i, j−1 i , j+1 i−1, j i+1, j
17.
1
ui , j = [ ui−1 , j−1 +u i−1, j+1 +ui+1, j−1 +ui+1, j+1 ]
18. c) 4
1
ui , j +1= [u
2 i−1, j
+ui + 1, j ]
19. d)
2l
20. d) a
Common questions
Powered by AIConvergence rates in numerical methods indicate how quickly a method approaches the exact solution as the step size decreases. A higher convergence rate means fewer steps are needed to achieve a desired accuracy. The Runge-Kutta method generally offers faster convergence compared to the Taylor series method because it avoids derivative calculations, instead using an averaged slope approach, leading to more accurate solutions with larger time steps. This makes the Runge-Kutta method favorable for situations requiring both efficiency and high precision .
A significant advantage of multi-step methods such as predictor-corrector methods over single-step methods is their efficiency in terms of computational workload. Multi-step methods reuse previous calculations, which can significantly reduce the number of function evaluations needed, thus increasing computational efficiency without sacrificing accuracy. This makes them particularly suited for large-scale problems where computational cost is a concern .
The Bender-Schmidt method is specifically used to solve the one-dimensional heat equation, which is a type of partial differential equation (PDE). This method relies on finite difference discretization and is efficient for parabolic PDEs, allowing the computation of temperature distribution over time in a one-dimensional space .
Milne's method is classified as a multistep method because it uses several past points to predict the future value of a function. It requires at least four prior values of the dependent variable to compute the next value. It is also a predictor-corrector method because it initially predicts the value and then corrects it iteratively to enhance accuracy .
The standard five-point formula assists in numerically solving PDEs by providing a discrete approximation to evaluating second-order derivatives, which are inherent in equations like the Laplace. This formula computes values at points surrounding a node to approximate the solution at that point. It is chosen for its simplicity and effectiveness in handling boundary value problems, ensuring stable and consistent results in spatial discretization of elliptic PDEs like the Laplace equation .
The Fourth Order Runge-Kutta method is used for its high degree of accuracy and efficiency in solving ordinary differential equations compared to other methods like Euler's method or the second-order methods. It provides better convergence to solutions, which is especially useful in practical applications involving complex differential equations .
The Taylor series method solves ordinary differential equations by expanding the function into its Taylor series, which requires the computation of derivatives. It is less efficient for complex systems due to the difficulty in computing higher-order derivatives. In comparison, the Runge-Kutta method avoids this by using weighted averages of slopes, which simplifies calculations, enhances stability, and generally provides faster convergence, making it more suitable for practical applications .
The Modified Euler's method is considered a single-step method because it calculates the next value of the dependent variable based solely on information from the current step, just like Euler's method. Despite making iterative improvements by adjusting the predicted value through averaging slope estimates (one at the initial point and one at the end point of the interval), it does not rely on data from previous steps to compute future values .
The classification of the Laplace equation as elliptic implies that its solutions are generally smooth and well-behaved, without discontinuities or shocks, unlike hyperbolic or parabolic equations. This classification indicates that solutions to the Laplace equation represent steady-state situations and exhibit stability, with changes in boundary conditions affecting the entire domain's solution smoothly .
The key conceptual difference lies in the approach to approximating solutions. Euler's method is a single-step approach that uses a simple linear interpolation based on the slope at the beginning of the interval. In contrast, the Modified Euler's method, also known as the improved Euler or Heun's method, improves upon this by averaging the slope at the beginning and the end of the interval, thus providing a more accurate estimation of the function's value at the next step .