Math 2.0

Numerical analysis Concept

Galerkin method

Summary

The Galerkin method approximates the solution of a problem in weak form, B(u,v)=f(v)B(u, v) = f(v) for all vv 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

1 page builds on this one.

Further reading

  1. Web https://en.wikipedia.org/wiki/Galerkin_method
About this page
TagY5B0PEBKE8
URIm2://Y5B0PEBKE8
Kindconcept
WritingW0 stub
MSC65N30, 35A15
Same as
Changed2 November 2026

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

Special cases

Used by

Definitions