Galerkin Method
Galerkin Method for Finite-Dimensional Approximation · Also known as: Bubnoff-Galerkin, weighted residual method, projection method
The Galerkin Method is a projection-based variational technique for solving differential equations by reducing infinite-dimensional problems to finite-dimensional linear systems. Developed by Boris Galerkin in 1915 and independently by Ivan Bubnoff, it underpins the Finite Element Method (FEM) and is foundational to modern computational engineering.
Read the full method
Sign in with a free account to read this section.
Method map
The neighbourhood of related methods — select a node to explore.
When to use it
Use Galerkin for boundary value problems (PDEs with Dirichlet or Neumann conditions), eigenvalue problems, or variational formulations. Ideal when the domain is complex or multiple materials are present; FEM (a Galerkin variant) is the industrial standard. Less suited for unbounded domains without special basis functions.
Strengths & limitations
- Systematic error reduction: refining the basis guaranteed decreases approximation error
- Works for general PDEs, including nonlinear ones with suitable discretization
- Projecting onto test space ensures optimal approximation in the appropriate norm
- Forms the theoretical foundation for FEM; widely implemented in production software
- Choosing appropriate basis functions requires domain knowledge; poor choices lead to ill-conditioned matrices
- Computational cost grows as O(n³) for system size n; large-scale problems need iterative solvers
- Integration of basis function products can be expensive; high-order elements require adaptive quadrature
Frequently asked
What is the Galerkin condition and why is it important?
The Galerkin condition states that test functions equal basis functions. This orthogonality ensures the residual is perpendicular to the approximation space, yielding an optimal projection and symmetric system matrices for symmetric problems—crucial for stability and efficiency.
How does Galerkin differ from Petrov-Galerkin?
In standard Galerkin, test and basis spaces are identical. Petrov-Galerkin uses different test and basis spaces, offering flexibility for non-symmetric problems (e.g., convection-dominated flows). This trades optimality for robustness.
What basis functions should I use?
For smooth problems, polynomial bases (piecewise linear/quadratic) work well. For oscillatory solutions, trigonometric bases (Fourier) are natural. Spectral elements use high-order polynomials on larger domains; FEM uses low-order polynomials on many small elements. Problem physics guides the choice.
How do I estimate error after solving?
A posteriori error estimates use residuals: e ≤ C ||r||_L², where r is the residual. Alternatively, solve twice with different refinements and compare; convergence rate tells you if error is decreasing as expected.
Sources
- Galerkin, B. G. (1915). Elastic plates and shells. Proceedings of Higher Technical School, Moscow. link ↗
- Bubnoff, I. G. (1913). The application of the method of integral equations to the solutions of problems of elastic equilibrium of shells. Izvestiya Rossiiskoi Akademii Nauk, 4, 1311–1330. link ↗
- Reddy, J. N. (1993). An Introduction to the Finite Element Method (2nd ed.). McGraw-Hill. ISBN: 0070513554
How to cite this page
ScholarGate. (2026, June 3). Galerkin Method for Finite-Dimensional Approximation. ScholarGate. https://scholargate.app/en/numerical-methods/galerkin-method
Which method?
Set this method beside its closest kin and read them side by side — the library lays the books on the table; the choice is yours.
- Spectral MethodsNumerical Methods↔ compare