首页 | 本学科首页   官方微博 | 高级检索  
     检索      


Block Krylov–Schur method for large symmetric eigenvalue problems
Authors:Yunkai Zhou  Yousef Saad
Institution:1. Department of Mathematics, Southern Methodist University, Dallas, TX, 75275, USA
2. Department of Computer Science and Engineering, University of Minnesota, Minneapolis, MN, 55455, USA
Abstract:Stewart’s Krylov–Schur algorithm offers two advantages over Sorensen’s implicitly restarted Arnoldi (IRA) algorithm. The first is ease of deflation of converged Ritz vectors, the second is the avoidance of the potential forward instability of the QR algorithm. In this paper we develop a block version of the Krylov–Schur algorithm for symmetric eigenproblems. Details of this block algorithm are discussed, including how to handle rank deficient cases and how to use varying block sizes. Numerical results on the efficiency of the block Krylov–Schur method are reported.
Keywords:
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号