A note on the dqds algorithm with Rutishauser's shift for singular values

被引：2

作者：

Aishima, Kensuke ^{[1
]}

Matsuo, Takayasu ^{[1
]}

Murota, Kazuo ^{[1
]}

机构：

[1] Univ Tokyo, Grad Sch Informat Sci & Technol, Dept Math Informat, Tokyo, Japan

来源：

JAPAN JOURNAL OF INDUSTRIAL AND APPLIED MATHEMATICS | 2011年 / 28卷 / 02期

基金：

日本学术振兴会;

关键词：

Numerical linear algebra; Singular value; Iterative method; CONVERGENCE;

D O I：

10.1007/s13160-011-0037-x

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

We consider the behavior of the dqds algorithm with Rutishauser's shift for computing singular values of matrices. In our previous paper Aishima et al. (Jpn J Ind Appl Math 25:65-81, 2008), it has been proved that the algorithm asymptotically achieves cubic convergence; i.e., possibly after some "transient" period with seemingly random shift choices, the system finally reaches its final phase of convergence, where Rutishauser's shift is chosen continuously and the convergence becomes cubic. In actual numerical examples, however, often the situation is far simpler. Once Rutishauser's shift becomes valid, it is continuously chosen, and we find no such "transient" phase in practice. In this paper we give a theoretical explanation for the phenomenon, to fill the gap between the numerical observation and the theory.

引用

页码：251 / 262

页数：12