Tutorial 7: Matrix Algebra for Homogeneous Linear Algebraic System
-
The following linear algebraic equations represents the 3 dof mass spring systems below:

Determine the smallest eigenvalue and the corresponding eigenvector for the eigenvalue/ eigenvector problem if , and . Then, draw the eigenvector.
SolutionPut . Substituting the given masses and stiffnesses gives
A nonzero eigenvector requires . Expanding the determinant,
Thus, in ascending order,
For , the first and third rows of give
Substitution also satisfies the second row. Taking gives the smallest mode:
Its eigenspace is ; eigenvectors require . All three masses move in phase, with the middle mass having the largest amplitude.

-
Continue from Q1, determine the second largest eigenvalue and the corresponding normalised eigenvector. Then, draw the eigenvector.
SolutionFrom Q1, the intermediate eigenvalue is . Hence
The first row gives ; the second then gives . Taking gives . Its length is , so
Either sign is a valid normalized eigenvector. The two outer masses move in opposite directions, while the middle mass is stationary in this mode.

-
Continue from Q1, determine the largest eigenvalue and the corresponding unscaled eigenvector. Then, draw the eigenvector.
SolutionThe largest eigenvalue is . The first and third rows of give
These values satisfy the second row as well. An unscaled eigenvector is
Every nonzero multiple is also an eigenvector. The outer masses move together, in the opposite direction to the middle mass.

-
Combining the results obtained from Q1–Q3, obtain the eigenvector matrix, and diagonalize the following matrix. Comment the relationship between the diagonal matrix and the eigenvalue.
SolutionKeep the eigenvectors exact before multiplying. Write
Using the eigenvectors from Q1–Q3 as columns,
To find , solve . Adding and subtracting its first and third equations gives and . The middle equation then gives
Each column satisfies , so and . The diagonal entries of are the corresponding eigenvalues, in the same order as the columns of .
-
Determine and comment on the change of it's eigenvalue and eigenvector, as compared to .
SolutionFrom , adjacent factors cancel, giving
Use the exact values from Q4 before raising them to the 50th power. The result is
The matrix entries shown are rounded; is the exact result. Every eigenvector of remains an eigenvector of , with eigenvalue . Here the three eigenvalues are positive and distinct, so taking the 50th power preserves their distinct eigenspaces.
-
Given and has an eigenvalue of 2 . Find the remaining eigenvalues and develop the characteristic equation without developing the eigenvalue problem and without performing the determinant.
Solutionhas an eigenvalue of 2
has 3 eigenvalues since it has matrix.
From the property,
From the property,
Subs (2) into (1)
Characteristic equation:
-
Continue Q6, using Cayley-Hamilton theorem to verify that:
and . Then, compute the via the theorem.
Solution -
Explain why the following equation : is not working to solve the problem?
SolutionPreviously we obtained,
where
The eigenvalue/eigenvector problem:
For
Note: RREF shows rank 2 (i.e. 2 linearly independent vectors)
Eigenspace for , where
Note: Unscaled eigenvectors can be any vector of eigenspace. Normally we just let
Eigenvector,
For repeated eigenvalue,
Eigenvector,
For
Note: RREF shows rank 2 (i.e. 2 linearly independent vectors)
Eigenspace for , where
Note: Unscaled eigenvectors can be any vector of eigenspace. Normally we just let
Eigenvector,
Eigenvector or modal matrix,
Thus, can't be computed.
-
Based on and , discuss the advantage and disadvantage of diagonalization formula versus the Cayley-Hamilton theorem in solving the power of a matrix.
SolutionDiagonalization formula for power of a matrix Cayley-Hamilton theorem Advantage Can compute the power of a matrix much faster with single equation. The formulation can be developed using characteristic equation only without the extensive calculation of the eigenvector and eigenvalues. Disadvantage - Require the complete eigenvalues and eigenvectors data for the diagonal matrix as well as the eigenvector matrix. This procedure can be long if compute manually.
- In some cases, it can’t be computed because eigenvector matrix might not have inversion especially for repeated root case.
Need derivation of the theorem formula for the computation of the higher power of the matrix. -
Find all the eigenvalue and normalized eigenvectors in terms of eigenvalue matrix and eigenvector matrix for the matrix .
Then, verify the eigenvalue matrix and eigenvector matrix if they satisfy the eigenvalue/eigenvector problem, i.e. .
SolutionFor non-trivial solution,
Eigenvalues or spectral matrix,
For
Note: RREF shows rank 1 (i.e. 1 linearly independent vectors)
Note: Unscaled eigenvectors can be any vector of eigenspace. Normally we just let or
Eigenvectors, & for repeated eigenvalues respectively.
Note: Normalized eigenvectors has magnitude . It can be obtained by dividing the unscaled eigenvectors with the magnitude.
Normalized eigenvectors,
For
Note: RREF shows rank 2 (i.e. 2 linearly independent vectors)
Eigenspace for , where
Note: Unscaled eigenvectors can be any vector of eigenspace. Normally we just let
Eigenvector,
Note: Normalized eigenvectors has magnitude . It can be obtained by dividing the unscaled eigenvectors with the magnitude.
Normalized Eigenvector,
Eigenvector or modal matrix,
Eigenvalues or spectral matrix,
LHS:
RHS:
Since LHS = RHS, the solutions of eigenvalue matrix, & eigenvector matrix, are verified.