# Galerkin method

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

method of moments

A method for finding the approximate solution of an operator equation in the form of a linear combination of the elements of a given linearly independent system.

Let be a non-linear operator, with domain of definition in a Banach space and range of values in a Banach space . To solve the equation (1)

by the Galerkin method one chooses a linearly independent system of elements from (a coordinate system) and a linearly independent system of functionals from the space dual to (a projection system). An approximate solution of equation (1) is sought for in the form (2)

The numerical coefficients are found from the system of equations (3)

When the problem is posed in this general manner, (3) need not have any solutions. If (3) has a unique solution, for each the approximate solution (2) need not converge, not even weakly, to the exact solution of equation (1) as . Nevertheless, Galerkin's method is a powerful tool not only for finding approximate solutions, but also for proving existence theorems of solutions of linear and non-linear equations, especially so in problems involving partial differential equations.

In many cases the problem of determining the coefficients of (2) from the system (3) is equivalent to that of finding the minimum of some functional, and Galerkin's method becomes a variational (energy) method. The most important such method is the Ritz method. In certain cases it may be expedient to use topological methods in the investigation of (3).

If and are Hilbert spaces, Galerkin's method is sometimes called the Petrov–Galerkin method. If, in addition, the coordinate and the projection systems are identical ( and ), one usually speaks of the Bubnov–Galerkin method. If is a Hilbert space, and also , this special case is known as the method of least squares (cf. Least squares, method of).

In the linear case, when , with a linear, generally unbounded, operator with domain and range , while the coordinate system has been selected in , equation (1) assumes the form (4)

Here, (3) is a system of linear equations in unknowns: (5)

If, under the conditions of the method of least squares, there exists a bounded inverse operator on , if and if the system is complete in , then the approximate solution of (2) converges as to the exact solution of equation (4). If under the conditions of the Petrov–Galerkin method the operator is symmetric and positive definite, and if the system is complete in the Hilbert space (the completion of in the metric generated by the scalar product then the approximate solution of (2) converges to the exact solution of (4) both in and in .

If is a positive-definite self-adjoint operator on and if is a complete orthonormal system of its eigen elements, then the Bubnov–Galerkin method and the method of least squares coincide with the Fourier method.

Galerkin's method is also employed in the approximate solution of eigen value and eigen element problems.

Galerkin's method has found widespread use after the studies of B.G. Galerkin ; it was formerly used by I.G. Bubnov in solving specific problems in elasticity theory. There is a general approach to approximate methods, which includes projection methods, finite-difference methods (cf. Projection methods; Difference methods) and other approximate methods which are generalizations of Galerkin's method.

How to Cite This Entry:
Galerkin method. Encyclopedia of Mathematics. URL: http://encyclopediaofmath.org/index.php?title=Galerkin_method&oldid=16286
This article was adapted from an original article by V.A. Trenogin (originator), which appeared in Encyclopedia of Mathematics - ISBN 1402006098. See original article