A bilinear square finite element uses polynomials of degree at most one separately in each coordinate and takes values at the four corners as degrees of freedom. On the unit square its nodal shape functions are , , , and , in anticlockwise corner order. Each is a tensor product of one-dimensional linear shape functions. A function in this space need not be affine, since has total degree two. On a physical square of side , its Laplacian stiffness matrix has diagonal entries , adjacent-corner entries and opposite-corner entries . Its Robin boundary condition edge matrix has the two-node block for a unit boundary coefficient.
Breathing mode 2026-10-20
A breathing mode is a collective normal mode in which a structure expands and contracts radially while preserving its overall symmetry. For a uniform scaling pattern, the displacement of point is proportional to its position relative to the center of mass, as displayed above. In a central spring framework this pattern is a normal mode only when applying the stiffness matrix returns a multiple of the same pattern with the appropriate mass matrix; radial motion alone does not establish an eigenvector.
For point masses joined by unstretched central springs obeying Hooke's law, let be the equilibrium unit vector along an edge and the small displacement of its endpoint. The leading extension is , so its quadratic elastic potential energy is . Consequently the block stiffness matrix has off-diagonal blocks and diagonal blocks , with absent edges contributing zero. It is symmetric and positive semidefinite. The normal modes solve , where is the mass matrix. Rigid translations and infinitesimal rotations are rigid-motion zero modes of a spring framework. A prestressed spring can add transverse quadratic terms, so the unstretched assumption matters.
Coupled oscillator Created 2026-10-20 Updated 2026-11-05
Coupled oscillators influence one another's motion through shared forces or other interactions. Two pendulums connected by a light spring provide a visible example: moving either bob changes the force on the other. For equal masses and lengths, the symmetric motion leaves the connecting spring unstretched, while the antisymmetric motion stretches it and has a higher frequency.
For a conservative linear system, the equations of motion take the form , where is the mass matrix and the elastic stiffness matrix. A normal mode has a fixed displacement pattern satisfying . Expanding the initial motion in normal modes separates the evolution. Displacing just one pendulum generally excites several normal modes, producing beats and visible transfer of energy. A driving force excites only the modes onto which its spatial pattern has a nonzero projection.
The damped quadratic eigenvalue problem finds exponential motions of a linear mechanical model with mass matrix , damping matrix and stiffness matrix . Substituting into gives
The dependence on is quadratic, so solving the undamped problem alone does not find the damped decay rates and mode shapes.[ref]
A useful linearization sets and rewrites the problem as
This generalized eigenvalue problem has twice the displacement dimension. With invertible , it becomes an ordinary first-order state eigenproblem by multiplication by the block mass inverse. Singular requires more care and cannot be handled by silently using .
For an original one-coordinate example in consistent units, take , and . Then , giving . Real free motions have the form
The decay rate is and damped oscillation frequency is , while the undamped natural frequency is . Increasing to6 instead gives real roots , showing that the quadratic problem also describes nonoscillatory decay.
For real symmetric positive-definite and positive-semidefinite , an oscillatory eigenpair satisfies a useful energy check. Multiply by the conjugate transpose and write , , . The imaginary part of gives when . In a multi-coordinate system, complex eigenvectors can encode relative phase differences between coordinates; nonclassical damping generally prevents replacing them by the undamped real mode shapes.
Damping matrix 2026-11-05
A damping matrix maps generalized velocity to the velocity-dependent resisting-force term in a linear structural dynamics model:
Here is the mass matrix and is the stiffness matrix. The sign convention places on the left, so the actual resisting force is . For pure translational coordinates, entries have units ; mixed rotational and translational coordinates require their corresponding generalized units.
Consider an original two-coordinate model with three viscous dampers: one from each coordinate to a fixed support, and a third between them. With positive coefficients ,
For , the removed mechanical power is
This makes a positive semidefinite matrix. In particular, the connecting damper dissipates nothing when both coordinates move at the same speed. Choosing and in newton-seconds per metre gives . Speeds dissipate15watts, while dissipate20watts.
For symmetric constant , multiplying the equation by gives an energy balance:
The matrix therefore encodes where dissipation occurs and which relative motions activate it.
Rayleigh damping approximates by a weighted combination of the mass and stiffness matrices. OpenSees exposes separate coefficients for mass and different stiffness states, and cautions that this model can give incorrect results in some nonlinear concentrated-plasticity analyses.[ref] A convenient matrix prescription must still represent the intended dissipation mechanism.
Finite element mesh Created 2026-10-05 Updated 2026-10-14
A finite element mesh partitions a domain into simple regions called elements, such as intervals, triangles or tetrahedra. In a conforming partition, distinct element interiors are disjoint, their closures cover the domain closure, and any nonempty intersection is a common face, edge or vertex of both elements. Chen's author notes give this compatibility condition for simplicial meshes.[ref] Local piecewise polynomial functions and local integrals are defined on these regions; compatible degrees of freedom join them into a global conforming finite element space. The assembled stiffness matrix and mass matrix then inherit the local overlap pattern.
For the finite element solution of the one-dimensional Poisson equation, a mesh is simply an ordered list
Nodes are the endpoints; elements are the intervening intervals. Four equal elements have five nodes but only three unknown nodal values after imposing the zero Dirichlet boundary conditions. A nonuniform partition such as has element lengths and , so counting elements alone does not measure the largest unresolved scale.
Refining a finite element mesh replaces some or all elements by smaller ones. For continuous piecewise linear functions in one dimension, retaining all old nodes gives nested conforming finite element spaces when every interval is bisected. The old approximation remains available, and the new interior nodes allow additional changes of slope. With a symmetric coercive bilinear form and exact integration, best approximation from Galerkin orthogonality means that the energy norm error cannot increase under such nested refinement.
For the finite element solution of the one-dimensional Poisson equation, uniform refinement from four to eight elements increases the unknown count from three to seven. The exact formulas give maximum errors and , and energy norm errors approximately and . Refinement near a region of strong curvature can spend unknowns where the linear interpolation error matters most; convergence in a general problem still needs approximation and regularity assumptions such as those in the finite element interpolation estimate.
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.
Finite element solution of the one-dimensional Poisson equation Created 2026-10-14 Updated 2026-10-31
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.
Forward Euler limit for a consistent hat mass matrix Created 2026-10-14 Updated 2026-10-31
For a uniform piecewise-linear Galerkin heat discretization, the consistent mass matrix is and the stiffness matrix is . The generalized eigenvalues are . Applying forward Euler method requires , giving the displayed uniform bound for . For intervals with Dirichlet endpoints the exact finite-grid upper bound is , which approaches . Replacing the consistent mass matrix by a lumped one changes the stability restriction.
For equal rod lengths , upper mass and lower mass , use horizontal displacements , at first order. The quadratic kinetic energy is , while the stiffness matrix is
The generalized eigenvalue problem for small oscillations is , not . In particular the lower Euler-Lagrange equation is , independent of the lower mass factor after division by that mass. This reproduces the normal modes of a double pendulum and distinguishes the mechanical mass matrix from its stiffness matrix.
Mixed-axis trajectory of a prestressed spring pair Created 2026-10-20 Updated 2026-10-25
Two equal masses linked in a line by three identical springs, each stretched to twice its natural length, have longitudinal stiffness matrix and transverse matrix half as large. Equal displacements of both masses select the symmetric modes. Equal longitudinal and transverse release amplitudes produce the title trajectory. It is not closed after one transverse period because the two mode frequencies have irrational ratio . Higher-order geometric terms are neglected in this small-displacement solution.
Nonclassical damping 2026-11-05
Nonclassical damping occurs when a linear mechanical system's damping matrix cannot be diagonalized together with its mass matrix and stiffness matrix by an undamped normal mode transformation. Consequently the damping terms couple the modal equations even though their inertia and stiffness terms are separated. This can matter when a localized dissipative element is attached to a structure whose elastic and inertial responses are distributed differently.[ref]
For , take a complete mass-normalized undamped mode matrix with and . Then gives
With distinct undamped natural frequencies, a nonzero off-diagonal shows modal damping coupling. If a frequency is repeated, first allow a rotation of the modes within its repeated-frequency subspace: an off-diagonal entry in one arbitrary basis is not by itself proof of nonclassical damping. For symmetric with positive definite, the basis-independent condition for classical decoupling is
Failure of this condition establishes nonclassical damping under those assumptions.[ref]
For an original example in consistent normalized units, let
The damping acts only on the first physical coordinate. The undamped mode vectors and give
Thus an initial modal state , has . Dropping the off-diagonal damping terms would incorrectly predict zero initial acceleration in the second modal coordinate. Nevertheless : passive dissipation does not require modal decoupling.
The damped quadratic eigenvalue problem follows from :
In oscillatory cases its complex vectors can encode different phases at different physical coordinates. One can solve the coupled equations directly or use an appropriate damped-mode method; assigning separate scalar decay equations to the undamped modes is an additional approximation, not a consequence of positive dissipation.
Connect every pair among moving scalar coordinates and one fixed coordinate by identical springs of stiffness . The coupling pattern is the complete graph with one vertex fixed. Its potential energy is . The moving-coordinate stiffness matrix is the principal submatrix displayed in the header. For equal masses , the uniform normal mode has squared angular frequency , while every sum-zero vector has squared angular frequency . There are such degenerate modes. This follows directly from the Laplacian spectrum of a complete graph and its rank-one matrix form. Constant gravitational forces shift the equilibrium without changing the stiffness.
For a uniform rigid beam of mass and two identical vertical end springs of stiffness , small vertical end displacements have kinetic energy and displacement-dependent potential energy . The mass and stiffness matrices are and . Their generalized eigenvalue problem gives symmetric translation and antisymmetric rocking at the displayed angular frequencies. The centre coordinate contains only the symmetric mode. Neglect spring inertia, damping and finite-angle geometric corrections.
For two rods of length and mass , one hinged to a fixed point and the other to its free end, use the absolute rod angles from the downward vertical. The small-oscillation mass matrix is and the stiffness matrix is . Their generalized eigenvalue equation gives for . The low-frequency mode has angles of the same sign and the high-frequency mode has opposite signs.
Define the mass matrix and stiffness matrix for . With coefficient vectors , the step system is
The matrices are symmetric, and for nonzero , proving positive definiteness.
For , the first basis function is the full tent at , and the last is the half tent ending at . Integration gives
Since , the requested matrix in this normalization is
Here the matrix symbol is distinct from the printed integer number of time steps.
Write and define the mass matrix and reaction-diffusion stiffness matrix
Then each step is
Both component matrices are symmetric, so is symmetric. For a nonzero coefficient vector , its finite element function is nonzero and
Thus is also positive definite and every update has a unique solution. Because nonneighboring hats have disjoint interior supports, the matrix is tridiagonal in nodal order.
Work in the usual bounded Lipschitz, polygonally triangulated setting in which Sobolev traces and conforming meshes are defined. Choose an lift of the smooth boundary data. Multiplying the Poisson equation by and integrating by parts gives the weak formulation
The test function has zero trace, so the boundary flux term vanishes. This formulation only needs first weak derivatives.
Let be the conforming finite element space of continuous functions affine on each triangle, and its zero-boundary subspace. Choose a nodal interpolation of the boundary lift and seek satisfying the same identity for every . General smooth boundary data need not be exactly representable by boundary piecewise linear functions; this is the usual discrete boundary approximation.
With nodal shape functions , interior coefficients satisfy
Here and index interior and boundary vertices. Finite element assembly sums the triangle contributions.
Take a translated lower triangle with local vertices . Its local functions are , , . Their gradients are constant and the area is , giving the stiffness matrix
Translations preserve this matrix, while rotations or a different local vertex order permute its entries. The coupling across the hypotenuse is zero.
Each interior grid vertex belongs to six triangles. Summation gives diagonal value 4 and coupling to each of its four horizontal and vertical neighbors. Both positive-diagonal edge couplings vanish. Thus, before prescribed boundary values are removed, an interior equation has the five-point stencil
There is no factor in the assembled variational matrix; that factor belongs to a differently normalized finite-difference equation.
Figure 1.
Triangular mesh edges along diagonals have zero stiffness coupling
. Details.
If and , lexicographic ordering makes the Dirichlet-reduced matrix block tridiagonal with diagonal blocks and neighboring blocks . A row with all four neighboring nodes unknown has five nonzeros: 4 once and four times. Rows adjacent to the boundary have fewer unknown-neighbor entries; their exact count is . Removed boundary contributions appear on the right, rather than as new nonzeros.
The first-order Sobolev space is , with derivatives understood as weak derivatives and norm squared .
The printed normal boundary condition must be distinguished from a conormal condition. Take symmetric positive definite, as required for the symmetric matrix requested later. Integration by parts gives
The natural boundary term contains the conormal derivative , not the ordinary normal derivative . On a smooth boundary, writing for its unit tangent, the literal condition leaves the term , where . Its weak form therefore retains a boundary pairing:
Here the tangential derivative of the Sobolev trace can be interpreted in and paired against on a smooth boundary. This form is generally nonsymmetric; the requested usual symmetric energy construction does not follow from the literal boundary condition.
For an explicit failure of the claimed mean-zero compatibility, take the unit disk, and . It has on the circle, but
Thus replacing the printed normal condition by a zero conormal flux is not harmless.
For the intended zero-conormal derivative problem, the requested variational and finite element conclusions are as follows. Seek with
Putting gives . On a connected domain this condition permits a solution unique modulo constants; the Poincare-Wirtinger inequality gives coercivity after fixing the mean.
The energy is . A minimizer satisfies . Conversely, a weak solution satisfies
so it is a minimizer. Testing by gives the minimum value
This value is independent of the arbitrary additive constant when . If the compatibility fails, constant shifts make unbounded below.
Write . The Galerkin method gives
Symmetry of gives . For , . Equality forces constant by positive definiteness and connectedness. Since the basis sums to one, the coefficient vector represents that constant, giving
Thus the stiffness matrix is symmetric positive semidefinite and singular; the displayed compatibility condition is necessary and sufficient for the finite system. Positive definiteness of controls every gradient direction, preventing additional zero-energy directions and supplying ellipticity. A degenerate coefficient can introduce further kernel modes, while an indefinite one destroys the minimizing-energy argument.