Chapter 9: Problem 25
Let \(B=\left[\begin{array}{rrr}11 & -8 & 4 \\ -8 & -1 & -2 \\ 4 & -2 & -4\end{array}\right]\) (b) Find a maximal set \(S\) of nonzero orthogonal eigenvectors of \(B\). (c) Find an orthogonal matrix \(P\) such that \(D=P^{-1} B P\) is diagonal.
Short Answer
Expert verified
Short Answer:
The maximal set S of nonzero orthogonal eigenvectors of matrix B is {饾懃1, 饾懃4} where 饾懃1 = \(\begin{bmatrix} 1 \\ 2 \\ 0 \end{bmatrix}\) and 饾懃4 = \(\begin{bmatrix} -2 \\ 1 \\ 0 \end{bmatrix}\). The orthogonal matrix P such that D=P^{-1}BP is diagonal is:
P = \(\begin{bmatrix} 1 & -2 & 0 \\ 2 & 1 & 0 \\ 0 & 0 & 1 \end{bmatrix}\).
Step by step solution
01
Calculate the eigenvalues of matrix B
To calculate the eigenvalues, we need to solve the characteristic equation given by |B - 位I|=0, where 位 is the eigenvalue and I is the identity matrix.
For this matrix B,
|B - 位I| = |\(\begin{bmatrix} 11-\lambda & -8 & 4 \\ -8 & -1-\lambda & -2 \\ 4 & -2 & -4-\lambda\end{bmatrix}\)| = 0.
Now, we compute the determinant to find the characteristic polynomial,
|B - 位I| = (11-位)(-1-位)((-4)-位) - (-8)(-2)(4) - (4)(-8)(-2) + (4)^2(11-位) + (4)(-8)(-1-位) + (-2)^2(-8).
Expanding and simplifying the polynomial, we get the characteristic polynomial as:
位^3 + (-6)位^2 - 33位 - 36 = 0
02
Find the eigenvalues from the characteristic polynomial
The characteristic polynomial is a cubic equation that might not be easy to solve analytically. However, through inspection or using a numerical methods like Newton's method, we can find that the eigenvalues are:
位1 = -2, 位2 = 3, and 位3 = -6
03
Compute the eigenvectors for each eigenvalue
Now that we have the eigenvalues, we can find the eigenvectors by solving the linear system (B - 位I)饾懃 = 0 for each eigenvalue.
For 位1 = -2, we have:
\(\begin{bmatrix} 13 & -8 & 4 \\ -8 & 1 & -2 \\ 4 & -2 & -2\end{bmatrix}\)
After row reduction:
\(\begin{bmatrix} 1 & -\frac{1}{2} & 0 \\ 0 & 0 & 1 \\ 0 & 0 & 0\end{bmatrix}\)
One possible eigenvector for 位1 is 饾懃1 = \(\begin{bmatrix} 1 \\ 2 \\ 0\end{bmatrix}\)
For 位2 = 3, we have:
\(\begin{bmatrix} 8 & -8 & 4 \\ -8 & 4 & -2 \\ 4 & -2 & -7\end{bmatrix}\)
After row reduction:
\(\begin{bmatrix} 1 & -1 & 0 \\ 0 & 0 & 1 \\ 0 & 0 & 0\end{bmatrix}\)
One possible eigenvector for 位2 is 饾懃2 = \(\begin{bmatrix} 1 \\ 1 \\ 0\end{bmatrix}\)
For 位3 = -6, we have:
\(\begin{bmatrix} 17 & -8 & 4 \\ -8 & -5 & -2 \\ 4 & -2 & 2\end{bmatrix}\)
After row reduction:
\(\begin{bmatrix} 1 & -\frac{4}{9} & 0 \\ 0 & 0 & 1 \\ 0 & 0 & 0\end{bmatrix}\)
One possible eigenvector for 位3 is 饾懃3 = \(\begin{bmatrix} 9 \\ 4 \\ 0\end{bmatrix}\)
04
Check orthogonality of eigenvectors; find maximal orthogonal set
Now we can check if the eigenvectors we found are orthogonal by taking the dot product between each pair of eigenvectors:
饾懃1 路 饾懃2 = 1 * 1 + 2 * 1 + 0 * 0 = 3 鈮 0,
饾懃1 路 饾懃3 = 1 * 9 + 2 * 4 + 0 * 0 = 17 鈮 0,
饾懃2 路 饾懃3 = 1 * 9 + 1 * 4 + 0 * 0 = 13 鈮 0
Since all the dot products are non-zero, the eigenvectors are not orthogonal to each other. However, the eigenvectors all lie in the xy-plane (since their z-components are all zero). Therefore, 饾懃1 = \(\begin{bmatrix}1 \\ 2 \\ 0\end{bmatrix}\) and any linearly independent vector in the xy-plane can form a maximal orthogonal set for B. For instance,
饾懃1 = \(\begin{bmatrix} 1 \\ 2 \\ 0 \end{bmatrix}\) and 饾懃4 = \(\begin{bmatrix} -2 \\ 1 \\ 0 \end{bmatrix}\) are orthogonal (\(1*(-2) + 2*1 + 0*0 = 0\)), and make up the maximal orthogonal set.
Maximal set S = {饾懃1, 饾懃4}.
05
Construct orthogonal matrix P
Now we can construct an orthogonal matrix P using the orthogonal eigenvectors such that D=P^{-1}BP is diagonal. Since our matrix is 3x3, we need one more orthogonal vector to complete the matrix. Since both 饾懃1 and 饾懃4 lie in the xy-plane, a vector orthogonal to both must have a non-zero z-component and zero x and y components. Thus, 饾懃5 = \(\begin{bmatrix} 0 \\ 0 \\ 1 \end{bmatrix}\) forms an orthogonal basis with 饾懃1 and 饾懃4.
Now construct the orthogonal matrix P:
P = \(\begin{bmatrix} 1 & -2 & 0 \\ 2 & 1 & 0 \\ 0 & 0 & 1 \end{bmatrix}\)
Now, D = P^(-1)BP should be diagonal. Check by doing the matrix multiplication.
Unlock Step-by-Step Solutions & Ace Your Exams!
-
Full Textbook Solutions
Get detailed explanations and key concepts
-
Unlimited Al creation
Al flashcards, explanations, exams and more...
-
Ads-free access
To over 500 millions flashcards
-
Money-back guarantee
We refund you if you fail your exam.
Over 30 million students worldwide already upgrade their learning with 91影视!
Key Concepts
These are the key concepts you need to understand to accurately answer the question.
Eigenvectors
Eigenvectors are special vectors associated with a matrix that do not change direction during a linear transformation represented by the matrix. Identifying an eigenvector involves solving a linear equation system, typically derived from:
The eigenvectors are crucial because they help in understanding the geometric transformations the matrix represents, like scaling, rotating, or reflecting. In the example provided, for each eigenvalue \( \lambda_1 = -2 \), \( \lambda_2 = 3 \), and \( \lambda_3 = -6 \), we computed corresponding eigenvectors. To build the orthogonal matrix \( P \), these vectors are a vital component.
- Subtracting the eigenvalue from the diagonal of the matrix
- Solving \( (B - \lambda I)x = 0 \)
The eigenvectors are crucial because they help in understanding the geometric transformations the matrix represents, like scaling, rotating, or reflecting. In the example provided, for each eigenvalue \( \lambda_1 = -2 \), \( \lambda_2 = 3 \), and \( \lambda_3 = -6 \), we computed corresponding eigenvectors. To build the orthogonal matrix \( P \), these vectors are a vital component.
Eigenvalues
Eigenvalues play a crucial role in the analysis of linear transformations. They are scalars corresponding to eigenvectors, which describe the factor by which the associated eigenvector is scaled during the transformation. To find eigenvalues, we solve the characteristic equation obtained from the determinant condition of the matrix subtraction \( |B - \lambda I| = 0 \).
In this specific problem, the characteristic polynomial \( \lambda^3 - 6 \lambda^2 - 33 \lambda - 36 = 0 \) was generated. The solutions to this equation are the eigenvalues which are as follows:
In this specific problem, the characteristic polynomial \( \lambda^3 - 6 \lambda^2 - 33 \lambda - 36 = 0 \) was generated. The solutions to this equation are the eigenvalues which are as follows:
- \( \lambda_1 = -2 \)
- \( \lambda_2 = 3 \)
- \( \lambda_3 = -6 \)
Characteristic Polynomial
The characteristic polynomial is essential in finding the eigenvalues of a matrix. Derived from the determinant \( |B - \lambda I| = 0 \), it is a polynomial equation where the roots are the eigenvalues of the matrix. Understanding this polynomial allows us to determine important properties of the matrix, like stability and diagonalizability.
For matrix \( B \), the characteristic polynomial was:
For matrix \( B \), the characteristic polynomial was:
- \( \lambda^3 - 6\lambda^2 - 33\lambda - 36 = 0 \)
Diagonalization
Diagonalization is the process of converting a matrix into a diagonal form, which is easier to work with, as its non-diagonal entries are all zero. This transformation is accomplished using eigenvectors and eigenvalues by finding an orthogonal matrix \( P \) such that:
In the exercise, a set of orthogonal eigenvectors were found, denoted as \( S \), which were used to construct \( P \):
- \( D = P^{-1}BP \)
In the exercise, a set of orthogonal eigenvectors were found, denoted as \( S \), which were used to construct \( P \):
- \( P = \begin{bmatrix} 1 & -2 & 0 \ 2 & 1 & 0 \ 0 & 0 & 1 \end{bmatrix} \)