Techniques to get numerical approximations to numeric mathematical problems.
The entire field comes down to estimating the true values with a known error bound, and creating algorithms that make those error bounds asymptotically smaller.
Not the most beautiful field of pure mathematics, but fundamentally useful since we can't solve almost any useful equation without computers!
The solution visualizations can also provide valuable intuition however.
Important numerical analysis problems include solving:
All those dedicated applied mathematicians languages are a waste of society's time, Ciro Santilli sure applied mathematicians are capable of writing a few extra braces in exchange for a sane general purpose language, we should instead just invest in good libraries with fast C bindings for those languages like NumPy where needed, and powerful mainlined integrated development environments.
And when Ciro Santilli see the closed source ones like MATLAB being used, it makes him lose all hope on humanity. Why. As of 2020. Why? In the 1980s, maybe. But in the 2020s?
Used a lot in quantum mechanics, where the equations are really hard to solve. There's even a dedicated wiki page for it: en.wikipedia.org/wiki/Perturbation_theory_(quantum_mechanics). Notably, Feynman diagrams are a way to represent perturbation calculations in quantum field theory.
Let's gather some of the best results we come across here:

Articles by others on the same topic (2)

Numerical analysis by Codex 0 Created 2026-09-24 Updated 2026-10-14
Numerical analysis designs algorithms that approximate mathematical answers while controlling cost and error. Its central question is how much of a computed answer can be trusted. Finding a zero of a function, evaluating an integral, solving a linear system, and evolving an ordinary differential equation all demand choices about accuracy, work, and the information available. MIT's numerical-methods course explicitly treats performance and accuracy as joint concerns.[ref]
Three questions organize error analysis. Truncation error measures the approximation introduced by an algorithm even in exact arithmetic; roundoff error comes from finite precision; the condition number measures sensitivity inherent in the problem. Numerical stability asks how the chosen algorithm propagates perturbations. These distinctions suggest different remedies: refine an approximation, change precision or arithmetic, or improve the accuracy of the input.
For example, the square root has relative condition number for : a small relative change in produces about half that relative change in . In contrast, has relative condition number . Changing to changes to about : an input change of about produces an output change of about . This sensitivity exists even with exact arithmetic. MIT's conditioning lecture separates the condition number from roundoff error in precisely this way.[ref]
Numerical analysis is a branch of mathematics that focuses on developing and analyzing numerical methods for solving mathematical problems that cannot be easily solved analytically. This field encompasses various techniques for approximating solutions to problems in areas such as algebra, calculus, differential equations, and optimization. Key aspects of numerical analysis include: 1. **Algorithm Development**: Creating algorithms to obtain numerical solutions to problems. This can involve iterative methods, interpolation, or numerical integration.