Ladyzhenskaya–Babuška–Brezzi condition
Ladyzhenskaya–Babuška–Brezzi condition is a mathematical term.
All 1 facts, and where they come from
Facts
1 facts · 0 confirmed by two sources · 0 cited · 1 from one source
Where this comes from
Papalocal keeps its own record. It started from these sources; what each one said is kept here as it was copied, so a change on their side never changes this page by itself. Tap one to read its version.
What Wikidata says · copied November 17, 2026 · revision 2286958376
- Described as
- mathematical term
- What it is
- theorem
- Wikipedias with a page
- 2
Wikidata item Q55648034 (wikidata.org/wiki/Q55648034), public domain (CC0). Copied 2026-11-17.
What Wikipedia says · copied November 17, 2026 · revision 1318522018
In numerical partial differential equations, the Ladyzhenskaya–Babuška–Brezzi (LBB) condition is a sufficient condition for a saddle point problem to have a unique solution that depends continuously on the input data. Saddle point problems arise in the discretization of Stokes flow and in the mixed finite element discretization of Poisson's equation. For positive-definite problems, like the unmixed formulation of the Poisson equation, most discretization schemes will converge to the true solution in the limit as the mesh is refined. For saddle point problems, however, many discretizations are unstable, giving rise to artifacts such as spurious oscillations. The LBB condition gives criteria for when a discretization of a saddle point problem is stable.
The condition is variously referred to as the LBB condition, the Babuška–Brezzi condition, or the "inf-sup" condition.
From the Wikipedia article “Ladyzhenskaya–Babuška–Brezzi condition” (en.wikipedia.org/wiki/Ladyzhenskaya–Babuška–Brezzi_condition), by its contributors, under CC BY-SA 4.0 (creativecommons.org/licenses/by-sa/4.0/). Copied 2026-11-17; not changed.
Confirmed Two sources agree. Cited One source, and it names where it got it. One source One source, without a reference of its own. Sources disagree The sources disagree. We show the best-supported value and keep theirs below.
