Numerical Methods - Summary
Introduction
Numerical methods are techniques used to find approximate solutions to mathematical problems
that cannot be solved analytically. They are widely used in engineering, physics, and applied
sciences.
Root-Finding Methods
These are used to solve equations f(x) = 0.
- Bisection Method: Iteratively divides an interval until the root is found.
- Newton-Raphson Method: Uses tangent lines for fast convergence.
- Secant Method: Similar to Newton’s method but does not require derivative.
Interpolation
Interpolation is used to estimate values between known data points.
- Newton’s Interpolation: Uses divided differences.
- Lagrange Interpolation: Constructs a polynomial through given points.
Numerical Differentiation
Approximates the derivative of a function using finite differences. Example: f’(x) ≈ (f(x+h) – f(x)) / h.
Numerical Integration
Approximates the definite integral of a function.
- Trapezoidal Rule: Approximates area under curve using trapezoids.
- Simpson’s Rule: Uses parabolic arcs for better accuracy.
Solving Ordinary Differential Equations (ODEs)
Numerical methods approximate solutions to ODEs.
- Euler’s Method: Step-by-step approximation.
- Runge-Kutta Methods: More accurate methods using weighted averages of slopes.
Applications
Numerical methods are applied in structural analysis, fluid dynamics, optimization, and computer
simulations where exact solutions are not possible.