Scribd
Upload
0 views

Numerical Methods Complete Notes

The document provides comprehensive notes on various numerical methods including root finding, linear systems, interpolation, numerical integration, ordinary and partial differential equations. It outlines methods such as Bisection, Newton-Raphson, Gauss Elimination, and Runge-Kutta, along with common mistakes associated with each method. Additionally, it discusses the importance of numerical methods in practical applications and the role of computer programming in enhancing precision and efficiency.

Uploaded by

aayuttam
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
0 views

Numerical Methods Complete Notes

The document provides comprehensive notes on various numerical methods including root finding, linear systems, interpolation, numerical integration, ordinary and partial differential equations. It outlines methods such as Bisection, Newton-Raphson, Gauss Elimination, and Runge-Kutta, along with common mistakes associated with each method. Additionally, it discusses the importance of numerical methods in practical applications and the role of computer programming in enhancing precision and efficiency.

Uploaded by

aayuttam
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 Methods - Complete Notes

from Chat
Root Finding Methods
- Bisection Method: Simple bracketing method. Mistake: Wrong initial interval or not
verifying f(a)*f(b)<0.

- Newton-Raphson Method (2 equations): Uses derivatives. Mistake: Not calculating


Jacobian properly or using poor initial guess.

- Regula-Falsi and Secant Method: Approximate root without derivative. Mistake: Confusing
formulas or bad interval.

- Fixed Point Iteration: x = g(x). Mistake: Incorrect g(x) or diverging iterations.

- Rate of Convergence: Newton-Raphson > Secant > Regula-Falsi > Bisection > Fixed Point.

Linear Systems
- Gauss Elimination with Pivoting: Improves numerical stability. Mistake: Not swapping
rows correctly.

- Gauss-Jordan: Complete elimination to identity. Mistake: Calculation error in back


substitution.

- LU Factorization: A = LU. Mistake: Errors in L and U steps.

- Jacobi & Gauss-Seidel: Iterative methods. Mistake: Not checking convergence criteria.

- Power Method: For dominant eigenvalue. Mistake: Wrong normalization or poor initial
vector.

Interpolation
- Newton’s Interpolation (Forward, Backward): Based on difference tables.

- Central Interpolation: Stirling (symmetric) & Bessel (for midpoints).

- Lagrange Interpolation: Based on known x values.

- Least Squares Method: Fits best curve to data (linear, polynomial).

- Spline (Cubic): Smooth curve with continuous derivatives. Mistake: Boundary conditions
or continuity conditions.
Numerical Integration
- Numerical Differentiation: Use finite difference formulas.

- Maxima and Minima: Use first and second derivative tests.

- Newton-Cotes Quadrature: General formula class.

- Trapezoidal Rule: Simple linear area. Mistake: Forgetting end-point weights.

- Simpson’s 1/3 & 3/8 Rules: Polynomial-based. Mistake: Using wrong n (even/odd).

- Romberg Integration: Recursive Simpson. Mistake: Wrong step halving.

- Gaussian Integration: Special weights & roots (Legendre polynomials). Mistake: Misuse of
weights or limits.

ODEs
- Euler & Modified Euler: First-order differential equations. Mistake: Local error
propagation.

- Runge-Kutta: High-accuracy step method (1st & 2nd order). Mistake: Wrong intermediate
k values.

- Boundary Value Problems:

- Finite Difference Method: Discretizes domain.

- Shooting Method: Converts to IVP.

Mistake: Initial guess errors or instability.

PDEs
- PDE Classification:

- Elliptic (Laplace), Parabolic (Heat), Hyperbolic (Wave)

- Laplace Equation: 5-point formula. Mistake: Not updating iteratively.

- Poisson Equation: Uses source term.

- Relaxation Method: Iterative improvement.

- Heat Equation (1D): Schmidt method (explicit). Mistake: Time step too large – instability.
Theory of Numerical Methods
1.1 Introduction to Numerical Methods

Numerical Methods are techniques to approximate solutions of mathematical problems


(like equations, integrals, and derivatives) using numbers and computers rather than exact
algebraic answers.

1.2 Importance of Numerical Methods

Used in engineering, science, and industry where exact solutions are difficult or impossible.

1.3 Approximation and Errors in Computation

- Truncation Error

- Round-off Error

- Absolute, Relative and Percentage Errors

1.4 Taylor's Series

Used for function approximation.

1.5 Newton's Finite Differences

Forward, Backward, Central, and Divided Difference formulas.

1.6 Difference, Shift, and Differential Operators

Operators used in interpolation and difference methods.

1.7 Uses of Computer Programming in Numerical Methods

Automates calculations, ensures precision, and is necessary for real-world problem solving.

You might also like