maths.free › Numerical Methods

Numerical Methods

Most equations have no closed form; numerical methods find answers to as many decimals as you like and, crucially, tell you how wrong they might be. Every iteration here is shown as a step.

Nodarbības

Symbols used here

\approx
approximately equal
Equal to the precision shown, not exactly.
f'(x),\ \frac{dy}{dx}
derivative
Instantaneous rate of change; slope of the graph.
\int f(x)\,dx,\ \int_a^b
integral
Antiderivative (indefinite) or signed area from a to b (definite).
O(n^2),\ \Theta,\ \Omega
big-O notation
Grows no faster than n² (up to a constant), for large n.
x_{n+1} = x_n - \frac{f(x_n)}{f\'(x_n)}
Newton iteration
The next approximation follows the tangent to the axis.

Questions people ask

Why not just solve exactly?

Most equations have no closed-form solution at all, and many that do are unusable in practice. A numerical method delivers as many correct digits as you need, and a good one tells you how many that is.

Why can Newton's method fail?

If it starts where the tangent is nearly flat it shoots far away; near a repeated root it slows to a crawl; and with several roots it may land on the wrong one. A bracketing method like bisection is slower but cannot fail.

Citas filiāles