Approximation of eigenvalue with inverse iteration method

Click For Summary
SUMMARY

The discussion focuses on the approximation of the eigenvalue using the inverse iteration method with a specific matrix: $\begin{pmatrix}2 & 1/2 & 1 \\ 1/2 & 3/2 & 1/2 \\ 1 & 1/2 & 2\end{pmatrix}$. The initial approximation for the second eigenvalue, $\lambda_2$, is set at 1.2, and the starting vector is $x^{(0)}=\begin{pmatrix}1 \\ 1\\ 1\end{pmatrix}$. Participants agree that the Rayleigh quotient should be applied at each iteration to enhance the approximation of both the eigenvalue and eigenvector, rather than relying solely on the power iteration method, which is limited to the largest eigenvalue.

PREREQUISITES
  • Understanding of eigenvalues and eigenvectors
  • Familiarity with the inverse iteration method
  • Knowledge of the Rayleigh quotient
  • Basic linear algebra concepts
NEXT STEPS
  • Study the Rayleigh quotient iteration method in detail
  • Explore the inverse iteration method with practical examples
  • Learn about the limitations of the power iteration method
  • Investigate numerical methods for eigenvalue problems in linear algebra
USEFUL FOR

Mathematicians, data scientists, and engineers involved in numerical analysis, particularly those focusing on eigenvalue problems and iterative methods for matrix computations.

mathmari
Gold Member
MHB
Messages
4,984
Reaction score
7
Hey! :giggle:

We have the matrix $\begin{pmatrix}2 & 1/2 & 1 \\ 1/2 & 3/2 & 1/2 \\ 1 & 1/2 & 2\end{pmatrix}$.
We take as initial approximation of $\lambda_2$ the $1.2$. We want to calculate this value approximately using the inverse iteration (2 steps) using as starting vector $x^{(0)}=\begin{pmatrix}1 \\ 1\\ 1\end{pmatrix}$.

At the inverse iteration method do we have to use at each step the Rayleigh-Quotient or only at the beginning and then just the power iteration ?
I think to get a better approximation that we have to use the Rayleigh-Quotient at each step. Is that correct?

:unsure:
 
Physics news on Phys.org
Hey mathmari!

It seems to me that we cannot use the power iteration method, since it can only find the eigenvalue with the greatest magnitude.
Instead we can use the inverse iteration method, which finds an eigenvector given an approximation of the eigenvalue, which does not improve the eigenvalue.
Or we can use the Rayleigh quotient iteration method, which is an extension of the inverse iteration method. It improves the eigenvalue as well as the eigenvector.

Since the initial eigenvalue approximation is still a bit off, it seems to me that it's best to use the Rayleigh quotient iteration for every iteration.
Or else we should try some variants and see what works best. :unsure:
 
Klaas van Aarsen said:
It seems to me that we cannot use the power iteration method, since it can only find the eigenvalue with the greatest magnitude.
Instead we can use the inverse iteration method, which finds an eigenvector given an approximation of the eigenvalue, which does not improve the eigenvalue.
Or we can use the Rayleigh quotient iteration method, which is an extension of the inverse iteration method. It improves the eigenvalue as well as the eigenvector.

Since the initial eigenvalue approximation is still a bit off, it seems to me that it's best to use the Rayleigh quotient iteration for every iteration.
Or else we should try some variants and see what works best. :unsure:

Ok! Thank you for your answer! 🤩
 

Similar threads

  • · Replies 4 ·
Replies
4
Views
1K
  • · Replies 21 ·
Replies
21
Views
4K
Replies
10
Views
2K
  • · Replies 14 ·
Replies
14
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 9 ·
Replies
9
Views
3K
  • · Replies 5 ·
Replies
5
Views
2K
Replies
2
Views
2K
  • · Replies 1 ·
Replies
1
Views
10K
  • · Replies 10 ·
Replies
10
Views
3K