On Convergence of the DQDS Algorithm for Singular Value Computation

DOI10.1137/060678762zbMath1165.65018OpenAlexW2041144497MaRDI QIDQ3624852

Kensuke Aishima, Masaaki Sugihara, Takayasu Matsuo, Kazuo Murota

Publication date: 30 April 2009

Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/cb13402c17e5e0a327c6d969f39f214c91dc489b

zbMATH Keywords

convergenceglobal convergencesingular value decompositionJohnson boundbidiagonal matrixDQDS algorithmdifferential quotient difference algorithm with shifts

Mathematics Subject Classification ID

Numerical solutions to overdetermined systems, pseudoinverses (65F20)

Related Items (7)

Discrete Lotka-Volterra with shift algorithm for computing matrix eigenvalues and singular values ⋮ A note on the dqds algorithm with Rutishauser's shift for singular values ⋮ Equality conditions for lower bounds on the smallest singular value of a bidiagonal matrix ⋮ Rigorous proof of cubic convergence for the dqds algorithm for singular values ⋮ A shift strategy for superquadratic convergence in the dqds algorithm for singular values ⋮ Superquadratic convergence of DLASQ for computing matrix singular values ⋮ PACF: a precision-adjustable computational framework for solving singular values

Uses Software

• LAPACK

This page was built for publication: On Convergence of the DQDS Algorithm for Singular Value Computation