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.
The abstract form of a saddle point problem can be expressed in terms of Hilbert spaces and bilinear forms. Let
V
Q
a:V x V\toR
b:V x Q\toR
f\inV*
g\inQ*
V*
Q*
a
b
u
V
p
Q
v
V
q
Q
\begin{align}a(u,v)+b(v,p)&=\langlef,v\rangle\\ b(u,q)&=\langleg,q\rangle.\end{align}
For example, for the Stokes equations on a
d
\Omega
u
p
H1(\Omega)d
L2(\Omega)
\begin{align}a(u,v)&=\int\Omega\mu\nablau:\nablavdx\\ b(u,q)&=\int\Omega(\nabla ⋅ u)qdx,\end{align}
where
\mu
Another example is the mixed Laplace equation (in this context also sometimes called the Darcy equations) where the fields are again the velocity
u
p
d | |
H | |
div(\Omega) |
L2(\Omega)
\begin{align}a(u,v)&=\int\Omegau ⋅ K-1vdx\\ b(u,q)&=\int\Omega(\nabla ⋅ u)qdx,\end{align}
where
K-1
Suppose that
a
b
a
b
a(v,v)\ge
2 | |
\alpha\|v\| | |
V |
for all
v
b(v,q)=0
q\inQ
b
\supv
b(v,q) | |
\|v\|V |
\ge\beta\|q\|Q
for all
q
\beta>0
u,p
C
\|u\|V+\|p\|Q\le
C(\|f\| | |
V* |
+
\|g\| | |
Q* |
).
The alternative name of the condition, the "inf-sup" condition, comes from the fact that by dividing by
\|q\|Q
\supv
b(v,q) | |
\|v\|V\|q\|Q |
\ge\beta.
Since this has to hold for all
q\inQ
q
q
infq\in\supv
b(v,q) | |
\|v\|V\|q\|Q |
\ge\beta.
Saddle point problems such as those shown above are frequently associated with infinite-dimensional optimization problems with constraints. For example, the Stokes equations result from minimizing the dissipation
I(u)=\int\Omega\left(
12 | |
\mu |
|\nablau|2-f ⋅ u\right)
subject to the incompressibility constraint
\nabla ⋅ u=0.
Using the usual approach to constrained optimization problems, one can form a Lagrangian
L(u,λ)=I(u)-\left(λ,\nabla ⋅ u\right)=\int\Omega\left(
12 | |
\mu |
|\nablau|2-f ⋅ u-λ(\nabla ⋅ u)\right).
The optimality conditions (Karush-Kuhn-Tucker conditions) -- that is the first order necessary conditions—that correspond to this problem are then by variation of
L(u, λ)
u
\int\Omega\left(\mu\nablau:\nablav-f ⋅ v-λ(\nabla ⋅ v)\right)=0 \forallv\inH1(\Omega)d,
and by variation of
L(u,λ)
λ
-\int\Omega\left(q(\nabla ⋅ u)\right)=0 \forallq\in
d, | |
L | |
2(\Omega) |
This is exactly the variational form of the Stokes equations shown above with
a(u,v):=\int\Omega\left(\mu\nablau:\nablav\right),
b(λ,v):=\int\Omegaλ(\nabla ⋅ v).
The inf-sup conditions can in this context then be understood as the infinite-dimensional equivalent of the constraint qualification (specifically, the LICQ) conditions necessary to guarantee that a minimizer of the constrained optimization problem also satisfies the first-order necessary conditions represented by the saddle point problem shown previously. In this context, the inf-sup conditions can be interpreted as saying that relative to the size of the space
V
u
Q
λ
V
u
Q
λ