Numerical Methods
What is Numerical Methods?
A technique that uses arithmetic operations to obtain approximate solutions to mathematical problems.
Key formula / rule: Bisection Method
Key points
- Understand the necessity and principles of numerical methods.
- Apply various numerical techniques for root finding (Bisection, Newton-Raphson, Secant).
- Perform numerical integration using Trapezoidal and Simpson's 1/3 Rules.
- Solve ordinary differential equations using Euler's and Runge-Kutta methods.
Common exam trap
Ignoring convergence conditions, leading to divergent or incorrect results.
Definitions
- Term
Numerical Method
- Meaning
A technique that uses arithmetic operations to obtain approximate solutions to mathematical problems.
- Term
Convergence
- Meaning
The property of an iterative numerical method where successive approximations get progressively closer to the true solution.
- Term
Truncation Error
- Meaning
The error introduced by approximating an infinite mathematical process (like a series or integral) with a finite one.
- Term
Round-off Error
- Meaning
The error that arises from the finite precision with which numbers are represented and manipulated in a computer.
- Term
Root of a Function
- Meaning
A value 'x' for which the function f(x) equals zero.
Learning objectives
Understand the necessity and principles of numerical methods.
Apply various numerical techniques for root finding (Bisection, Newton-Raphson, Secant).
Perform numerical integration using Trapezoidal and Simpson's 1/3 Rules.
Solve ordinary differential equations using Euler's and Runge-Kutta methods.
Analyze and estimate errors associated with numerical solutions.
Formulae
- Name
Bisection Method
- Note
Finds the midpoint of the interval [a, b] where f(a) and f(b) have opposite signs.
- Expression
xc = (a+b)/2
- Name
Newton-Raphson Method
- Note
Requires the derivative of the function; converges quadratically if initial guess is close.
- Expression
xn+1 = xn - f(xn)/f'(xn)
- Name
Secant Method
- Note
Similar to Newton-Raphson but approximates the derivative using two previous points.
- Expression
xn+1 = xn - f(xn) * (xn - xn-1) / (f(xn) - f(xn-1))
- Name
Trapezoidal Rule
- Note
Approximates area under curve with trapezoids; h = (b-a)/n. Error is O(h2).
- Expression
∫_ab f(x) dx ≈ h/2 * [f(x0) + 2Σi=1^{n-1} f(xi) + f(xn)]
- Name
Simpson's 1/3 Rule
- Note
Approximates area with parabolas; h = (b-a)/n, n must be even. Error is O(h4).
- Expression
∫_ab f(x) dx ≈ h/3 * [f(x0) + 4Σi=1^{n/2} f(x2i-1) + 2Σi=1^{n/2-1} f(x2i) + f(xn)]
- Name
Euler's Method
- Note
First-order method for solving ODEs (dy/dx = f(x,y)); h is step size.
- Expression
yn+1 = yn + h * f(xn, yn)
- Name
Runge-Kutta 4th Order (RK4)
- Note
Fourth-order method for solving ODEs; highly accurate and widely used.
- Expression
k1 = h * f(xn, yn); k2 = h * f(xn + h/2, yn + k1/2); k3 = h * f(xn + h/2, yn + k2/2); k4 = h * f(xn + h, yn + k3); yn+1 = yn + (1/6) * (k1 + 2k2 + 2k3 + k4)
Prerequisites
Basic Calculus (differentiation, integration, limits, Taylor series expansion)
Algebra (solving equations, functions)
Understanding of sequences and series
Common mistakes
Ignoring convergence conditions, leading to divergent or incorrect results.
Incorrectly applying formulae, especially in iterative steps.
Not understanding the sources and implications of truncation and round-off errors.
Choosing an inefficient or inappropriate method for a given problem.
Errors in arithmetic calculations during manual iterations.
Keywords
Numerical
Approximation
Iteration
Root Finding
Integration
ODE
Error Analysis
Convergence
Bisection
Newton-Raphson
Trapezoidal
Simpson's
Euler
Runge-Kutta
Practice preview
The iterative formula for finding the root of f(x) = 0 using the Newton-Raphson method is given by:…
easy
The Trapezoidal Rule for numerical integration approximates the area under a curve by dividing the area into:…
easy
Consider the equation f(x) = x^3 - 2x - 5 = 0. Using the Bisection Method, if the initial interval is [2, 3], what is the new interval after one iteration?…
medium