A shift strategy for superquadratic convergence in the dqds algorithm for singular values

Authors:
Kensuke Aishima;Takayasu Matsuo;Kazuo Murota;Masaaki Sugihara
Affiliations:
-;-;-;-
Venue:
Journal of Computational and Applied Mathematics
Year:
2014

Citing 7
Cited 0

Accurate singular values of bidiagonal matrices

SIAM Journal on Scientific and Statistical Computing
Applied numerical linear algebra

Applied numerical linear algebra
A new O (N(2)) algorithm for the symmetric tridiagonal eigenvalue/eigenvector problem

A new O (N(2)) algorithm for the symmetric tridiagonal eigenvalue/eigenvector problem
LAPACK Users' guide (third ed.)

LAPACK Users' guide (third ed.)
Orthogonal Eigenvectors and Relative Gaps

SIAM Journal on Matrix Analysis and Applications
Algorithm 880: A testing infrastructure for symmetric tridiagonal eigensolvers

ACM Transactions on Mathematical Software (TOMS)
On Convergence of the DQDS Algorithm for Singular Value Computation

SIAM Journal on Matrix Analysis and Applications

Quantified Score

Hi-index	7.29

Visualization

Abstract

A new shift strategy is proposed for the differential quotient difference with shifts (dqds) algorithm for the computation of singular values of bidiagonal matrices. While maintaining global convergence, the proposed shift realizes asymptotic superquadratic convergence of the dqds algorithm.