Use the ordered displacement vector , and define by . For an unstretched spring, the extension to first order is the dot product of the relative displacement with its equilibrium unit vector. Summing its squared extensions gives the central spring stiffness matrix. The four side springs and two diagonal springs give
Therefore
The kinetic energy is , so a normal mode satisfies . Keeping the factor in the definition of fixes the normalization of and the resulting frequencies.
Figure 1.
Rigid rotation, breathing and modes with reflection symmetry
. Original displacement diagrams. Grey lines show all six equilibrium springs; arrows show representative mode vectors. The rotation has zero frequency, the breathing mode has squared frequency 4k/m, and the two other modes have squared frequency 2k/m. Details.
Write the symmetry group of a square as , with a counterclockwise quarter-turn and reflection across the horizontal axis. The conjugacy classes of the symmetry group of a square are
Here is the half-turn and the clockwise quarter-turn. The two members of the fourth class reflect across the horizontal and vertical axes. Those of the fifth reflect across and . The identity and half-turn are central elements, giving singleton classes. The relations , , and show that each displayed pair consists of conjugate elements. More generally, conjugating by changes to , and conjugating by changes to ; parity is preserved, so the two reflection pairs cannot merge.
In a one-dimensional representation, the relation forces the image of to equal its inverse. Thus and can be assigned independent signs . These four choices give four irreducible characters. The ordinary two-dimensional action on the plane gives one more character: a rotation through has trace , and a reflection has trace zero. Therefore the character table of the symmetry group of a square is
For instance the last row has squared character norm , so the planar representation is irreducible; its inner product with each one-dimensional row is zero. All five rows obey character orthogonality. Their squared dimensions sum to , so they exhaust the irreducible representations of this order-eight group.
If for a Hermitian matrix and a nonzero eigenvector, then . The scalar on the left equals its complex conjugate because , while . Thus is real. If also , then
Consequently distinct eigenvalues force , proving orthogonality of their eigenvectors.
For a unitary matrix, preserves the norm induced by the standard Hermitian inner product. If with , then , so .
A normal mode is a fixed displacement pattern whose components share a common harmonic time dependence in the equations for small oscillations. Its normal frequency is the associated oscillation frequency; below, denotes the angular frequency, so the frequency in cycles per unit time is . A normal coordinate is the amplitude of one such pattern, chosen so that the linear equations decouple. For mass matrix and stiffness matrix , the patterns solve . Zero eigenvalues describe free rigid motions rather than periodic restoring oscillations.
For a piecewise continuous function of exponential order on , its unilateral Laplace transform is
The Bromwich inversion formula, at a point of continuity, is
The Bromwich contour is a straight vertical line, traversed upwards, with to the right of the abscissa of convergence and hence of all singularities of the transform. Under the usual piecewise smoothness assumptions, at a jump the symmetric inversion limit gives the mean of the two one-sided values.
In the transform in the question, put . Then and
Thus the restricted Mellin transform on the unit interval is the Laplace transform of . Apply the Bromwich inversion formula with , where , to obtain
Here lies in the convergence half-plane of . At a discontinuity this formula has the same mean-value interpretation. The real natural logarithm defines unambiguously.
Commuting inverse. Assume is invertible, as required by the displayed inverse. Multiplication gives
Multiply on both sides by to obtain
More generally, a matrix commuting with an invertible matrix also commutes with its inverse.
Orthogonality. For a real skew-symmetric matrix , . If for a real vector , multiply by to obtain . Thus is invertible; the same argument applies to . For the Cayley transform of a real skew-symmetric matrix,
The factors commute by the first result, so
Therefore
Eigenvector mapping. If , then . Consequently
The denominator cannot vanish. In fact the eigenvalues of a real skew-symmetric matrix are purely imaginary: is the negative of its complex conjugate, so . For the corresponding eigenvalue of is , consistent with orthogonality.
Spectrum in three dimensions. Let be any real three-by-three orthogonal matrix. For a complex eigenvector , implies . A real cubic characteristic polynomial has a real root, necessarily or . Any nonreal roots form a complex-conjugate pair of unit modulus. If all three roots are real, two of the three signs agree and can be grouped as a pair with angle zero or . Thus in every case the eigenvalues can be written
Their product is .
Determinant and fixed axis for the Cayley transform. Since ,
so . This determinant argument works in every dimension. In dimension three the preceding spectrum result then guarantees an eigenvector with . Set . The fixed-vector equation says , so and . Hence
This is the axis fixed by the three-dimensional rotation. Equivalently, a real odd-dimensional skew-symmetric matrix has zero determinant, because .
Local errors of the Euler schemes. Let , and evaluate and its partial derivatives at an exact starting point . Define
The exact Taylor expansion is . The forward Euler method retains only , so its one-step defect, exact minus computed value, is
For the Backward Euler method, substitution of the exact solution into the scheme gives the residual
because . Under local smoothness, solving the implicit step changes this residual by a factor , so the one-step defect has the same leading term:
These are unnormalized local truncation errors, as in the question. A convention dividing by instead gives . Both schemes have first-order global error under the usual smoothness and stability hypotheses.
Euler stability. For the Dahlquist test equation , put , with . The numerical amplification factors are
Strict decay requires ; the boundary gives bounded but generally nondecaying values. For Forward Euler method,
For positive real , this reduces to . The absolute stability region in the plane is the disk . For Backward Euler method, whenever , so it decays for every step size. It is A-stable and also L-stable, since for large in this half-plane. Here has the opposite sign from the alternative convention for .
Predictor-corrector accuracy. The printed two-stage construction is Heun's method, equivalently
Although the second stage resembles a Backward Euler method evaluation, it uses the predicted value, so the combined method is explicit. Expand that stage around the exact starting point, putting
Then
and the numerical step is . Along the exact solution, , so comparison with the exact Taylor expansion gives
Thus the local defect improves by one power of , giving second-order global error under the usual hypotheses. For the linear test equation the defect reduces to .
Predictor-corrector stability. Applied to the test equation, the predictor is and the second value is . Their average gives
For real positive , , so strict decay holds exactly for , the same real-axis step bound as Forward Euler method. For complex the precise condition is
The region is bounded and does not contain the full right half-plane: for example gives . It is therefore not A-stable. Its imaginary-axis values satisfy for . Better accuracy has not inherited the unconditional stability of an actual implicit Backward Euler method step.
Figure 1.
Absolute stability regions of the three time-stepping methods in the exam
. Shading shows amplification factor of modulus at most one, using z equal to step size times Lambda for y prime equal to minus Lambda y. Positive real z therefore represents physical decay; Heun improves accuracy but retains a bounded stability region. Details.

Pinned article: Introduction to the OurBigBook Project

Welcome to the OurBigBook Project! Our goal is to create the perfect publishing platform for STEM subjects, and get university-level students to write the best free STEM tutorials ever.
Everyone is welcome to create an account and play with the site: ourbigbook.com/go/register. We belive that students themselves can write amazing tutorials, but teachers are welcome too. You can write about anything you want, it doesn't have to be STEM or even educational. Silly test content is very welcome and you won't be penalized in any way. Just keep it legal!
We have two killer features:
  1. topics: topics group articles by different users with the same title, e.g. here is the topic for the "Fundamental Theorem of Calculus" ourbigbook.com/go/topic/fundamental-theorem-of-calculus
    Articles of different users are sorted by upvote within each article page. This feature is a bit like:
    • a Wikipedia where each user can have their own version of each article
    • a Q&A website like Stack Overflow, where multiple people can give their views on a given topic, and the best ones are sorted by upvote. Except you don't need to wait for someone to ask first, and any topic goes, no matter how narrow or broad
    This feature makes it possible for readers to find better explanations of any topic created by other writers. And it allows writers to create an explanation in a place that readers might actually find it.
    Figure 1.
    Screenshot of the "Derivative" topic page
    . View it live at: ourbigbook.com/go/topic/derivative
  2. local editing: you can store all your personal knowledge base content locally in a plaintext markup format that can be edited locally and published either:
    This way you can be sure that even if OurBigBook.com were to go down one day (which we have no plans to do as it is quite cheap to host!), your content will still be perfectly readable as a static site.
    Figure 5. . You can also edit articles on the Web editor without installing anything locally.
    Video 3.
    Edit locally and publish demo
    . Source. This shows editing OurBigBook Markup and publishing it using the Visual Studio Code extension.
  3. https://raw.githubusercontent.com/ourbigbook/ourbigbook-media/master/feature/x/hilbert-space-arrow.png
  4. Infinitely deep tables of contents:
    Figure 6.
    Dynamic article tree with infinitely deep table of contents
    .
    Descendant pages can also show up as toplevel e.g.: ourbigbook.com/cirosantilli/chordate-subclade
All our software is open source and hosted at: github.com/ourbigbook/ourbigbook
Further documentation can be found at: docs.ourbigbook.com
Feel free to reach our to us for any help or suggestions: docs.ourbigbook.com/#contact