Metraipolis › archive › dc_95c74532d66c
Numerical stability — Wikipedia (en)
- Source
- Wikipedia (en)
- Original
- https://en.wikipedia.org/wiki/Numerical_stability
- License (as archived)
- CC-BY-SA-4.0
- Archived
- 2026-10-06T08:52:19.963Z
- SHA-256 of the archived text
01c822eeb98ee9ace3d574a2d5a6a96d34f84a27e1255dd17f1def258f6eec1d- Stable URL of this page
https://metraipolis.com/documento/dc_95c74532d66c
How to cite
Numerical stability — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Numerical_stability (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_95c74532d66c (Metraipolis archive dc_95c74532d66c, sha256 01c822eeb98ee9ace3d574a2d5a6a96d34f84a27e1255dd17f1def258f6eec1d)
BibTeX
@misc{dc95c74532d66c,
title = {Numerical stability — Wikipedia (en)},
howpublished = {Wikipedia (en)},
url = {https://en.wikipedia.org/wiki/Numerical_stability},
note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_95c74532d66c; sha256 01c822eeb98ee9ace3d574a2d5a6a96d34f84a27e1255dd17f1def258f6eec1d},
year = {2026}
}Archived text
Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Numerical_stability. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
In the mathematical subfield of numerical analysis, numerical stability is a generally desirable property of numerical algorithms. The precise definition of stability depends on the context: one important context is numerical linear algebra, and another is algorithms for solving ordinary and partial differential equations by discrete approximation. In numerical linear algebra, the principal concern is instabilities caused by proximity to singularities of various kinds, such as very small or nearly colliding eigenvalues. On the other hand, in numerical algorithms for differential equations the concern is the growth of round-off errors and/or small fluctuations in initial data which might cause a large deviation of final answer from the exact solution. Some numerical algorithms may damp out the small fluctuations (errors) in the input data; others might magnify such errors. Calculations that can be proven not to magnify approximation errors are called numerically stable. One of the common tasks of numerical analysis is to try to select algorithms which are robust – that is to say, do not produce a wildly different result for a very small change in the input data. An opposite phenomenon is instability. Typically, an algorithm involves an approximative method, and in some cases one could prove that the algorithm would approach the right solution in some limit (when using actual real numbers, not floating point numbers). Even in this case, there is no guarantee that it would converge to the correct solution, because the floating-point round-off or truncation errors can be magnified, instead of damped, causing the deviation from the exact solution to grow exponentially. Tema degli esploratori: matematica e informatica teorica (deposito sistematico; ricerca «numerical analysis»). Fonte: Wikipedia in inglese, voce «Numerical stability» — https://en.wikipedia.org/wiki/Numerical_stability Wikidata Q1430640 (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q1430640 Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Numerical_stability?action=history). Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza. Estratto dell'introduzione non modificato nel contenuto; revisione 1353491555, consultata il 2026-10-06T08:20:29.421Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: 33176e67ceaacbc355added48fac74530fd2116256d213a630a0f3beb4e397b3