Differential equations |
---|
Scope |
Classification |
Solution |
People |
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:
Examples of Galerkin methods are:
© MMXXIII Rich X Search. We shall prevail. All rights reserved. Rich X Search