首页> 中文期刊> 《高等学校计算数学学报:英文版》 >A QUASI-REFINED ITERATIVE ALGORITHM BASED ON THE LANCZOS BIORTHOGONALIZATION PROCEDURE FOR LARGE EIGENPROBLEMS

A QUASI-REFINED ITERATIVE ALGORITHM BASED ON THE LANCZOS BIORTHOGONALIZATION PROCEDURE FOR LARGE EIGENPROBLEMS

     

摘要

The two-sided Lanczos method is popular for computing a few selected eigentriplets of large non-Hermitian matrices. However, it has been revealed that the Ritz vectors gained by this method may not converge even if the subspaces are good enough and the associated eigenvalues converge. In order to remedy this drawback, a novel method is proposed which is based on the refined strategy, the quasi-refined idea and the Lanczos biothogonalization procedure, the resulting algorithm is presented. The relationship between the new method and the classical oblique projection technique is also established. We report some numerical experiments and compare the new algorithm with the conventional one, the results show that the former is often more powerful than the latter.

著录项

获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号