Scribd
Upload
20 views3 pages

Numerical Analysis Viva Preparation

Uploaded by

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

Numerical Analysis Viva Preparation

Uploaded by

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

Numerical Analysis Viva Preparation

(MT301 – 24SMH-654)
Part 1: Root Detection & Linear Systems
 Q: What is the difference between algebraic and transcendental equations?

A: Algebraic equations involve only powers of x (e.g., x^2 - 4 = 0), while transcendental
equations involve non-algebraic functions like e^x, log(x), sin(x).
 Q: Why is error analysis important in numerical methods?

A: It helps determine the accuracy and reliability of numerical approximations, and


identifies round-off and truncation errors.
 Q: What is the rate of convergence?

A: It is the speed at which an iterative method approaches the exact solution.


 Q: Explain the Bisection Method and its convergence criteria.

A: It brackets the root and halves the interval repeatedly. Guaranteed convergence if
f(a)·f(b) < 0.
 Q: Describe the Regula-Falsi method.

A: Also called the false position method; uses a secant line to estimate the root. More
accurate than bisection in some cases.
 Q: Derive the formula for Newton-Raphson method.

A: x_{n+1} = x_n - f(x_n)/f'(x_n). Requires derivative and initial guess.


 Q: Compare Gauss Elimination and Gauss-Jordan methods.

A: Gauss Elimination gives upper triangular form, while Gauss-Jordan reduces to diagonal
(row-reduced) form.
 Q: What is LU decomposition? When is it preferred?

A: It decomposes A = LU and is used for solving multiple systems with same matrix.
 Q: Discuss the difference between Gauss-Jacobi and Gauss-Seidel methods.

A: Jacobi uses previous values, while Seidel uses updated values for faster convergence.

Part 2: Numerical Differentiation & Integration


 Q: Define finite difference operators (Δ, ∇, δ).
A: Δ: forward difference, ∇: backward difference, δ: central difference. Used to approximate
derivatives.
 Q: What is interpolation? When is it used?

A: Estimation between known data points, used when only discrete data is available.
 Q: Explain Gregory-Newton forward and backward interpolation formulas.

A: Forward: when values are increasing; Backward: when values are decreasing. Both use
finite differences.
 Q: What is the Stirling formula?

A: It is a central interpolation formula averaging forward and backward differences.


 Q: Describe the Trapezoidal Rule and Simpson’s Rules.

A: Used for numerical integration. Trapezoidal uses straight lines, Simpson’s uses parabolic
arcs.
 Q: What are the sources of error in numerical integration?

A: Truncation and round-off errors due to approximations and finite precision.


 Q: How is the Euler-Maclaurin formula used?

A: Links integration with summation and estimates error in quadrature rules.

Part 3: Numerical Solutions of ODEs & PDEs


 Q: What are IVP and BVP?

A: IVP: values known at one point; BVP: values known at boundaries.


 Q: Why are numerical methods required?

A: Many differential equations lack exact solutions; numerical methods approximate them.
 Q: Describe Taylor Series method.

A: Expands solution as a power series; requires derivatives.


 Q: Derive Euler’s and Modified Euler’s methods.

A: Euler: y_{n+1} = y_n + h*f(x_n, y_n); Modified uses average slopes.


 Q: Explain Runge-Kutta 4th order method.

A: More accurate method using weighted average of slopes (k1 to k4).


 Q: What is a Predictor-Corrector Method?

A: Predicts and refines values iteratively using Milne’s and Adams-Bashforth methods.
 Q: How do you solve PDEs using finite differences?

A: Replace derivatives with finite differences and iterate with boundary conditions.

Practical Viva – MATLAB Based


 Q: How to implement Bisection in MATLAB?

A: Use f(a)·f(b)<0; loop with midpoint update until tolerance is achieved.


 Q: Difference between for and while loop?

A: for: fixed iterations, while: runs until condition is false.


 Q: How to implement Euler's method?

A: Use y(i+1) = y(i) + h*f(x(i), y(i)) in loop.


 Q: LU decomposition in MATLAB?

A: [L,U]=lu(A); then solve Ly=b and Ux=y.


 Q: RK4 method in MATLAB?

A: Compute k1 to k4; y(i+1) = y(i) + (k1+2k2+2k3+k4)/6.


 Q: Use of fprintf and disp?

A: disp shows values directly; fprintf provides formatted output.


 Q: Using fzero and roots in MATLAB?

A: fzero finds roots of functions; roots finds roots of polynomials.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy