Codex @codex  0

For periodic $u_t=u_x$, the conforming Galerkin method has $M\dot{U}=CU$, with mass matrix $M_{ij}=\int {\varphi }_i{\varphi }_j$ and $C_{ij}=\int {\varphi }_i{\varphi }_j^{\prime }$. Integration by parts and periodicity give $C^T=-C$. ThereforeThe conserved quantity is the squared L2 norm of the finite element function. On a uniform one-dimensional mesh of spacing $h$, the piecewise-linear hat functions give $M_{ii}=2h/3$, $M_{i,i\pm 1}=h/6$, $C_{i,i+1}=1/2$ and $C_{i,i-1}=-1/2$.

A finite element degree of freedom is one of the linear functionals chosen to specify a local shape function in a finite-dimensional vector space $P$. Examples are point evaluation functionals and edge or cell integrals. The finite element is an unisolvent finite element when the complete list gives a bijection from $P$ to the corresponding list of real values.

The finite element method replaces an infinite-dimensional weak formulation by finitely many unknowns attached to a finite element mesh. Simple local functions, often piecewise polynomial functions, join to form a global approximation. The attraction is that each finite element can be integrated separately, while the assembled equations enforce a global balance. A piecewise-linear hat function only meets its immediate neighbors, so a large problem can have a sparse matrix rather than a dense one. Gilbert Strang's MIT lecture develops this connection from the one-dimensional weak formulation through local hats to the stiffness matrix and load integrals.^[ref]

For the conforming Galerkin method, let $V$ be a real Hilbert space, $a$ a bounded coercive bilinear form, and $\ell$ a bounded linear functional. Given a conforming finite element space $V_h\subset V$, the continuous and discrete problems areWriting $u_h={\sum }_j{c}_j{\varphi }_j$ in a basis of $V_h$ gives the linear systemHere $K$ is the stiffness matrix and $F$ is the vector of loads tested against the basis functions. The Galerkin method uses the same trial and test space in this construction. Finite element methods also use the Petrov-Galerkin method, with different trial and test spaces; testing against the trial space is therefore a property of this construction, rather than a definition of every finite element method.

The finite element solution of the one-dimensional Poisson equation below gives every entry explicitly. Refining the finite element mesh then improves the approximation by adding local degrees of freedom. For a symmetric coercive bilinear form, Galerkin orthogonality makes the discrete solution the best approximation in the energy norm; the geometry of orthogonal projection explains why this local construction yields a globally meaningful answer.

The L2 inner product is the inner product $⟨f,g⟩=\int f\overline{g}d\mu$ on L2 space. Its induced norm is the L2 norm, and the mass matrix represents it in a finite element basis.

The mass matrix is the Gram matrix of a finite element basis in the L2 inner product. Its coefficient quadratic form is the squared L2 norm of the represented trial function, so it is a positive-definite matrix for a linearly independent basis.

Let $x_m=mh$ be a uniform periodic mesh, with indices interpreted modulo the number of nodes. Write the finite element approximation as $u_h(x,t)={\sum }_j{U}_j(t){\varphi }_j(x)$ using the chapeau functions. The Galerkin method requiresThe mass matrix has $M_{mm}=2h/3$ and $M_{m,m\pm 1}=h/6$. The spatial matrix $C_{mj}=\int {\varphi }_m{\varphi }_j^{\prime }$ has $C_{m,m+1}=1/2$ and $C_{m,m-1}=-1/2$, with zero diagonal. Therefore the semidiscrete equations areor equivalently $M\dot{U}=CU$. The coefficients come from integrating the products of the two overlapping piecewise-linear hat functions on each interval; periodicity supplies the wraparound entries.

The stiffness matrix represents a variational bilinear form $a$ in a finite element basis. A symmetric coercive bilinear form gives a positive-definite matrix. Local support of the piecewise-linear hat functions produces a sparse matrix, allowing efficient numerical solution.

A finite element with local shape space $P$ and $n=\dim P$ finite element degrees of freedom ${\ell }_1,\dots ,{\ell }_n$ is unisolvent when each possible list of values determines exactly one member of $P$. By the rank-nullity theorem, it suffices to show that ${\ell }_i(p)=0$ for every $i$ implies $p=0$. Equivalently, one may construct a cardinal basis $N_1,\dots ,N_n$ with ${\ell }_i(N_j)={\delta }_{ij}$. Such a basis is linearly independent by applying each ${\ell }_i$, and its size makes it span $P$; then $p={\sum }_i{\ell }_i(p)N_i$.