Galerkin Method Fem. Let u be the solution of u00 u f in 0 1 u 0 u 1 0 1 1 and suppose that we want to find a computable approximation to u of. In mathematics in the area of numerical analysis galerkin methods are a class of methods for converting a continuous operator problem to a discrete problem.
Let u be the solution of u00 u f in 0 1 u 0 u 1 0 1 1 and suppose that we want to find a computable approximation to u of. Typically one then applies some constraints on the function space to characterize the space with a finite set of basis functions. In principle it is the equivalent of applying the method of variation of parameters to a function space by converting the equation to a weak formulation.
3 the galerkin scheme is essentially a method of undetermined coefficients.
Galerkin approximations 1 1 a simple example in this section we introduce the idea of galerkin approximations by consid ering a simple 1 d boundary value problem. The galerkin fem for the solution of a differential equation consists of the following steps. The approach is usually credited to boris galerkin. 1 multiply the differential equation by a weight function x and form the integral over the whole domain 2 if necessary integrate by parts to reduce the order of the highest order term x1x2 n1n2.
