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

计算部分奇异值分解的隐式重新启动的双对角化Lanczos方法和精化的双对角化Lanczos方法
引用本文:贾仲孝,牛大田. 计算部分奇异值分解的隐式重新启动的双对角化Lanczos方法和精化的双对角化Lanczos方法[J]. 计算数学, 2004, 26(1): 13-24
作者姓名:贾仲孝  牛大田
作者单位:清华大学数学科学系,北京,100084;大连理工大学应用数学系,大连,116024
基金项目:国家重点基础研究专项基金(G19990328)资助项目.
摘    要:The singular value decomposition problem is mathematically equivalent to the eigenproblem of an argumented matrix. Golub et al. give a bidiagonalization Lanczos method for computing a number of largest or smallest singular values and corresponding singular vertors, but the method may encounter some convergence problems. In this paper we analyse the convergence of the method and show why it may fail to converge. To correct this possible nonconvergence, we propose a refined bidiagonalization Lanczos method and apply the implicitly restarting technique to it, and we then present an implicitly restarted bidiagonalization Lanczos algorithm(IRBL) and an implicitly restarted refined bidiagonalization Lanczos algorithm (IRRBL). A new implicitly restarting scheme and a reliable and efficient algorithm for computing refined shifts are developed for this special structure eigenproblem.Theoretical analysis and numerical experiments show that IRRBL performs much better than IRBL.

关 键 词:奇异值  奇异向量  双对角化Lanczos方法  Ritz值  Ritz向量  精化双对角化Lanczos方法  精化向量  隐式重新启动  准确位移  精化位移  收敛性

IMPLICITLY RESTARTING THE LANCZOS METHOD AND THE REFINED LANCZOS METHOD FOR COMPUTING A PARTIAL SINGULAR VALUE DECOMPOSITION
Jia Zhongxiao. IMPLICITLY RESTARTING THE LANCZOS METHOD AND THE REFINED LANCZOS METHOD FOR COMPUTING A PARTIAL SINGULAR VALUE DECOMPOSITION[J]. Mathematica Numerica Sinica, 2004, 26(1): 13-24
Authors:Jia Zhongxiao
Affiliation:Jia Zhongxiao (Department of Mathematical Sciences, Tsinghua University, Beijing, 100084)Niu Datian (Department of Applied Mathematics, Dalian University of Technology, Dalian, 116024)
Abstract:The singular value decomposition problem is mathematically equivalent to the eigenproblem of an argumented matrix. Golub et al. give a bidiagonalization Lanczos method for computing a number of largest or smallest singular values and corresponding singular vertors, but the method may encounter some convergence problems. In this paper we analyse the convergence of the method and show why it may fail to converge. To correct this possible nonconvergence, we propose a refined bidiagonalization Lanczos method and apply the implicitly restarting technique to it, and we then present an implicitly restarted bidiagonalization Lanczos algorithm (IRBL) and an implicitly restarted refined bidiagonalization Lanczos algorithm (IRRBL). A new implicitly restarting scheme and a reliable and efficient algorithm for computing refined shifts are developed for this special structure eigenproblem. Theoretical analysis and numerical experiments show that IRRBL performs much better than IRBL.
Keywords:singular value   singular vector   Lanczos method   Ritz value   Ritz vector   refined Lanczos method   refined vector   implicit restart   exact shift   refined shift   convergence  
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《计算数学》浏览原始摘要信息
点击此处可从《计算数学》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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