Numerical methods for large eigenvalue problems

Numerical methods for large eigenvalue problems
复制标题

DOI:
10.1017/s0962492902000089
复制
发表时间:
2002-01
期刊:
影响因子:
14.2
通讯作者:
D. Sorensen
D. Sorensen
中科院分区:
数学1区
文献类型:
--
作者:
D. Sorensen

文献摘要

被引文献

相似文献

在过去的十年里,大规模特征值问题的数值求解,特别是非对称矩阵的数值求解,已经取得了长足的进步。Krylov方法和子空间迭代的变体已经改进到可以解决数百万个变量的数量级问题的地步。对导致这些进步的方法和软件进行了综述。
Over the past decade considerable progress has been made towards the numerical solution of large-scale eigenvalue problems, particularly for nonsymmetric matrices. Krylov methods and variants of subspace iteration have been improved to the point that problems of the order of several million variables can be solved. The methods and software that have led to these advances are surveyed.