Eigenvalues and Eigenvectors - ECE Board Exam Reviewer

Eigenvalues, Rank, and Diagonalization — PinoyBIX ECE EE ME Board Exam Reviewer

DaysHoursMinSec

This offer has expired!

SubscribePREMIUM PROMO: Remove Ads!! Get Freebies!!! and Get EXTRA MONTHS before Time EXPIRED!

Most engineering students treat eigenvalues like a punishment reserved for graduate school. That is a mistake. Eigenvalue problems appear in the ECE, EE, and ME board exams as direct computational items, and once you see the pattern, they are not difficult — you are solving a determinant equation that you already know how to evaluate. This post covers eigenvalues and eigenvectors, matrix rank, diagonalization, and LU decomposition for the ECE, EE, and ME board exam. All 10 problems are worked step by step using the same format used throughout this series. This is Part 5 of the Matrices and Determinants Series.

📋 BOARD EXAM RELEVANCE

ECE board examinees encounter eigenvalues in control systems stability analysis and discrete-time signal processing. A system is stable when all eigenvalues of the system matrix have negative real parts, or magnitudes less than 1 for discrete systems — that fact alone earns board exam points. EE board examinees see eigenvalues in power system small-signal stability and modal analysis. ME board examinees use eigenvalues in vibration analysis to find natural frequencies of multi-degree-of-freedom systems. Rank appears as a conceptual item across all nine boards as part of linear system consistency analysis. LU decomposition appears occasionally in ECE and EE as a factorization method in numerical computation problems.

Eigenvalues — What They Actually Are

When you multiply a matrix $A$ by a special vector $v$ , something unusual happens — instead of rotating or shearing $v$ the way a general matrix would, it only scales it. The scalar by which it gets scaled is the eigenvalue $\lambda$ . The vector $v$ that makes this happen is the eigenvector.

KEY DEFINITION — EIGENVALUE EQUATION

$Av = \lambda v$

$A$ is the square matrix, $v$ is the nonzero eigenvector, and $\lambda$ is the eigenvalue. Rearranging: $(A - \lambda I)v = 0$ . For a nonzero solution $v$ to exist, the matrix $(A - \lambda I)$ must be singular.

Finding Eigenvalues — The Characteristic Equation

Since $(A - \lambda I)$ must be singular, its determinant must be zero. That condition gives you the characteristic equation.

KEY FORMULA — CHARACTERISTIC EQUATION

$\det(A - \lambda I) = 0$

Expand the determinant. You get a polynomial in $\lambda$ of degree $n$ for an $n \times n$ matrix. The roots of that polynomial are the eigenvalues. A $2 \times 2$ matrix gives a quadratic. A $3 \times 3$ matrix gives a cubic.

Finding Eigenvectors

Once you have an eigenvalue $\lambda_k$ , substitute it back into $(A - \lambda_k I)v = 0$ and solve the homogeneous system. The solution gives you the eigenvector. Since any scalar multiple of an eigenvector is also an eigenvector, you typically express the answer as a direction — pick the simplest nonzero vector that satisfies the equation.

Properties Worth Memorizing

EIGENVALUE PROPERTIES — QUICK REFERENCE

$\text{Sum of eigenvalues} = \text{trace}(A) = \sum a_{ii}$

$\text{Product of eigenvalues} = \det(A)$

$\text{Eigenvalues of } A^n = \lambda^n \quad \text{(same eigenvectors)}$

$\text{Eigenvalues of } A^{-1} = \dfrac{1}{\lambda} \quad \text{(same eigenvectors)}$

The trace is the sum of the main diagonal entries. These properties let you check your eigenvalue calculations without fully re-solving the characteristic equation.

Diagonalization

KEY FORMULA — DIAGONALIZATION

$A = PDP^{-1}$

$P$ is the matrix whose columns are the eigenvectors of $A$ , arranged in the same order as the eigenvalues. $D$ is the diagonal matrix with the eigenvalues on the main diagonal. A matrix can be diagonalized if and only if it has $n$ linearly independent eigenvectors.

Matrix Rank and Null Space

KEY DEFINITIONS — RANK AND NULLITY

$\text{rank}(A) = \text{number of nonzero rows after row reduction}$

$\text{nullity}(A) = n - \text{rank}(A)$

$\text{rank}(A) + \text{nullity}(A) = n \quad \text{(Rank-Nullity Theorem)}$

Rank tells you how many independent equations you actually have. An $n \times n$ matrix with rank $n$ is nonsingular and invertible. A matrix with rank less than $n$ is singular.

LU Decomposition

KEY FORMULA — LU DECOMPOSITION

$A = LU$

$L$ is lower triangular (ones on the diagonal, nonzero entries below). $U$ is upper triangular. Solving $Ax = b$ becomes two triangular solves: $Ly = b$ (forward substitution), then $Ux = y$ (back substitution). The advantage is that $LU$ is computed once and reused for any number of right-hand side vectors.

10 Worked Board Exam Problems

Problem 1. Find the eigenvalues of a 2×2 matrix.

Given: $A = \begin{bmatrix}4&1\\2&3\end{bmatrix}$

Find: The eigenvalues of $A$ .

Solution:

Step 1: Set up the characteristic equation $\det(A - \lambda I) = 0$ .

$\det\begin{bmatrix}4-\lambda&1\\2&3-\lambda\end{bmatrix} = 0$

Step 2: Expand the determinant.

$(4-\lambda)(3-\lambda) - (1)(2) = 0$

$\lambda^2 - 7\lambda + 12 - 2 = 0$

$\lambda^2 - 7\lambda + 10 = 0$

Step 3: Factor the quadratic.

$(\lambda - 5)(\lambda - 2) = 0$

$\lambda_1 = 5 \qquad \lambda_2 = 2$

Step 4: Verify using the trace and determinant properties.

$\text{trace}(A) = 4+3 = 7 = \lambda_1 + \lambda_2 = 5+2 \quad \checkmark$

$\det(A) = 12-2 = 10 = \lambda_1 \cdot \lambda_2 = 5 \times 2 \quad \checkmark$

✓ ANSWER: $\lambda_1 = 5$ , $\lambda_2 = 2$

Examiner note: Always verify eigenvalues using the trace and determinant checks. They take five seconds and confirm you factored the characteristic polynomial correctly. A wrong factorization is the most common error in eigenvalue problems.

Problem 2. Find the eigenvectors corresponding to each eigenvalue from Problem 1.

Given: $A = \begin{bmatrix}4&1\\2&3\end{bmatrix}$ , $\lambda_1 = 5$ , $\lambda_2 = 2$

Find: Eigenvectors $v_1$ and $v_2$ .

Solution:

Step 1: For $\lambda_1 = 5$ , solve $(A - 5I)v = 0$ .

$A - 5I = \begin{bmatrix}-1&1\\2&-2\end{bmatrix}$

Row reduce: $R_2 \leftarrow R_2 + 2R_1$ gives $\begin{bmatrix}-1&1\\0&0\end{bmatrix}$ . From row 1: $-v_1 + v_2 = 0 \implies v_2 = v_1$ . Let $v_1 = 1$ .

$v_1 = \begin{bmatrix}1\\1\end{bmatrix}$

Step 2: For $\lambda_2 = 2$ , solve $(A - 2I)v = 0$ .

$A - 2I = \begin{bmatrix}2&1\\2&1\end{bmatrix}$

Row reduce: $R_2 \leftarrow R_2 - R_1$ gives $\begin{bmatrix}2&1\\0&0\end{bmatrix}$ . From row 1: $2v_1 + v_2 = 0 \implies v_2 = -2v_1$ . Let $v_1 = 1$ .

$v_2 = \begin{bmatrix}1\\-2\end{bmatrix}$

✓ ANSWER: $v_1 = \begin{bmatrix}1\\1\end{bmatrix}$ for $\lambda_1 = 5$ , $\quad v_2 = \begin{bmatrix}1\\-2\end{bmatrix}$ for $\lambda_2 = 2$

Examiner note: Eigenvectors are not unique — any nonzero scalar multiple is also valid. What matters is the direction, not the magnitude. $\begin{bmatrix}2\\2\end{bmatrix}$ is equally correct for $\lambda_1 = 5$ . The board exam answer key always accepts any scalar multiple.

Problem 3. Use eigenvalue properties to find the determinant and trace without full computation.

Given: A $3 \times 3$ matrix has eigenvalues $\lambda_1 = 1$ , $\lambda_2 = -2$ , $\lambda_3 = 4$ .

Find: $\det(A)$ and $\text{trace}(A)$ .

Solution:

Step 1: Apply the product property.

$\det(A) = \lambda_1 \cdot \lambda_2 \cdot \lambda_3 = (1)(-2)(4) = -8$

Step 2: Apply the sum property.

$\text{trace}(A) = \lambda_1 + \lambda_2 + \lambda_3 = 1 + (-2) + 4 = 3$

✓ ANSWER: $\det(A) = -8$ , $\text{trace}(A) = 3$

Examiner note: These are one-line calculations once you know the eigenvalues. The board exam uses this as a fast conceptual item. If $\det(A) = 0$ , at least one eigenvalue is zero and the matrix is singular. That link between a zero eigenvalue and singularity is tested directly.

Problem 4. Find the eigenvalues of a 3×3 matrix with an obvious factor.

Given: $A = \begin{bmatrix}2&0&0\\1&3&0\\0&2&4\end{bmatrix}$

Find: The eigenvalues of $A$ .

Solution:

Step 1: Recognize the lower triangular structure. For any triangular matrix, the eigenvalues are the diagonal entries directly.

$\lambda_1 = 2 \qquad \lambda_2 = 3 \qquad \lambda_3 = 4$

Step 2: Verify via trace and determinant.

$\text{trace} = 2+3+4 = 9 = 2+3+4 \quad \checkmark$

$\det(A) = 2 \times 3 \times 4 = 24 = \lambda_1\lambda_2\lambda_3 \quad \checkmark$

✓ ANSWER: $\lambda_1 = 2$ , $\lambda_2 = 3$ , $\lambda_3 = 4$

Examiner note: The eigenvalues of any triangular matrix — upper or lower — sit right on the main diagonal. No computation needed. The board exam drops this in as a quick conceptual item. If you do not recognize the pattern, you will spend two minutes on a ten-second problem.

Problem 5. Diagonalize a 2×2 matrix.

Given: $A = \begin{bmatrix}4&1\\2&3\end{bmatrix}$ with eigenvalues $\lambda_1 = 5$ , $\lambda_2 = 2$ and eigenvectors $v_1 = \begin{bmatrix}1\\1\end{bmatrix}$ , $v_2 = \begin{bmatrix}1\\-2\end{bmatrix}$ from Problems 1 and 2.

Find: The matrices $P$ , $D$ , and $P^{-1}$ such that $A = PDP^{-1}$ .

Solution:

Step 1: Assemble $P$ using eigenvectors as columns, in the same order as the eigenvalues.

$P = \begin{bmatrix}1&1\\1&-2\end{bmatrix}$

Step 2: Assemble $D$ with eigenvalues on the diagonal in the same order.

$D = \begin{bmatrix}5&0\\0&2\end{bmatrix}$

Step 3: Find $P^{-1}$ using the 2×2 inverse formula. $\det P = (1)(-2)-(1)(1) = -3$ .

$P^{-1} = \dfrac{1}{-3}\begin{bmatrix}-2&-1\\-1&1\end{bmatrix} = \begin{bmatrix}\frac{2}{3}&\frac{1}{3}\\\frac{1}{3}&-\frac{1}{3}\end{bmatrix}$

Step 4: Verify $PDP^{-1} = A$ .

$PD = \begin{bmatrix}5&2\\5&-4\end{bmatrix}$

$PDP^{-1} = \begin{bmatrix}5&2\\5&-4\end{bmatrix}\begin{bmatrix}\frac{2}{3}&\frac{1}{3}\\\frac{1}{3}&-\frac{1}{3}\end{bmatrix} = \begin{bmatrix}4&1\\2&3\end{bmatrix} = A \quad \checkmark$

✓ ANSWER: $P = \begin{bmatrix}1&1\\1&-2\end{bmatrix}$ , $D = \begin{bmatrix}5&0\\0&2\end{bmatrix}$ , $P^{-1} = \begin{bmatrix}\frac{2}{3}&\frac{1}{3}\\\frac{1}{3}&-\frac{1}{3}\end{bmatrix}$

Examiner note: The column order in $P$ must match the diagonal order in $D$ . If you put $\lambda_1 = 5$ first in $D$ , the eigenvector for $\lambda_1 = 5$ must be the first column of $P$ . Mix that order up and $PDP^{-1} \neq A$ .

Problem 6. Use diagonalization to compute a matrix power efficiently.

Given: $A = PDP^{-1}$ where $D = \begin{bmatrix}5&0\\0&2\end{bmatrix}$

Find: $A^4$ using diagonalization.

Solution:

Step 1: Recall that $A^n = PD^nP^{-1}$ .

Step 2: Compute $D^4$ by raising each diagonal entry to the fourth power.

$D^4 = \begin{bmatrix}5^4&0\\0&2^4\end{bmatrix} = \begin{bmatrix}625&0\\0&16\end{bmatrix}$

Step 3: The result is $A^4 = PD^4P^{-1}$ .

$A^4 = \begin{bmatrix}1&1\\1&-2\end{bmatrix}\begin{bmatrix}625&0\\0&16\end{bmatrix}\begin{bmatrix}\frac{2}{3}&\frac{1}{3}\\\frac{1}{3}&-\frac{1}{3}\end{bmatrix}$

$= \begin{bmatrix}625&16\\625&-32\end{bmatrix}\begin{bmatrix}\frac{2}{3}&\frac{1}{3}\\\frac{1}{3}&-\frac{1}{3}\end{bmatrix} = \begin{bmatrix}\dfrac{1250+16}{3}&\dfrac{625-16}{3}\\\dfrac{1250-32}{3}&\dfrac{625+32}{3}\end{bmatrix} = \begin{bmatrix}422&203\\406&219\end{bmatrix}$

✓ ANSWER: $A^4 = \begin{bmatrix}422&203\\406&219\end{bmatrix}$

Examiner note: Computing $A^4$ by multiplying $A$ by itself four times requires three matrix multiplications. Using $A^4 = PD^4P^{-1}$ requires only three multiplications too, but the middle step $D^4$ is trivial since diagonal matrices raise to powers entry by entry. For $A^{100}$ , diagonalization is the only practical method.

Problem 7. Find the rank of a matrix by row reduction.

Given: $A = \begin{bmatrix}1&2&3\\2&4&6\\1&1&1\end{bmatrix}$

Find: $\text{rank}(A)$

Solution:

Step 1: Row reduce $A$ . $R_2 \leftarrow R_2 - 2R_1$ , $R_3 \leftarrow R_3 - R_1$ .

$\begin{bmatrix}1&2&3\\0&0&0\\0&-1&-2\end{bmatrix}$

Step 2: Swap $R_2$ and $R_3$ .

$\begin{bmatrix}1&2&3\\0&-1&-2\\0&0&0\end{bmatrix}$

Step 3: Count nonzero rows after row reduction. Two nonzero rows, so $\text{rank}(A) = 2$ .

Step 4: Apply the rank-nullity theorem. $A$ is $3 \times 3$ , so $\text{nullity}(A) = 3 - 2 = 1$ . One free variable exists.

✓ ANSWER: $\text{rank}(A) = 2$ , $\text{nullity}(A) = 1$

Examiner note: Row 2 of the original matrix is exactly twice row 1 — that is the dependency that collapses it to a zero row. Always scan for obvious scalar multiples before you start row reducing. Finding them instantly reduces your work.

Problem 8. Determine if a matrix is diagonalizable based on its eigenvalues.

Given: $A = \begin{bmatrix}2&1\\0&2\end{bmatrix}$

Find: Is $A$ diagonalizable?

Solution:

Step 1: Find the eigenvalues. $\det(A - \lambda I) = (2-\lambda)^2 = 0 \implies \lambda = 2$ (repeated, algebraic multiplicity 2).

Step 2: Find the eigenvectors for $\lambda = 2$ . Solve $(A - 2I)v = 0$ .

$A - 2I = \begin{bmatrix}0&1\\0&0\end{bmatrix} \implies 0 \cdot v_1 + 1 \cdot v_2 = 0 \implies v_2 = 0$

Step 3: Only one free variable ( $v_1$ is free), so there is only one independent eigenvector: $v = \begin{bmatrix}1\\0\end{bmatrix}$ . The geometric multiplicity is 1, but the algebraic multiplicity is 2.

Step 4: Since geometric multiplicity $<$ algebraic multiplicity, the matrix does not have two independent eigenvectors and cannot be diagonalized.

✓ ANSWER: $A$ is NOT diagonalizable. It has a repeated eigenvalue $\lambda = 2$ but only one independent eigenvector.

Examiner note: A repeated eigenvalue does not automatically mean the matrix is not diagonalizable. The identity matrix $I$ has $\lambda = 1$ repeated $n$ times but is already diagonal. What kills diagonalizability is a shortage of independent eigenvectors — geometric multiplicity less than algebraic multiplicity.

Problem 9. Perform LU decomposition on a 3×3 matrix.

Given: $A = \begin{bmatrix}2&4&-2\\1&3&1\\-1&1&4\end{bmatrix}$

Find: Matrices $L$ and $U$ such that $A = LU$ .

Solution:

Step 1: Start with $U = A$ and build $L$ as we eliminate. Begin with $R_2 \leftarrow R_2 - \dfrac{1}{2}R_1$ . Multiplier $m_{21} = \dfrac{1}{2}$ .

$U \rightarrow \begin{bmatrix}2&4&-2\\0&1&2\\-1&1&4\end{bmatrix}$

Step 2: $R_3 \leftarrow R_3 + \dfrac{1}{2}R_1$ . Multiplier $m_{31} = -\dfrac{1}{2}$ .

$U \rightarrow \begin{bmatrix}2&4&-2\\0&1&2\\0&3&3\end{bmatrix}$

Step 3: $R_3 \leftarrow R_3 - 3R_2$ . Multiplier $m_{32} = 3$ .

$U = \begin{bmatrix}2&4&-2\\0&1&2\\0&0&-3\end{bmatrix}$

Step 4: Build $L$ from the multipliers, with 1’s on the diagonal.

$L = \begin{bmatrix}1&0&0\\\frac{1}{2}&1&0\\-\frac{1}{2}&3&1\end{bmatrix}$

Step 5: Verify $LU = A$ .

$LU = \begin{bmatrix}1&0&0\\\frac{1}{2}&1&0\\-\frac{1}{2}&3&1\end{bmatrix}\begin{bmatrix}2&4&-2\\0&1&2\\0&0&-3\end{bmatrix} = \begin{bmatrix}2&4&-2\\1&3&1\\-1&1&4\end{bmatrix} = A \quad \checkmark$

✓ ANSWER: $L = \begin{bmatrix}1&0&0\\\frac{1}{2}&1&0\\-\frac{1}{2}&3&1\end{bmatrix}$ , $U = \begin{bmatrix}2&4&-2\\0&1&2\\0&0&-3\end{bmatrix}$

Examiner note: The multipliers in $L$ go exactly where you used them during elimination — $m_{21}$ goes in row 2, column 1, and so on. The signs are the multipliers as used, not negated. Students who negate the multipliers when building $L$ get a wrong factorization that fails the $LU = A$ verification.

Problem 10. Apply eigenvalues to a vibration analysis problem.

Given: A two-degree-of-freedom spring-mass system has the eigenvalue problem $Av = \lambda v$ where:

$A = \begin{bmatrix}3&-1\\-1&3\end{bmatrix}$

and $\lambda = \omega^2$ where $\omega$ is the natural frequency in rad/s.

Find: The natural frequencies of the system.

Solution:

Step 1: Set up the characteristic equation.

$\det(A - \lambda I) = \det\begin{bmatrix}3-\lambda&-1\\-1&3-\lambda\end{bmatrix} = 0$

Step 2: Expand.

$(3-\lambda)^2 - 1 = 0$

$\lambda^2 - 6\lambda + 9 - 1 = 0$

$\lambda^2 - 6\lambda + 8 = 0$

$(\lambda-4)(\lambda-2) = 0$

$\lambda_1 = 2 \qquad \lambda_2 = 4$

Step 3: Since $\lambda = \omega^2$ , find the natural frequencies.

$\omega_1 = \sqrt{2} \approx 1.414 \text{ rad/s} \qquad \omega_2 = \sqrt{4} = 2 \text{ rad/s}$

✓ ANSWER: $\omega_1 = \sqrt{2} \approx 1.41$ rad/s, $\omega_2 = 2$ rad/s

Examiner note: Vibration problems rename the eigenvalues as $\omega^2$ , but the math is identical. Recognize the connection between eigenvalue problems and natural frequency problems early in the problem so you know what to do with the $\lambda$ values once you have them — take the square root to get $\omega$ .

Common Mistakes and Examiner Traps

❌ Common Mistake	✅ Correct Approach
Setting up $\det(A + \lambda I) = 0$ with a positive sign	The characteristic equation is always $\det(A - \lambda I) = 0$ . Subtract $\lambda I$ , never add it. A sign error here gives completely wrong eigenvalues.
Assuming a repeated eigenvalue always means the matrix is not diagonalizable	Repeated eigenvalues may or may not prevent diagonalization. Check if the number of independent eigenvectors matches the algebraic multiplicity. The identity matrix is the classic counter-example.
Putting eigenvalues as rows in $P$ instead of using eigenvectors as columns	$P$ has eigenvectors as columns. $D$ has eigenvalues on the diagonal. Mixing this up produces $PDP^{-1} \neq A$ . The column of $P$ and the diagonal entry of $D$ in the same position must correspond to each other.
Computing rank by counting the number of nonzero entries rather than nonzero rows after reduction	Rank is the number of nonzero rows in the row echelon form, which equals the number of pivot columns. A row with all zero entries does not contribute to the rank regardless of the original matrix entries.
Negating the multipliers when building $L$ during LU decomposition	Store the multipliers in $L$ exactly as computed — the positive value used in the row operation. If you used $m_{21} = \frac{1}{2}$ to eliminate, then $L_{21} = \frac{1}{2}$ , not $-\frac{1}{2}$ .
Forgetting to take the square root when converting eigenvalues to natural frequencies in vibration problems	In vibration analysis, $\lambda = \omega^2$ . The natural frequency is $\omega = \sqrt{\lambda}$ , not $\lambda$ itself. Report $\omega$ in rad/s, not $\omega^2$ .

Board Exam Quick Tips

Use the trace and determinant to verify eigenvalues immediately. Once you solve the characteristic equation, add the eigenvalues and compare to the trace, then multiply them and compare to the determinant. Two checks, five seconds, and you know whether to trust your answer before moving on.
Triangular matrices give eigenvalues for free. The eigenvalues of any upper or lower triangular matrix are the diagonal entries. No characteristic equation needed. Scan the matrix for triangular structure before setting up the full determinant.
Rank equals the number of pivot columns after row reduction. Row reduce the matrix all the way to echelon form and count the nonzero rows. That number is the rank. It tells you exactly how many independent equations you have, which determines the solution type for any associated linear system.
For repeated eigenvalues, check the number of independent eigenvectors before concluding anything about diagonalizability. Solve the system $(A - \lambda I)v = 0$ and count the free variables. If the number of free variables equals the algebraic multiplicity of $\lambda$ , the matrix is still diagonalizable.
In vibration and control problems, recognize eigenvalue language. Natural frequencies, mode shapes, stability margins, and system poles are all eigenvalue concepts. The moment a problem asks about the behavior of a system modeled by a matrix differential equation, eigenvalues are the answer.

Frequently Asked Questions

What does a negative eigenvalue mean physically?

It depends on the application. In a vibration system where $\lambda = \omega^2$ , a negative eigenvalue means the configuration is unstable — the system cannot sustain oscillation in that mode. In a control system, eigenvalues with negative real parts mean the system is stable and will return to equilibrium after a disturbance. The sign of the eigenvalue carries direct physical meaning, which is why board exam problems ask you to classify systems using eigenvalues.

Can a matrix have complex eigenvalues?

Yes. Real matrices can have complex eigenvalues, and they always appear in conjugate pairs. A real $2 \times 2$ matrix with complex eigenvalues $a \pm jb$ represents a rotation-scaling transformation. In control systems, complex eigenvalues with negative real parts mean the system is stable and oscillatory — the imaginary part sets the oscillation frequency and the real part sets the decay rate.

What is the geometric interpretation of rank?

Rank is the dimension of the column space of the matrix — the number of truly independent directions that the matrix can map vectors into. A $3 \times 3$ matrix with rank 2 maps all of three-dimensional space onto a two-dimensional plane. That is why a rank-deficient matrix cannot be inverted: it compresses space and you cannot recover the original directions from the output.

When does LU decomposition fail?

LU decomposition without row pivoting fails when a zero appears in a pivot position during elimination. This requires either partial pivoting — swapping rows to bring a nonzero entry into the pivot position — which produces a modified form $PA = LU$ where $P$ is a permutation matrix, or full pivoting for maximum numerical stability. Most board exam problems use matrices where LU decomposition works cleanly without pivoting.

Is diagonalization the same as finding the singular value decomposition?

No, they are different. Diagonalization requires a square matrix with independent eigenvectors and produces $A = PDP^{-1}$ . Singular value decomposition works for any matrix, including non-square ones, and produces $A = U\Sigma V^T$ where $U$ and $V$ are orthogonal matrices and $\Sigma$ contains the singular values. The board exam tests eigenvalue diagonalization, not SVD, at this level.

What is Next

You have now worked through the complete Matrices and Determinants series — five parts, 50 worked problems, and the full range of topics that appear on the ECE, EE, CE, and ME board exams. The next step is the practice exam. Head to the Matrices and Determinants Series Index for the consolidated formula sheet, the 30-item practice exam with answer key, the score interpretation table, and the study schedule. After you take the practice exam, check your answers against the Complete Solutions Post.

Series navigation: Part 1 — Fundamentals and Operations | Part 2 — Determinants and Inverse | Part 3 — Systems of Equations | Part 4 — Engineering Applications

Please do Subscribe on YouTube!

P inoyBIX educates thousands of reviewers and students a day in preparation for their board examinations. Also provides professionals with materials for their lectures and practice exams. Help me go forward with the same spirit.

“Will you subscribe today via YOUTUBE?”

What You Also Get: FREE ACCESS & DOWNLOAD via GDRIVE

TIRED OF ADS?

Become Premium Member and experienced complete ads-free content browsing.
Full Content Access to Premium Solutions Exclusive for Premium members
Access to PINOYBIX FREEBIES folder
Download Reviewers and Learning Materials Free
Download Content: You can see download/print button at the bottom of each post.

PINOYBIX FREEBIES FOR PREMIUM MEMBERSHIP:

CIVIL ENGINEERING REVIEWER
CIVIL SERVICE EXAM REVIEWER
CRIMINOLOGY REVIEWER
ELECTRONICS ENGINEERING REVIEWER (ECE/ECT)
ELECTRICAL ENGINEERING & RME REVIEWER
FIRE OFFICER EXAMINATION REVIEWER
LET REVIEWER
MASTER PLUMBER REVIEWER
MECHANICAL ENGINEERING REVIEWER
NAPOLCOM REVIEWER
Additional upload reviewers and learning materials are also FREE

FOR A LIMITED TIME

If you subscribe for PREMIUM today!

You will receive an additional 1 month of Premium Membership FREE.

For Bronze Membership an additional 2 months of Premium Membership FREE.

For Silver Membership an additional 3 months of Premium Membership FREE.

For Gold Membership an additional 5 months of Premium Membership FREE.

Join the PinoyBIX community.

DaysHoursMinSec

This offer has expired!

SubscribeMembership Plan

Eigenvalues and Eigenvectors – ECE Board Exam Reviewer

Eigenvalues — What They Actually Are

Finding Eigenvalues — The Characteristic Equation

Finding Eigenvectors

Properties Worth Memorizing

Diagonalization

Matrix Rank and Null Space

LU Decomposition

10 Worked Board Exam Problems

Problem 1. Find the eigenvalues of a 2×2 matrix.

Problem 2. Find the eigenvectors corresponding to each eigenvalue from Problem 1.

Problem 3. Use eigenvalue properties to find the determinant and trace without full computation.