.png){kind=icon}
返回
.png){kind=icon}
.png){kind=icon}
摘要
En 中文
A modified m-step Arnoldi algorithm proposed by Jia and Elsner for computing a few selected eigenpairs of large unsymmetric matrices is generalized to its block version. In the new method, we use new modified approximate eigenvectors obtained from a linear combination of Ritz vectors and the wasted (m + 1)th block basis vector, whose residual norms are satisfied with some (p + 1)-dimensional minimization problems. The resulting block Arnoldi algorithm is not only better than the standard m-step one both in theory and in practice but also cheaper than the standard (m + 1)-step one. The relationships among the residual norms of Ritz pairs and those of new approximate eigenpairs are analyzed. Theoretical results show that the new method can overcome the drawback of nonconvergence, which exists in the conventional one in some extent. We carry out some numerical experiments, which exhibit that the new algorithm is more efficient and works better than its counterparts. (C) 2003 Elsevier Inc. All rights reserved.
Keyword:
orthogonal projection
Krylov subspace
block Arnoldi process
Ritz values
Ritz vectors
modified approximate eigenvectors
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.4
论文数:
2.3W
被引数:
3.3W
机构
暂无机构信息
引用论文
.png){kind=icon}
Rubber hand illusion, empathy, and schizotypal experiences in terms of self-other representations橡胶手的错觉，同理心和分裂型经验在自我-他人表征方面.png)
PREAI
.png){kind=icon}
分享.png){kind=icon}
收藏
查看更多内容