Numerical methods turn mathematical problems into computations a computer can carry out. This section covers three pillars in reference style: finding roots of equations, solving linear systems, and stepping through differential equations.
- Root Finding Methods — bisection and Newton-Raphson: how they work, how fast they converge, and how to choose.
- Solving Linear Systems — Gaussian elimination, pivoting, and why triangular systems are easy.
- Ordinary Differential Equations — initial value problems, the Euler method, and the Runge-Kutta family.
Each article states the method precisely and points out where its behavior is reliable and where care is needed. For a bird's-eye view first, see Numerical Methods: An Overview.