.png){kind=icon}
返回
Computing an eigenvector with inverse iteration
.png){kind=icon}
PRE
AI
DOI：10.1137/S0036144596300773.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The purpose of this paper is two-fold: to analyze the behavior of inverse iteration for computing a single eigenvector of a complex square matrix and to review Jim Wilkinson's contributions to the development of the method. In the process rye derive several new results regarding the convergence of inverse iteration in exact arithmetic. In the case of normal matrices we show that residual norms decrease strictly monotonically. For eighty percent of the starting vectors a single iteration is enough. In the case of non-normal matrices, we she-iv that the iterates converge asymptotically to an invariant subspace. However, the residual norms may not converge. The growth in residual norms from one iteration to the next can exceed the departure of the matrix from normality. Mie present an example where the residual growth is exponential in the departure of the matrix from normality. mie also explain the often significant regress of the residuals after the first iteration: it occurs when the non-normal part of the matrix is large compared to the eigenvalues of smallest magnitude. In this case computing an eigenvector with inverse iteration is exponentially ill conditioned (in exact arithmetic). We conclude that the behavior of the residuals in inverse iteration is governed by the departure of the matrix from normality rather than by the conditioning of a Jordan basis or the defectiveness of eigenvalues.
Keyword:
eigenvector
invariant subspace
inverse iteration
departure from normality
ill-conditioned linear system
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.1
论文数:
888
被引数:
1.2W
机构
暂无机构信息
引用论文
Pro → Ala‐35 Rhodobacter capsulatus cytochrome c2 shows dynamic not structural differences.png)
FEBS Letters
OAAI
FEBS LettersIF0
OAAI分享收藏
查看更多内容