Numerical analysis Boundary value problems and finite elements Theorem
Ladyzhenskaya–Babuška–Brezzi condition
Builds on Hilbert spaceBilinear formCoercive bilinear formContinuous dual spaceLax–Milgram theoremKernel
Statement
Let and be real Hilbert spaces. Let and be bounded bilinear forms, and let and , where denotes the continuous dual space. Consider the saddle-point problem: find with Let and be finite-dimensional subspaces, and let . Assume that there are constants and , independent of , such that:
- is coercive on : for all ;
- the inf-sup condition, or LBB condition, holds:
Then the discrete problem, posed with and in place of and , has a unique solution . If the continuous problem has a solution , then where depends only on , and the bounds of and .
Remarks
The same two conditions with , and the kernel give existence and uniqueness for the continuous problem; this is Brezzi's theorem. The inf-sup condition says that the operator given by maps onto with a bounded right inverse. So one first finds with and . Then one solves for in by the Lax–Milgram theorem. Finally one recovers from the first equation, using the inf-sup condition again. The point of the discrete theorem is that does not depend on ; otherwise the constant can blow up as the mesh is refined.
Example: for the Stokes equations, , , and . The Taylor–Hood pair, continuous piecewise quadratic velocities with continuous piecewise linear pressures, satisfies the inf-sup condition uniformly on suitable meshes.
Necessity: the pair of continuous piecewise linear velocities and pressures on a triangle mesh violates the condition. The discrete problem then has spurious pressure modes or a constant that tends to , and the computed pressure oscillates.
Going deeper
For a student
The condition is the key stability requirement of mixed finite element methods. It replaces the coercivity of the Lax–Milgram setting, which a saddle-point problem never has on the whole space . Checking it for a given pair of spaces is often done with a Fortin operator: a bounded projection with for all . Stable pairs include Taylor–Hood elements for Stokes flow and Raviart–Thomas elements with piecewise constants for the mixed Poisson problem.
Reading path
To understand this page from the ground up, read these 97 pages in order. The foundations come first.
- Bilinear form concept
- Closed set concept
- Coercive bilinear form concept
- Compact operator concept
- Continuous dual space concept
- Convex set concept
- Element definition
- Extended real number line object
- Hilbert space concept
- Hölder continuity concept
- Inequality of arithmetic and geometric means statement
- Kernel concept
- Linear form concept
- Lp space concept
- Orthogonal complement concept
- Proposition concept
- Real numbers object
- Set bounded above definition
- Sobolev space concept
- Uniform metric on bounded functions example
- Vector space definition
- Weak derivative concept
- Weak solution concept
- Set definition
- Young's inequality for products statement
- Sobolev embedding theorem statement
- Conjunction definition
- Disjunction definition
- Implication definition
- Predicate definition
- Supremum definition
- Inner product definition
- Linear map definition
- Linear subspace definition
- Norm definition
- Empty set object
- Family of sets definition
- Ordered pair definition
- Hölder's inequality statement
- Intersection definition
- Union definition
- Existential quantifier definition
- Universal quantifier definition
- Inner product space definition
- Orthogonal vectors definition
- Endomorphism definition
- Linear form definition
- Sum of subspaces definition
- Cartesian product definition
- Union of a family of sets definition
- Subset definition
- Uniqueness quantifier definition
- Norm induced by an inner product definition
- Orthogonal complement definition
- Riesz representation theorem in finite dimensions statement
- Sobolev inequality statement
- Direct sum of subspaces definition
- Binary relation definition
- Topological space definition
- Parallelogram law statement
- A space is the direct sum of a subspace and its orthogonal complement statement
- Projection definition
- Sequential compactness definition
- Function definition
- Subspace topology definition
- Orthogonal projection definition
- Preimage of a set definition
- Restriction of a function definition
- Orthogonal projection is the closest point statement
- Metric space definition
- Subspace metric definition
- Convergence of a sequence in a metric space definition
- Open ball definition
- Hilbert projection theorem statement
- Diameter of a set definition
- Metric topology definition
- Epsilon characterisation of Cauchy sequences statement
- Totally bounded set definition
- Riesz representation theorem statement
- Open set definition
- Complete metric space definition
- Open cover definition
- Open sets characterised by neighbourhoods statement
- Open sets of a metric space statement
- Compact space definition
- Continuity at a point of a topological space definition
- Compact set definition
- Lebesgue number lemma statement
- Epsilon-delta continuity in metric spaces statement
- Compactness and sequential compactness agree in metric spaces statement
- Equicontinuity definition
- Compact iff complete and totally bounded statement
- Arzelà–Ascoli theorem statement
- Rellich–Kondrachov theorem statement
- Poincaré inequality statement
- Lax–Milgram theorem statement
- Ladyzhenskaya–Babuška–Brezzi condition statement
Further reading
About this page
| Tag | SC5FV3GHV5 |
|---|---|
| URI | m2://SC5FV3GHV5 |
| Kind | statement, theorem |
| Writing | W0 stub |
| MSC | 65N30, 65N12, 76D07 |
| Status | This copy of the site has no build data. Run m2 status SC5FV3GHV5. |
| About | Mixed finite element method |
| Uses | Hilbert space, Bilinear form, Coercive bilinear form, Continuous dual space, Lax–Milgram theorem, Kernel |
| Same as |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.