On the zero-boundary Sobolev space with norm , assume measurable coefficients and . The Poincaré inequality and Cauchy-Schwarz inequality give , while nonnegativity of gives . Thus the form is a bounded bilinear form and a coercive bilinear form. For a source in , the Lax-Milgram theorem yields a unique weak solution and every conforming Galerkin method approximation. No derivative of the bounded coefficient is needed for this weak formulation.
For periodic , the conforming Galerkin method has , with mass matrix and . Integration by parts and periodicity give . Therefore
The conserved quantity is the squared L2 norm of the finite element function. On a uniform one-dimensional mesh of spacing , the piecewise-linear hat functions give , , and .
Finite element method Created 2026-09-28 Updated 2026-10-14
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 be a real Hilbert space, a bounded coercive bilinear form, and a bounded linear functional. Given a conforming finite element space , the continuous and discrete problems are
Writing in a basis of gives the linear system
Here is the stiffness matrix and 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.
Consider the Poisson equation on an interval with homogeneous Dirichlet boundary conditions:
Two integrations and the endpoint conditions give the exact solution . To approximate it, multiply by a test function that vanishes at both endpoints. Integration by parts gives
The boundary term is zero. Thus the weak formulation is to find such that
The zero-trace Sobolev space consists of square-integrable functions with square-integrable weak derivatives and zero endpoint values in their continuous representatives; it does not require a classical second derivative. This is why continuous piecewise linear functions are admissible despite corners. The Poincaré inequality makes a coercive bilinear form on . Strang derives this one-dimensional weak formulation, the piecewise-linear hat functions, and their load and derivative-product integrals in the cited lecture; its endpoint example uses a free left endpoint, while both endpoints here are fixed.[ref]
Take the uniform finite element mesh , , with . The continuous trial space is
Here means polynomials of degree at most one on each interval. This is a conforming finite element space in , with interior piecewise-linear hat functions as a basis. Their endpoint values enforce the Dirichlet boundary conditions automatically. Set and test the weak formulation against each :
Each interior hat has two slopes and , each over a length . Its squared derivative therefore integrates to . Adjacent hats have opposite slopes on their one shared interval, giving . All other derivative products vanish. The stiffness matrix is the tridiagonal matrix
The load is the area of a triangle of base and height one, including hats next to the boundary. Boundary hats are omitted because the boundary values are prescribed. The piecewise-linear hat function article explains how the same entries arise by adding local two-node contributions.
With four mesh intervals, , there are three unknowns:
For example, the first row gives and the middle gives . The coefficients are the nodal values . At , linear interpolation gives , whereas : exactness at the nodes still leaves a visible error between them.
In this model the Galerkin method solution equals the nodal approximation obtained by linear interpolation on any finite element mesh. Indeed, on each interval , is the average of and is constant. Therefore . Summing proves Galerkin orthogonality for , and uniqueness gives . This argument relies on the constant diffusion coefficient, conformity and exact integration; nodal exactness is not a general promise for finite element methods with other operators or integration rules.
On a uniform mesh, direct subtraction of the chord from the parabola gives, on every element of length ,
The largest value error is at an element midpoint. Its size and the energy norm error are exactly
Thus gives and . With eight elements, , these become and . Halving the mesh spacing quarters the maximum value error but only halves the energy norm error: values and slopes converge at different rates. The figure shows the small value error at its own scale, where the four-to-one reduction becomes clear.
Figure 1.
Exact Poisson parabola and continuous piecewise-linear finite element solutions on four and eight intervals, with midpoint errors shown separately
. Details.
A Galerkin method retaining one stream function mode, two temperature modes and two transverse-velocity modes produces five coupled amplitudes. A useful normalization gives , , , , . Here is the Prandtl number, , and measures squared rotation. The trivial equilibrium point has characteristic polynomial in its three coupled linear modes; the remaining two modes decay. Stationary bifurcations and oscillatory onset meet at , when .
A Galerkin method approximation can retain one roll streamfunction mode, two temperature modes and two magnetic-flux perturbation modes in vertical-field magnetoconvection. Projection onto these five modes, rather than pointwise equality of the truncated fields, gives a closed system of five ordinary differential equations. Products generate higher spatial harmonics that are discarded by orthogonal projection. The system has symmetry and hence admits paired steady roll branches.
Galerkin orthogonality Created 2026-09-28 Updated 2026-10-14
Let be a conforming finite element space. Suppose the exact solution satisfies for every and its Galerkin method approximation satisfies for every , using the same bilinear form and linear functional. Subtracting the two identities gives Galerkin orthogonality:
This identity itself does not require symmetry. Its interpretation as an orthogonal projection in an energy norm does require a bounded symmetric coercive bilinear form: then is an inner product, is perpendicular to every available discrete correction, and
Consequently is the unique closest point in in the energy norm. This Pythagorean theorem in a function space explains the beauty of the Galerkin method: integrated local equations compute a global best approximation. The Céa lemma supplies the corresponding estimate in a chosen reference norm.
For the finite element solution of the one-dimensional Poisson equation, and . Testing the error against the th piecewise-linear hat function on a uniform mesh gives
In this model vanishes at every node, so each of these integrals is individually zero, although is positive inside every element. Galerkin orthogonality controls the derivative-weighted balance; it does not say that the pointwise error vanishes.
The exact identity assumes conformity and exact evaluation of the continuous forms, including any numerical integration that is used. If assembly instead uses and , subtraction gives the consistency defect
Thus inexact numerical integration need not preserve the projection. In the Petrov-Galerkin method the error is tested against a different test space, and for a nonsymmetric bilinear form the displayed identity need not describe perpendicularity in any energy norm.
A five-mode Galerkin method model retains the roll velocity , its correlated temperature and concentration modes , and the mean-profile distortions . Its parameters include the Prandtl number , diffusivity ratio , thermal forcing , stabilizing solutal forcing , and a positive geometric decay ratio . The velocity equation is , while the scalar equations are , , and . The solutal forcing is normalized using the thermal diffusion scale, so its steady stabilizing effect is .
Use the Galerkin method, rather than pointwise equality: products generate harmonics outside the retained five-dimensional space. Put , , and denote the five prefactors by
The retained streamfunction is , the retained temperature perturbation is , and the retained magnetic-flux perturbation is . These satisfy all the stated boundary conditions. Let , the streamfunction advection bracket. Orthogonality of the sine and cosine modes gives the following coefficients of the retained harmonics:
For example the contribution to the temperature bracket is . The magnetic bracket follows by writing : and . These identities exhibit both the retained terms and discarded harmonics.
Before rescaling time, the projected coefficient equations are
Substitute the prefactors and divide time derivatives by . With , and , the resulting five-mode vertical-field magnetoconvection equations are
Here primes denote differentiation in . The factor is , which checks the magnetic nonlinear sign. There is a terminology qualification in the source: on this thermal diffusion time scale, its is the magnetic-to-thermal diffusivity ratio . The conventional magnetic Prandtl number is , where is the Prandtl number. The displayed equations and subsequent calculation use the source's unchanged.
Use the Galerkin method: substitute the retained trigonometric modes and project onto them with the inner product over the rectangle. Each mode satisfies the printed boundary conditions. Write , , and abbreviate the four mode prefactors by , , and . The Jacobian determinant in the advection terms is .
The stream function is a single Laplacian eigenfunction, so and exactly. For the temperature modes, direct multiplication gives
For the transverse-velocity modes, the retained products are
For example, and supply the signs of the two retained and couplings. The third harmonics are orthogonal to the retained modes and are discarded by this Galerkin method; they are not claimed to vanish in the full partial differential equations.
Before changing time, the five coefficient equations are
Dividing by gives the stated five-mode rotating-convection truncation, with
The squared rotation parameter is . The printed is proportional to rotation rate, so it is a square-root-type rotation parameter rather than the more usual Taylor number proportional to squared rotation rate; the algebra uses the coefficient as printed. At zero rotation the physical transverse velocity modes vanish; the normalized equations can still be understood through their continuous zero-rotation limit.
The truncated fields must be interpreted as a Galerkin method approximation: project each equation onto its retained spatial modes and discard orthogonal higher harmonics. They are not an exact pointwise solution of the full partial differential equations, because the nonlinear terms generate additional harmonics. Write , , and abbreviate the printed normalizations by
Then , , and . All five amplitudes a,b,c,d,e depend on . Use the spatial Jacobian determinant and the inner product over the stated rectangle. Orthogonality of the trigonometric modes makes projection equivalent to retaining their coefficients. In particular, , so .
For the temperature equation, direct products give
The other temperature contribution is . Since , its retained component is . Thus the projected temperature equation is
Here the dot denotes . Since and , these equations give and .
Similarly, the two magnetic-advection products are
while has retained component . The projected induction equation is therefore
Using and gives and .
It remains to project the Lorentz force in the vorticity equation. The linear term is . The nonlinear cross term is
The Jacobian on the right is . Its retained component is , so the total retained magnetic term is
Meanwhile the projected acceleration, viscous term and temperature forcing have coefficients , , and . Divide the projected vorticity equation by to obtain , using and . This derives the complete five-mode vertical-field magnetoconvection system:
The Rayleigh number, Chandrasekhar number, Prandtl number and magnetic-to-thermal diffusivity ratio enter through r,q, and respectively.
Linearization at the zero-amplitude state leaves c and e with negative rates and , while a,b,d have coefficient matrix
A zero eigenvector satisfies , and . Thus the stationary threshold is . The reversal symmetry makes the nontrivial steady states occur as a pair.
For these nonzero steady states put . The temperature equations give and , so and . The induction equations give and . With , their solution is
Here gives , and positive diffusivity gives . Substituting these amplitudes into the stationary a equation and dividing by a yields the stationary branch of five-mode magnetoconvection:
At this meets . Expansion in gives
The denominator of its initial slope is positive, and its numerator after multiplication by is
Therefore gives a supercritical pitchfork bifurcation direction, and gives a subcritical pitchfork bifurcation direction. If , the leading slope vanishes and higher terms must be retained.
This classification describes which side of the stationary threshold contains the steady branch. It does not alone establish dynamical stability or rule out an earlier oscillatory instability. For example, at the characteristic polynomial factors as
The zero eigenvalue is simple unless the final coefficient vanishes; the other two eigenvalues need not both be stable for every positive parameter choice. The stationary branch formula and its direction criterion remain the requested algebraic conclusions.
Let be a real Hilbert space, a bounded bilinear form, and a bounded linear functional. Assume constants , satisfy
The second hypothesis says that is a coercive bilinear form. The Lax-Milgram theorem then supplies a unique weak solution with for every , and .
For a finite-dimensional trial linear subspace , the same boundedness and coercivity constants apply to the restricted form. Since a finite-dimensional subspace is closed, is itself a Hilbert space. Thus there is a unique Galerkin method solution satisfying for every . The Galerkin orthogonality gives the Céa lemma:
In particular, approximation by the trial spaces implies numerical convergence. For a complex Hilbert space, replace bilinearity by a sesquilinear form, take antilinear in the test variable, and require .
Use the zero-boundary Sobolev space with . The Poincaré inequality makes this a complete Hilbert space norm. The weak formulation is
Assume are measurable and satisfy the supplied bounds almost everywhere. The Cauchy-Schwarz inequality and Poincaré inequality give
Because and ,
This is the coercive variable-coefficient Dirichlet form. If , then ; more generally one may assume . Some such source regularity is necessary to invoke the theorem. All hypotheses of the Lax-Milgram theorem now hold, with coercivity constant and boundedness constant , giving the unique weak solution and every conforming Galerkin method approximation. This argument does not require a pointwise derivative of .
Choose linearly independent basis functions in the zero-trace Sobolev space, and put . A concrete conforming Galerkin method uses continuous piecewise-linear hat functions on an interval mesh, with zero endpoint values. Seek satisfying
Testing against each basis function gives
The matrix is symmetric, and for a nonzero coefficient vector , its represented function is nonzero by basis independence. The coercivity estimate gives . Thus is a positive-definite matrix, the finite-dimensional problem has a unique solution, and it minimizes the same energy over . This is Ritz-Galerkin equivalence for a symmetric coercive form.
Subtracting the continuous and discrete equations proves Galerkin orthogonality: for all . Let . For any comparison , orthogonality and the Cauchy-Schwarz inequality in this inner product give
Therefore
With , the same argument in the derivative norm gives the Céa lemma estimate .
Convergence now follows from approximation, not from a bare assertion that the residual is small. The defining density of smooth compactly supported functions in lets one approximate by such a smooth function. Its piecewise-linear interpolant has zero endpoints and derivative error tending to zero as the largest mesh interval tends to zero. For a smooth , the derivative on each element is the average of there, and the interval Poincaré inequality bounds its error by the element length times . Density and the boxed best-approximation estimate consequently give in , and hence in , without assuming a bounded derivative of . If the stronger regularity is available, the same interpolation estimate gives first-order convergence in the derivative norm.
The Lorenz model of thermosolutal convection is a Galerkin method truncation retaining a roll velocity and the leading temperature and concentration modes. The variable measures the roll velocity; is the temperature mode correlated with the vertical motion, while is the horizontally averaged temperature-profile distortion generated by that motion. The corresponding concentration modes are and . The symbol in this model is a solute amplitude, not the dimensional layer depth. The terms and change the mean scalar profiles; and express advection of the remaining background gradients.
The positive parameters are the Prandtl number , the ratio of solutal diffusivity to thermal diffusivity, and the geometric vertical-mode decay ratio . In the usual fundamental-roll truncation with time normalized to the thermal roll-mode decay rate, ; treating it as an independently specified positive truncation parameter leaves the arguments below unchanged.
The parameter is the destabilizing thermal Rayleigh number divided by the free-slip critical-mode value, and measures stabilizing solutal buoyancy in the same thermal-diffusive normalization. For example, using a positive bottom-to-top stabilizing solute difference and density coefficient ,
If a solutal Rayleigh number is instead defined with in its denominator, the coefficient here is times that normalized number. Thermal buoyancy drives the roll; solutal buoyancy opposes it and diffuses at a different rate. This is the essential mechanism of thermosolutal convection.
The finite element method replaces an infinite-dimensional variational problem by a finite-dimensional one, usually using functions that are polynomial on small mesh elements. Ritz method and Galerkin method describe how the discrete equations are selected; neither intrinsically requires piecewise polynomials, though those spaces make assembly local and sparse.
For a concrete realization of the two-point problem, choose homogeneous Dirichlet boundary conditions at both endpoints of . The differential expression alone is not a complete boundary value problem, so this boundary choice is an explicit assumption. Let with , with , and . Use the zero-boundary Sobolev space with norm . By the Poincaré inequality this is equivalent to its full first-order Sobolev norm. Multiplying by a test function and applying integration by parts gives
The endpoint terms vanish by the essential boundary condition. The form is a symmetric bilinear form, bounded by
and it is a coercive bilinear form:
The load is a bounded linear functional. The Lax-Milgram theorem gives a unique weak solution and a bound . Under the stated coefficient regularity it solves the differential equation in the usual weak sense.
The Ritz method minimizes the energy
over , or over a conforming finite-dimensional subspace . Its first variation is ; symmetry and coercivity make the functional strictly convex. In fact, if is the weak solution,
Thus the energy minimizer is exactly the weak solution. The Galerkin method instead directly asks for with for all . For this symmetric coercive problem, Ritz-Galerkin equivalence for a symmetric coercive form shows that the discrete minimizer and Galerkin solution coincide. For a nonsymmetric problem, a Galerkin formulation can still apply but the same quadratic minimization generally cannot represent its full bilinear form; appropriate coercivity or inf-sup conditions must then justify the chosen spaces.
Subtract the continuous and discrete weak equations to obtain Galerkin orthogonality . Since defines the energy norm , the Pythagorean identity gives
In a general reference norm, the Céa lemma yields
The proof uses together with coercivity and continuity. Dense approximation spaces therefore imply convergence; the estimate reduces a numerical error problem to an approximation problem.
For implementation, partition the interval by nodes . Choose continuous piecewise-linear functions and the interior piecewise-linear hat functions as a basis, with the two boundary coefficients prescribed. Write . The coefficients satisfy
The stiffness matrix is symmetric positive definite: for nonzero interior coefficients. The local supports make it tridiagonal in this one-dimensional linear-element case.
On an element of length , for constant element coefficients , the two-node matrix and constant-load vector are
For variable coefficients, integrate against the same shape functions rather than silently replacing them by constants. Element contributions are added at shared nodes, and boundary values are eliminated or lifted into the right side. A sparse direct solve or a suitable iterative method gives the nodal coefficients. Numerical quadrature should preserve the required accuracy and, with positive coefficients and weights, the positive energy structure.
A finite element interpolation estimate gives for these elements, where is the largest element size and the solution has the stated regularity. The Céa lemma then gives first-order energy error. If the dual elliptic problem has regularity, the Aubin–Nitsche duality argument gives second-order error: for , solve , then use to gain one further factor of . Higher-order elements improve rates when the solution is sufficiently smooth.
Nonzero Dirichlet data are handled by a boundary lifting and an affine trial space. Neumann boundary conditions enter naturally through the integrated boundary term; Robin terms modify both the form and the load. With pure Neumann conditions and , constants lie in the kernel: existence needs the load/flux compatibility condition, uniqueness needs a mean constraint, and the preceding Dirichlet coercivity argument cannot simply be reused. Conforming approximation, boundary conditions and coercivity are the ingredients connecting the finite-element construction to a justified Ritz or Galerkin solution.