Global Information Lookup Global Information

Lax equivalence theorem information


In numerical analysis, the Lax equivalence theorem is a fundamental theorem in the analysis of finite difference methods for the numerical solution of partial differential equations. It states that for a consistent finite difference method for a well-posed linear initial value problem, the method is convergent if and only if it is stable.[1]

The importance of the theorem is that while the convergence of the solution of the finite difference method to the solution of the 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 finite difference method approximates the correct 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.[2] 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.[3]

  1. ^ Strikwerda, John C. (1989). Finite Difference Schemes and Partial Differential Equations (1st ed.). Chapman & Hall. pp. 26, 222. ISBN 0-534-09984-X.
  2. ^ Smith, G. D. (1985). Numerical Solution of Partial Differential Equations: Finite Difference Methods (3rd ed.). Oxford University Press. pp. 67–68. ISBN 0-19-859641-3.
  3. ^ Lax, P. D.; Richtmyer, R. D. (1956). "Survey of the Stability of Linear Finite Difference Equations". Comm. Pure Appl. Math. 9 (2): 267–293. doi:10.1002/cpa.3160090206. MR 0079204.

and 24 Related for: Lax equivalence theorem information

Request time (Page generated in 0.8431 seconds.)

Lax equivalence theorem

Last Update:

In numerical analysis, the Lax equivalence theorem is a fundamental theorem in the analysis of finite difference methods for the numerical solution of...

Word Count : 317

Equivalence theorem

Last Update:

Compass equivalence theorem, a theorem in straightedge and compass construction Equivalence principle, in general relativity Lax equivalence theorem, a theorem...

Word Count : 99

Peter Lax

Last Update:

Babuška–Lax–Milgram theorem Lions–Lax–Milgram theorem The Martians (scientists) Lewis, Adrian S.; Parrilo, Pablo A.; Ramana, Motakuri V. (2005). "The Lax conjecture...

Word Count : 1478

Von Neumann stability analysis

Last Update:

necessary and sufficient for stability in the sense of Lax–Richtmyer (as used in the Lax equivalence theorem): The PDE and the finite difference scheme models...

Word Count : 1392

Numerical stability

Last Update:

fixed time remains bounded as the step size goes to zero. The Lax equivalence theorem states that an algorithm converges if it is consistent and stable...

Word Count : 1551

Linear multistep method

Last Update:

as the Dahlquist equivalence theorem, named after Germund Dahlquist; this theorem is similar in spirit to the Lax equivalence theorem for finite difference...

Word Count : 4865

List of numerical analysis topics

Last Update:

vertices, line segments, triangles, tetrahedra, ..., making up a mesh Lax equivalence theorem — a consistent method is convergent if and only if it is stable...

Word Count : 8344

List of theorems

Last Update:

theorem (graph theory) Babuška–Lax–Milgram theorem (partial differential equations) Baily–Borel theorem (algebraic geometry) Baire category theorem (topology...

Word Count : 5996

Functional analysis

Last Update:

Banach–Steinhaus theorem is one of the fundamental results in functional analysis. Together with the Hahn–Banach theorem and the open mapping theorem, it is considered...

Word Count : 2503

Hilbert space

Last Update:

ensures unique solvability for a large class of problems is the Lax–Milgram theorem. This strategy forms the rudiment of the Galerkin method (a finite...

Word Count : 17476

Integrability conditions for differential systems

Last Update:

possible approach to certain over-determined systems, for example, including Lax pairs of integrable systems. A Pfaffian system is specified by 1-forms alone...

Word Count : 1055

John von Neumann

Last Update:

Wuytack 2001, p. 216. Gustafsson 2018, pp. 112–113. Lax, Peter D. (2005). "Interview with Peter D. Lax" (PDF) (Interview). Interviewed by Martin Raussen;...

Word Count : 23300

Enumeration

Last Update:

the index set. While we can make the requirements on the ordering quite lax in order to allow for great generality, the most natural and common prerequisite...

Word Count : 1637

Plancherel theorem for spherical functions

Last Update:

The measure class of μ in the sense of the Radon–Nikodym theorem is unique. Davies 1989 Lax & Phillips 1976 Helgason 1984, p. 38 Flensted-Jensen 1978...

Word Count : 11769

Radon transform

Last Update:

D(\mathbf {P} ^{\vee ,d}).} The main theorem about this transform is that this transform induces an equivalence of the categories of perverse sheaves...

Word Count : 3492

Partial differential equation

Last Update:

uniqueness theorems are usually important organizational principles. In many introductory textbooks, the role of existence and uniqueness theorems for ODE...

Word Count : 6680

Galerkin method

Last Update:

c\|u\|^{2}} for some constant c > 0. {\displaystyle c>0.} By the Lax-Milgram theorem (see weak formulation), these two conditions imply well-posedness...

Word Count : 2944

Typographical Number Theory

Last Update:

arithmetic that Hofstadter uses to help explain Gödel's incompleteness theorems. Like any system implementing the Peano axioms, TNT is capable of referring...

Word Count : 798

List of unsolved problems in mathematics

Last Update:

Fano varieties Maulik–Nekrasov–Okounkov–Pandharipande conjecture on an equivalence between Gromov–Witten theory and Donaldson–Thomas theory Nagata's conjecture...

Word Count : 19531

Galois connection

Last Update:

applications in various mathematical theories. They generalize the fundamental theorem of Galois theory about the correspondence between subgroups and subfields...

Word Count : 4173

Distributive property

Last Update:

⇔ ( ( P → Q ) ↔ ( P → R ) )  Distribution of   implication   over   equivalence  ( P → ( Q ∧ R ) ) ⇔ ( ( P → Q ) ∧ ( P → R ) )  Distribution of   implication ...

Word Count : 2998

Pentagram map

Last Update:

Poincaré recurrence theorem to imply that the action of the pentagram map on X is recurrent: The orbit of almost any equivalence class of convex polygon...

Word Count : 6234

Glossary of category theory

Last Update:

2-monad). Q Q-category. Quillen Quillen’s theorem A provides a criterion for a functor to be a weak equivalence. reflect 1.  A functor is said to reflect...

Word Count : 10474

In Pursuit of the Unknown

Last Update:

the role of mathematics in human history, beginning with the Pythagorean theorem (Pythagorean equation) to the equation that transformed the twenty-first...

Word Count : 808

PDF Search Engine © AllGlobal.net