Math 2.0

Numerical analysis Boundary value problems and finite elements Theorem

Petrov–Galerkin method

Builds on Hilbert spaceBilinear formContinuous dual spaceGalerkin method

Statement

Let UU and VV be real Hilbert spaces. Let a ⁣:U×V→ℝa \colon U \times V \to \R be a bilinear form with ∣a(w,v)∣≤M∥w∥U∥v∥V\abs{a(w, v)} \le M \norm{w}_U \norm{v}_V for all w∈Uw \in U and v∈Vv \in V, and let ff be in the continuous dual space V′V'. Let u∈Uu \in U satisfy a(u,v)=f(v)a(u, v) = f(v) for all v∈Vv \in V. Let Uh⊆UU_h \subseteq U (trial space) and Vh⊆VV_h \subseteq V (test space) be finite-dimensional subspaces of the same dimension, with βh=inf⁡w∈Uh∖{0} sup⁡v∈Vh∖{0}a(w,v)∥w∥U∥v∥V>0.\beta_h = \inf_{w \in U_h \setminus \set{0}} \ \sup_{v \in V_h \setminus \set{0}} \frac{a(w, v)}{\norm{w}_U \norm{v}_V} > 0. Then there is a unique uh∈Uhu_h \in U_h with a(uh,v)=f(v)a(u_h, v) = f(v) for all v∈Vhv \in V_h, and ∥u−uh∥U≤(1+Mβh)inf⁡w∈Uh∥u−w∥U.\norm{u - u_h}_U \le \Big( 1 + \frac{M}{\beta_h} \Big) \inf_{w \in U_h} \norm{u - w}_U.

Remarks

In bases of UhU_h and VhV_h the discrete problem is a square linear system. The condition βh>0\beta_h > 0 says that a(w,v)=0a(w, v) = 0 for all v∈Vhv \in V_h forces w=0w = 0, so the system matrix is injective and therefore invertible. Subtracting the equations gives a(u−uh,v)=0a(u - u_h, v) = 0 for all v∈Vhv \in V_h. For w∈Uhw \in U_h this gives βh∥uh−w∥≤sup⁡va(uh−w,v)/∥v∥=sup⁡va(u−w,v)/∥v∥≤M∥u−w∥\beta_h \norm{u_h - w} \le \sup_{v} a(u_h - w, v) / \norm{v} = \sup_{v} a(u - w, v) / \norm{v} \le M \norm{u - w}. The triangle inequality ∥u−uh∥≤∥u−w∥+∥w−uh∥\norm{u - u_h} \le \norm{u - w} + \norm{w - u_h} then gives the bound.

The case U=VU = V and Uh=VhU_h = V_h is the Galerkin method; there, coercivity with constant α\alpha gives βh≥α\beta_h \ge \alpha. Example: in the streamline upwind Petrov–Galerkin method for −εu′′+u′=f-\varepsilon u'' + u' = f, each test function is a trial hat function plus a multiple of its derivative, which adds stabilisation along the flow.

A positive βh\beta_h is needed: with βh=0\beta_h = 0 the discrete system is singular, and with βh→0\beta_h \to 0 along a family of meshes the bound degenerates.

Going deeper

For a student

The theorem is the discrete half of the Babuška theory of problems that are well posed but not coercive. It explains why different test spaces can stabilise convection-dominated problems and why some choices of spaces fail. Its constant 1+M/βh1 + M / \beta_h can be improved to M/βhM / \beta_h in Hilbert spaces, a result of Xu and Zikatanov. For saddle-point problems, the analogous condition is the Ladyzhenskaya–Babuška–Brezzi condition.

Reading path

To understand this page from the ground up, read these 5 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Bilinear form concept
  2. Continuous dual space concept
  3. Galerkin method concept
  4. Hilbert space concept
  5. Petrov–Galerkin method statement

Further reading

  1. Web https://en.wikipedia.org/wiki/Petrov%E2%80%93Galerkin_method
About this page
TagRTBJM23ETS
URIm2://RTBJM23ETS
Kindstatement, theorem
WritingW0 stub
MSC65N30, 65N12
StatusThis copy of the site has no build data. Run m2 status RTBJM23ETS.
AboutGalerkin method
UsesHilbert space, Bilinear form, Continuous dual space, Galerkin method

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.