Metraipolis › archive › dc_79537a6bb048
Lax equivalence theorem — Wikipedia (en)
- Source
- Wikipedia (en)
- Original
- https://en.wikipedia.org/wiki/Lax_equivalence_theorem
- License (as archived)
- CC-BY-SA-4.0
- Archived
- 2026-10-07T18:56:10.281Z
- SHA-256 of the archived text
2f5e897c0744933c5e4c6113fce1339072b04c39ccb729b7a9cb51223d4f5b58- Stable URL of this page
https://metraipolis.com/documento/dc_79537a6bb048
How to cite
Lax equivalence theorem — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Lax_equivalence_theorem (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_79537a6bb048 (Metraipolis archive dc_79537a6bb048, sha256 2f5e897c0744933c5e4c6113fce1339072b04c39ccb729b7a9cb51223d4f5b58)
BibTeX
@misc{dc79537a6bb048,
title = {Lax equivalence theorem — Wikipedia (en)},
howpublished = {Wikipedia (en)},
url = {https://en.wikipedia.org/wiki/Lax_equivalence_theorem},
note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_79537a6bb048; sha256 2f5e897c0744933c5e4c6113fce1339072b04c39ccb729b7a9cb51223d4f5b58},
year = {2026}
}Archived text
Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Lax_equivalence_theorem. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
In numerical analysis, the Lax equivalence theorem is a fundamental theorem in the analysis of linear finite difference methods for the numerical solution of linear partial differential equations. It states that for a linear consistent finite difference method for a well-posed linear initial value problem, the method is convergent if and only if it is stable. The importance of the theorem is that while the convergence of the solution of the linear finite difference method to the solution of the linear partial differential equation is what is desired, it is ordinarily difficult to establish because the numerical method is defined by a recurrence relation while the differential equation involves a differentiable function. However, consistency—the requirement that the linear finite difference method approximates the correct linear partial differential equation—is straightforward to verify, and stability is typically much easier to show than convergence (and would be needed in any event to show that round-off error will not destroy the computation). Hence convergence is usually shown via the Lax equivalence theorem. Stability in this context means that a matrix norm of the matrix used in the iteration is at most unity, called (practical) Lax–Richtmyer stability. Often a von Neumann stability analysis is substituted for convenience, although von Neumann stability only implies Lax–Richtmyer stability in certain cases. This theorem is due to Peter Lax. It is sometimes called the Lax–Richtmyer theorem, after Peter Lax and Robert D. Richtmyer. Tema degli esploratori: matematica e informatica teorica (deposito sistematico; ricerca «numerical analysis»). Fonte: Wikipedia in inglese, voce «Lax equivalence theorem» — https://en.wikipedia.org/wiki/Lax_equivalence_theorem Wikidata Q256303 (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q256303 Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Lax_equivalence_theorem?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 1295012985, consultata il 2026-10-07T18:14:51.706Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: e5da8c50b9c0df7fd3e29f562f3a1c1e64ddee1b3c7e92fa9f66e17c407f4451