Galerkin method - Alchetron, The Free Social Encyclopedia

In mathematics, in the area of numerical analysis, Galerkin methods are a class of methods for converting a continuous operator problem (such as a differential equation) to a discrete problem. In principle, it is the equivalent of applying the method of variation of parameters to a function space, by converting the equation to a weak formulation. Typically one then applies some constraints on the function space to characterize the space with a finite set of basis functions. Galerkin's method provides powerful numerical solution to differential equations and modal analysis.

The approach is usually credited to Boris Galerkin but the method was discovered by Walther Ritz, to whom Galerkin refers. Often when referring to a Galerkin method, one also gives the name along with typical approximation methods used, such as Bubnov–Galerkin method (after Ivan Bubnov), Petrov–Galerkin method (after Georgii I. Petrov) or Ritz–Galerkin method (after Walther Ritz).

Examples of Galerkin methods are:

the Galerkin method of weighted residuals, the most common method of calculating the global stiffness matrix in the finite element method,

the boundary element method for solving integral equations,

Krylov subspace methods.

A problem in weak formulation

Let us introduce Galerkin's method with an abstract problem posed as a weak formulation on a Hilbert space V , namely,

find u ∈ V such that for all v ∈ V , a ( u , v ) = f ( v ) .

Here, a ( ⋅ , ⋅ ) is a bilinear form (the exact requirements on a ( ⋅ , ⋅ ) will be specified later) and f is a bounded linear functional on V .

Galerkin Dimension Reduction

Choose a subspace V n ⊂ V of dimension n and solve the projected problem:

Find u n ∈ V n such that for all v n ∈ V n , a ( u n , v n ) = f ( v n ) .

We call this the Galerkin equation. Notice that the equation has remained unchanged and only the spaces have changed. Reducing the problem to a finite-dimensional vector subspace allows us to numerically compute u n as a finite linear combination of the basis vectors in V n .

Galerkin orthogonality

The key property of the Galerkin approach is that the error is orthogonal to the chosen subspaces. Since V n ⊂ V , we can use v n as a test vector in the original equation. Subtracting the two, we get the Galerkin orthogonality relation for the error, ϵ n = u − u n which is the error between the solution of the original problem, u , and the solution of the Galerkin equation, u n

a ( ϵ n , v n ) = a ( u , v n ) − a ( u n , v n ) = f ( v n ) − f ( v n ) = 0.

Matrix form

Since the aim of Galerkin's method is the production of a linear system of equations, we build its matrix form, which can be used to compute the solution by a computer program.

Let e 1 , e 2 , … , e n be a basis for V n . Then, it is sufficient to use these in turn for testing the Galerkin equation, i.e.: find u n ∈ V n such that

a ( u n , e i ) = f ( e i ) i = 1 , … , n .

We expand u n with respect to this basis, u n = ∑ j = 1 n u j e j and insert it into the equation above, to obtain

a ( ∑ j = 1 n u j e j , e i ) = ∑ j = 1 n u j a ( e j , e i ) = f ( e i ) i = 1 , … , n .

This previous equation is actually a linear system of equations A u = f , where

A i j = a ( e j , e i ) , f i = f ( e i ) .

Symmetry of the matrix

Due to the definition of the matrix entries, the matrix of the Galerkin equation is symmetric if and only if the bilinear form a ( ⋅ , ⋅ ) is symmetric.

Analysis of Galerkin methods

Here, we will restrict ourselves to symmetric bilinear forms, that is

a ( u , v ) = a ( v , u ) .

While this is not really a restriction of Galerkin methods, the application of the standard theory becomes much simpler. Furthermore, a Petrov–Galerkin method may be required in the nonsymmetric case.

The analysis of these methods proceeds in two steps. First, we will show that the Galerkin equation is a well-posed problem in the sense of Hadamard and therefore admits a unique solution. In the second step, we study the quality of approximation of the Galerkin solution u n .

The analysis will mostly rest on two properties of the bilinear form, namely

Boundedness: for all u , v ∈ V holds a ( u , v ) ≤ C ∥ u ∥ ∥ v ∥ for some constant C > 0

Ellipticity: for all u ∈ V holds a ( u , u ) ≥ c ∥ u ∥ 2 for some constant c > 0.

By the Lax-Milgram theorem (see weak formulation), these two conditions imply well-posedness of the original problem in weak formulation. All norms in the following sections will be norms for which the above inequalities hold (these norms are often called an energy norm).

Well-posedness of the Galerkin equation

Since V n ⊂ V , boundedness and ellipticity of the bilinear form apply to V n . Therefore, the well-posedness of the Galerkin problem is actually inherited from the well-posedness of the original problem.

Quasi-best approximation (Céa's lemma)

The error u − u n between the original and the Galerkin solution admits the estimate

∥ u − u n ∥ ≤ C c inf v n ∈ V n ∥ u − v n ∥ .

This means, that up to the constant C / c , the Galerkin solution u n is as close to the original solution u as any other vector in V n . In particular, it will be sufficient to study approximation by spaces V n , completely forgetting about the equation being solved.

Proof

Since the proof is very simple and the basic principle behind all Galerkin methods, we include it here: by ellipticity and boundedness of the bilinear form (inequalities) and Galerkin orthogonality (equals sign in the middle), we have for arbitrary v n ∈ V n :

c ∥ u − u n ∥ 2 ≤ a ( u − u n , u − u n ) = a ( u − u n , u − v n ) ≤ C ∥ u − u n ∥ ∥ u − v n ∥ .

Dividing by c ∥ u − u n ∥ and taking the infimum over all possible v n yields the lemma.

References

Galerkin method Wikipedia

(Text) CC BY-SA

Contents