Finding eigenvalues and eigenvectors given sub-matrices

In summary, the solution is to find the eigenvector and eigenvalue for the matrix, A, that corresponds to the desired eigenvalue.
  • #1
member 731016
Homework Statement
Please see below
Relevant Equations
Please see below
For this,
1685494468803.png

The solution is,
1685494576554.png

1685494595484.png

However, does someone please know what allows them to express the eigenvector for each of the sub-matrix in terms of t?

Many thanks!
 
Physics news on Phys.org
  • #2
From the definition a multiple of any eigenvector is also trivially an eigenvector. So who did this?
 
  • Like
Likes member 731016
  • #3
Any matrix operator is linear. So ##A (tv)= t A v ## for any vector, ##v##.
Now use that in your case with the eigenvector and eigenvalue.
 
Last edited:
  • Like
Likes member 731016
  • #4
You need to take into account that both conditions hold. If ##a\not = -1##, then there are two eigenvalues and the corresponding eigenvectors are multiples of the two given vectors. If ##a=-1##, then there is only one eigenvalue and all vectors are eigenvectors.
 
  • Like
Likes member 731016
  • #5
Thank you for your replies @hutchphd, @FactChecker and @martinbn !

So I am coming to think of it like this considering the most general case I could think of:

##A\vec v = \lambda\vec v##
##At\vec v = \lambda t\vec v## multiply both sides by a scalar ##t## which is a member of the reals
Therefore, the definition of eigenvector and eigenvalue, ##t\vec v## is an eigenvectors for ##\lambda## and ##\lambda## is the eigenvalue for A.

Is that please correct?

Many thanks!
 
  • #6
ChiralSuperfields said:
##A\vec v = \lambda\vec v##
##At\vec v = \lambda t\vec v## multiply both sides by a scalar ##t## which is a member of the reals
Therefore, the definition of eigenvector and eigenvalue, ##t\vec v## is an eigenvectors for ##\lambda## and ##\lambda## is the eigenvalue for A.

Is that please correct?
Yes, but it would be better if you rephrased your statement to more clearly match the definition of an eigenvector and eigenvalue:
Suppose ##\lambda## and ##\vec v## are eigenvalue and eigenvector of ##A##, respectively. For any ##t \in \mathbb{R}##, where ##t \ne 0##, ##A( \vec {tv}) = t A\vec v = t \lambda \vec v = \lambda \vec {tv}##. So ##\vec {tv}## is also an eigenvector of ##A## with the eigenvalue ##\lambda##.
 
  • Like
  • Informative
Likes hutchphd and member 731016
  • #7
FactChecker said:
Yes, but it would be better if you rephrased your statement to more clearly match the definition of an eigenvector and eigenvalue:
Suppose ##\lambda## and ##\vec v## are eigenvalue and eigenvector of ##A##, respectively. For any ##t \in \mathbb{R}##, where ##t \ne 0##, ##A( \vec {tv}) = t A\vec v = t \lambda \vec v = \lambda \vec {tv}##. So ##\vec {tv}## is also an eigenvector of ##A## with the eigenvalue ##\lambda##.
Thank you for your help @FactChecker!
 
  • #8
ChiralSuperfields said:
Thank you for your help @FactChecker!
Actually, I realize that your statement did match the definitions of eigenvector and eigenvalue, but I think that I have rephrased it more as a step-by-step proof.
 
  • Like
Likes member 731016
  • #9
FactChecker said:
Actually, I realize that your statement did match the definitions of eigenvector and eigenvalue, but I think that I have rephrased it more as a step-by-step proof.
Thank you for your reply @FactChecker! Yeah I only just realized the definition of eigenvector is for a value of ##\lambda## not the matrix A too!
 
  • #10
ChiralSuperfields said:
Thank you for your reply @FactChecker! Yeah I only just realized the definition of eigenvector is for a value of ##\lambda## not the matrix A too!
It's for the combination of the matrix, ##A##, and the eigenvalue ##\lambda##
 
  • Like
Likes member 731016
  • #11
FactChecker said:
It's for the combination of the matrix, ##A##, and the eigenvalue ##\lambda##
Oh, thank you for you letting me know @FactChecker !
 

FAQ: Finding eigenvalues and eigenvectors given sub-matrices

What is the general approach to finding eigenvalues and eigenvectors of a matrix using its sub-matrices?

To find eigenvalues and eigenvectors using sub-matrices, one common approach is to partition the matrix into smaller blocks and leverage properties of these blocks. For instance, if the matrix is block diagonal, the eigenvalues of the entire matrix are simply the eigenvalues of the individual blocks. For more complex partitions, one might use techniques like the Schur complement or iterative methods to approximate eigenvalues and eigenvectors.

Can eigenvalues of sub-matrices provide information about the eigenvalues of the original matrix?

Yes, the eigenvalues of sub-matrices can sometimes provide information about the eigenvalues of the original matrix. For example, if a matrix is block diagonal, the eigenvalues of the sub-matrices are the eigenvalues of the original matrix. However, in general, the relationship is more complex, and additional steps are required to relate the eigenvalues of sub-matrices to those of the original matrix.

How do you use the Schur complement to find eigenvalues and eigenvectors?

The Schur complement is a useful tool for finding eigenvalues and eigenvectors of a matrix when it is partitioned into sub-matrices. By expressing the matrix in block form and focusing on the Schur complement of one of the blocks, you can reduce the problem to a smaller matrix. This can simplify the computation of eigenvalues and eigenvectors, especially for large matrices.

Are there specific types of matrices where sub-matrix methods are particularly useful?

Sub-matrix methods are particularly useful for block diagonal matrices, block triangular matrices, and matrices with a known sparsity pattern. These methods can also be beneficial for large sparse matrices where direct computation of eigenvalues and eigenvectors is computationally expensive. By breaking down the matrix into smaller, more manageable sub-matrices, one can often simplify the problem significantly.

What numerical techniques can be employed to find eigenvalues and eigenvectors of sub-matrices?

Numerical techniques such as the QR algorithm, power iteration, and Arnoldi iteration can be employed to find eigenvalues and eigenvectors of sub-matrices. These iterative methods are particularly useful for large matrices where direct methods are impractical. Additionally, software packages like LAPACK and ARPACK provide efficient implementations of these algorithms, making them accessible for practical use.

Similar threads

Replies
7
Views
2K
Replies
3
Views
2K
Replies
4
Views
846
Replies
6
Views
2K
Replies
19
Views
3K
Back
Top