01 Key Concepts
Why Numerical Methods Matter
Many real-world equations (especially nonlinear ones) have no exact algebraic solution, so we approximate the answer instead, often using a computer.
Bisection Method
Repeatedly halves an interval known to contain a root, narrowing in on the answer by checking which half still contains a sign change.
Newton's Method
Uses a function's derivative to rapidly converge on a root: x_(n+1) = x_n - f(x_n)/f'(x_n), starting from an initial guess.
Numerical Integration (Trapezoidal Rule)
Approximates the area under a curve by dividing it into trapezoids instead of computing an exact integral.
Error and Convergence
Numerical methods produce approximations, not exact answers; the 'error' shrinks as you do more iterations or use smaller step sizes, until the method 'converges' close enough to the true answer.
02 Key Formulas
- Newton's method: x_(n+1) = x_n - f(x_n)/f'(x_n)
03 Solved Examples
- The bisection method starts by testing the midpoint of the interval.
- Midpoint = (1+2)/2.
- f(1.5) = 1.5^2-2 = 0.25. f'(1.5) = 2*1.5 = 3.
- x_1 = 1.5 - 0.25/3 = 1.5 - 0.0833.
- Some equations, especially those mixing polynomials with trig, exponential, or log terms, have no algebraic formula for their solution.
- Numerical methods provide a practical way to approximate the answer to any desired precision.
04 Practice Questions
๐ Numerical Methods โ Downloadable Worksheet
10 questions with a full answer key. Grab the PDF to print, or try the interactive version in your browser.