Numerical Computation

Numerical Computation Study guides

4 Numerical Computation topics with plain explanations and practice questions. Free on BASMAGLY.

Numerical Computation

Numerical analysis is the study of methods that give approximate answers to mathematical problems on a computer, together with a careful account of how large the error can be. This course page collects the core ideas: how errors are measured, how to find roots of equations with bracketing and tangent methods, and how to solve linear systems with Jacobi and Gauss-Seidel iteration. Each guide has a worked example with real numbers, so you can practise the same steps on exam questions and check where your own working differs.

Lecture 1: Introduction and Error

  • Numerical Errors: Absolute, Relative, Truncation and Round-off
    Numerical methods give approximate answers, so we measure how wrong they are. Learn absolute and relative error, truncation error, round-off error and significant digits.
    • Absolute error = |true - approximate|.
    • Relative error = absolute error / |true value|.
    • Truncation error comes from the method, round-off error comes from limited digits.
    • Rounding is more accurate than chopping.
    • Subtracting nearly equal numbers loses significant digits.

Root Finding Methods

  • Bisection Method: Finding Roots by Halving the Interval
    The bisection method finds a root of f(x) = 0 by repeatedly halving an interval where the sign changes. See the steps, the stopping rule and the iteration count formula.
    • Need f(a) x f(b) < 0 and f continuous.
    • c = (a + b) / 2, keep the half with the sign change.
    • Interval length after n steps: (b - a) / 2^n.
    • Iterations needed: n >= log2((b - a) / tolerance).
    • Always converges but only linearly.
  • Newton-Raphson Method: Formula, Steps and When It Fails
    Newton-Raphson finds roots fast using the tangent line: x(n+1) = x(n) - f(x(n)) / f'(x(n)). Learn the steps, quadratic convergence and the common failure cases.
    • x(n+1) = x(n) - f(x(n)) / f'(x(n)).
    • Quadratic convergence near a simple root.
    • Fails if f'(x) is zero or the guess is poor.
    • Needs a derivative, bisection does not.
    • Square root of a: x(n+1) = (x(n) + a / x(n)) / 2.

Numerical Integration

  • Trapezoidal Rule and Simpson Rule: Numerical Integration
    When an integral has no easy antiderivative, approximate it. Learn the composite trapezoidal rule, Simpson 1/3 rule, their formulas, error order and a worked example.
    • h = (b - a) / n.
    • Trapezoidal: (h/2)[first + 2 x middle terms + last], error order h^2.
    • Simpson 1/3: (h/3)[first + 4 odd + 2 even + last], n even, error order h^4.
    • Simpson 1/3 is exact up to cubic polynomials.
    • Use tables of values when no antiderivative exists.

Study mode Take a timed test

BASMAGLY is an independent student project, not an official Delta University site. Check lectures and your instructor for the final word.