Lably
Skip to content

Céa's lemma

Lemma in numerical analysis of differential equations

  • 4 min read
  • 3 chapters

Related on Lably

Through Mathematics, Real number and Continuous function

Lemma statement

Let V be a real Hilbert space with the norm ‖⋅‖. Let a:V×V→R be a bilinear form with the properties

  • |a(v,w)|≤γ‖v‖‖w‖ for some constant γ>0 and all v,w in V (continuity)
  • a(v,v)≥α‖v‖2 for some constant α>0 and all v in V (coercivity or V-ellipticity).

Let L:V→R be a bounded linear operator. Consider the problem of finding an element u in V such that

a(u,v)=L(v) for all v in V.

Consider the same problem on a finite-dimensional subspace Vh of V, so, uh in Vh satisfies

a(uh,v)=L(v) for all v in Vh.

By the Lax–Milgram theorem, each of these problems has exactly one solution. Céa's lemma states that

‖u−uh‖≤γα‖u−v‖ for all v in Vh.

That is to say, the subspace solution uh is "the best" approximation of u in Vh, up to the constant γ/α.

The proof is straightforward

α‖u−uh‖2≤a(u−uh,u−uh)=a(u−uh,u−v)+a(u−uh,v−uh)=a(u−uh,u−v)≤γ‖u−uh‖‖u−v‖ for all v in Vh.

We used the a-orthogonality of u−uh and v−uh∈Vh

a(u−uh,v)=0,∀v∈Vh

which follows directly from Vh⊂V

a(u,v)=L(v)=a(uh,v) for all v in Vh.

Note: Céa's lemma holds on complex Hilbert spaces also, one then uses a sesquilinear form a(⋅,⋅) instead of a bilinear one. The coercivity assumption then becomes |a(v,v)|≥α‖v‖2 for all v in V (notice the absolute value sign around a(v,v)).

Sign in to keep reading

2 more chapters are free with a Lably account.

More in Topics in mathematics