Metraipolis › archive › dc_7da571c5b25d

Galerkin method — Wikipedia (en)

Source
Wikipedia (en)
Original
https://en.wikipedia.org/wiki/Galerkin_method
License (as archived)
CC-BY-SA-4.0
Archived
2026-10-07T11:27:35.752Z
SHA-256 of the archived text
6c691ac2b17839604bf427292731e2fb98b40f9db02c6545afb1cd094188a228
Stable URL of this page
https://metraipolis.com/documento/dc_7da571c5b25d

How to cite

Galerkin method — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Galerkin_method (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_7da571c5b25d (Metraipolis archive dc_7da571c5b25d, sha256 6c691ac2b17839604bf427292731e2fb98b40f9db02c6545afb1cd094188a228)
BibTeX
@misc{dc7da571c5b25d,
  title = {Galerkin method — Wikipedia (en)},
  howpublished = {Wikipedia (en)},
  url = {https://en.wikipedia.org/wiki/Galerkin_method},
  note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_7da571c5b25d; sha256 6c691ac2b17839604bf427292731e2fb98b40f9db02c6545afb1cd094188a228},
  year = {2026}
}

Archived text

Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Galerkin_method. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

In mathematics, in the area of numerical analysis, Galerkin methods are a family of methods for converting a continuous operator problem, such as a differential equation, commonly in a weak formulation, to a discrete problem by applying linear constraints determined by finite sets of basis functions. They are named after the Soviet mathematician Boris Galerkin. Often when referring to a Galerkin method, one also gives the name along with typical assumptions and approximation methods used: Ritz–Galerkin method (after Walther Ritz) typically assumes symmetric and positive-definite bilinear form in the weak formulation, where the differential equation for a physical system can be formulated via minimization of a quadratic function representing the system energy and the approximate solution is a linear combination of the given set of the basis functions. Bubnov–Galerkin method (after Ivan Bubnov) does not require the bilinear form to be symmetric and substitutes the energy minimization with orthogonality constraints determined by the same basis functions that are used to approximate the solution. In an operator formulation of the differential equation, Bubnov–Galerkin method can be viewed as applying an orthogonal projection to the operator. Petrov–Galerkin method (after Georgii I. Petrov) allows using basis functions for orthogonality constraints (called test basis functions) that are different from the basis functions used to approximate the solution. Petrov–Galerkin method can be viewed as an extension of Bubnov–Galerkin method, applying a projection that is not necessarily orthogonal in the operator formulation of the differential equation. 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.

Tema degli esploratori: matematica e informatica teorica (deposito sistematico; categoria «Numerical analysis»).
Fonte: Wikipedia in inglese, voce «Galerkin method» — https://en.wikipedia.org/wiki/Galerkin_method
Wikidata Q1491980 (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q1491980
Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Galerkin_method?action=history).
Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza.
Estratto dell'introduzione non modificato nel contenuto; revisione 1351102126, consultata il 2026-10-07T11:16:51.759Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: a3be0e66b7a0feb712be8c14c158ae69e7d70038e10290be958f59519fd625c8