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.
درسها
newton's method on x^2 - 2 from 1
Core
Numerical integration: trapezoid and Simpson
Approximating an integral from sampled values, with error bounds.
integrate e^(-x^2) dx from 0 to 1
Core
Interpolation and Taylor approximation
Fitting polynomials through points, and approximating functions near a centre.
taylor series of e^x
Core
Floating point and error
Why 0.1 + 0.2 ≠ 0.3 on a computer, and how error propagates.
0.1 + 0.2
Symbols used here
Equal to the precision shown, not exactly.
Instantaneous rate of change; slope of the graph.
Antiderivative (indefinite) or signed area from a to b (definite).
Grows no faster than n² (up to a constant), for large n.
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.
شاخههای دیگر
+ Arithmetic𝑥 Algebra△ Geometry∿ Trigonometryƒ Precalculusσ Statistics & Probability⊢ Discrete Math & Logic∫ Calculus⊞ Linear Algebraℕ Number Theoryẏ Differential Equations∇ Multivariable Calculusε Real Analysis⋔ Combinatorics & Graph Theory∈ Set Theory & Logic𝔾 Abstract Algebra𝑃 Probability Theoryℂ Complex Analysis◎ Topologyμ Measure Theory‖·‖ Functional Analysisκ Differential Geometryπ₁ Algebraic Topology→ Category Theory∞ Frontiers