Inverse iteration method with a complex parameter
Let \(A\) be a real symmetric \(n\times n\)-matrix with the pairs \((\lambda_ k,\phi_ k)\), \(k=1,\dots,n\) of eigenvalues and the corresponding normalized real eigenvectors. Let \(\inf_{k\neq j}| \lambda_ j-\lambda_ k| > 2c\), \(|\lambda_ j-\lambda| < \varepsilon\) and \(0<\tau < \varepsilon < c/2\). Using the \(l_ 2\)-norm, consider the iteration procedure \((A- (\lambda^{(m)}+i\tau)I)w^{(m)}=z^{(m)}\) with \(\lambda^{(0)}=\lambda\), \(w^{(m)}=u^{(m)}+iv^{(m)}\) and \(z^{(m+1)}=v^{(m)}/\| v^{(m)}\|\) as well as \(\lambda^{(m+1)}=(Az^{(m+1)},z^{(m+1)})\) if \(\| v^{(m)}\| > \| u^{(m)}\|\) and \(\lambda^{(m+1)}=\lambda^{(m)}\) else. Then \(z^{(m)}\to\pm\phi_ j\). An error estimate and numerical examples show that the method is more efficient than the standard one with \(\tau=0\).
- scientific article; zbMATH DE number 665456
- On the real symmetric inverse eigenvalue problem
- Inverse iteration method with multiple cyclotomically shifted parameters
- The Projected Newton Method Has Order $1 + \sqrt 2 $ for the Symmetric Eigenvalue Problem
- Parametrized Newton’s Iteration for Computing an Eigenpair of a Real Symmetric Matrix in an Interval
- A method of recognizing a regular eigenvalue
- Inverse iteration method with multiple cyclotomically shifted parameters
- Iterative method generated by inverse interpolation with additional evaluations
- scientific article; zbMATH DE number 665456 (Why is no real title available?)
- scientific article; zbMATH DE number 1998928 (Why is no real title available?)
- Parametrized Newton’s Iteration for Computing an Eigenpair of a Real Symmetric Matrix in an Interval
- On controllability of the real shifted inverse power iteration
This page was built for publication: Inverse iteration method with a complex parameter
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1201482)
