Find Matrix P and the Diagonal Matrix D

  • Thread starter chwala
  • Start date
  • Tags
    Matrix
  • #1
chwala
Gold Member
2,746
387
Homework Statement
see attached - refer to part b only (part a was easy)
Relevant Equations
matrices
1712958779566.png


1712958822270.png


For part (b) i was able to use equations to determine the eigenvectors;

For example for ##λ =6##

##12x +5y -11z=0##
##8x-4z=0##
##32x+10y-26z=0## to give me the eigen vector,


##\begin{pmatrix}
1 \\
2 \\
2
\end{pmatrix}## and so on.

My question is to get matrix P does the arrangement of the eigenvector matrices matter?





1712959692049.png


In my arrangement for eigenvectors for ##λ=6,-4,2##

i have,

##P=\begin{pmatrix}
1 & 1& 1 \\
2 & 0 & -1 \\
2 & 2 & 1
\end{pmatrix}##

and my Diagonal matrix is

##D=\begin{pmatrix}
6^5 & 0 & 0 \\
0 & -4^5 & 0 \\
0 & 0 & 2^5
\end{pmatrix}=
\begin{pmatrix}
7776 & 0 & 0 \\
0 & -1024 & 0 \\
0 & 0 & 32
\end{pmatrix}
##
 
Last edited:
Physics news on Phys.org
  • #2
chwala said:
My question is to get matrix P does the arrangement of the eigenvector matrices matter?
No, but where you place the eigenvectors (i.e., in which columns) will determine P, which will determine ##P^{-1}## which will then determine where the eigenvalues appear on the diagonal matrix D.
 
  • Like
Likes chwala
  • #3
Mark44 said:
No, but where you place the eigenvectors (i.e., in which columns) will determine P, which will determine ##P^{-1}## which will then determine where the eigenvalues appear on the diagonal matrix D.
Ok bass (boss). :wink: Gday @Mark44 :cool:
 
Last edited:

FAQ: Find Matrix P and the Diagonal Matrix D

What is a diagonal matrix?

A diagonal matrix is a type of matrix in which the entries outside the main diagonal are all zero. In other words, a matrix \( D \) is diagonal if \( D_{ij} = 0 \) for all \( i \neq j \). The main diagonal can contain any values, including zero.

How do you find the matrix P and the diagonal matrix D for a given square matrix A?

To find the matrix \( P \) and the diagonal matrix \( D \) for a square matrix \( A \), you typically perform the following steps: first, compute the eigenvalues of \( A \) by solving the characteristic polynomial \( \det(A - \lambda I) = 0 \). The eigenvalues will form the diagonal entries of \( D \). Next, for each eigenvalue \( \lambda \), find the corresponding eigenvectors by solving the equation \( (A - \lambda I)v = 0 \). The matrix \( P \) is formed by placing the eigenvectors as columns. If \( P \) is invertible, then \( A \) can be expressed as \( A = PDP^{-1} \).

What conditions must be met for a matrix to be diagonalizable?

A matrix is diagonalizable if it has enough linearly independent eigenvectors to form the matrix \( P \). Specifically, for an \( n \times n \) matrix to be diagonalizable, it must have \( n \) linearly independent eigenvectors. This is guaranteed if the algebraic multiplicity of each eigenvalue equals its geometric multiplicity.

Can all matrices be diagonalized?

No, not all matrices can be diagonalized. A matrix can be diagonalized if it has a complete set of linearly independent eigenvectors. Matrices that do not meet this criterion, often those with defective eigenvalues (where the geometric multiplicity is less than the algebraic multiplicity), cannot be diagonalized.

What is the significance of finding matrices P and D?

Finding matrices \( P \) and \( D \) is significant because it simplifies many matrix operations, such as raising a matrix to a power or solving systems of differential equations. Once a matrix is diagonalized, computations involving the matrix become easier, as the diagonal matrix \( D \) allows for straightforward manipulation, such as \( A^k = PD^kP^{-1} \) for integer \( k \).

Similar threads

Replies
6
Views
784
Replies
12
Views
2K
Replies
2
Views
2K
Replies
7
Views
2K
Replies
6
Views
2K
Replies
3
Views
1K
Back
Top