Galerkin method
Summary
The Galerkin method approximates the solution of a problem in weak form, for all in a Hilbert space. It solves the same problem on a finite-dimensional subspace. This turns a partial differential equation into a finite system of linear equations. For a bounded and coercive form, the Lax–Milgram theorem gives existence and uniqueness of the approximation. Its error is within a fixed factor of the best possible approximation from the subspace. The finite element method and spectral methods are Galerkin methods, and Galerkin approximations are also used to prove existence of weak solutions.
Where this leads
12 pages build on this one.
Further reading
About this page
| Tag | Y5B0PEBKE8 |
|---|---|
| URI | m2://Y5B0PEBKE8 |
| Kind | concept |
| Writing | W0 stub |
| MSC | 65N30, 35A15 |
| Same as |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- 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
Used by
- hp-FEM
- Meshfree methods
- Extended finite element method
- Céa's lemma
- Spectral element method
- Finite element method
- Mixed finite element method
- Stiffness matrix
- Discontinuous Galerkin method
- Spectral method
- Petrov–Galerkin method
- Isogeometric analysis