A shift strategy for superquadratic convergence in the dqds algorithm for singular values
DOI10.1016/j.cam.2013.08.021zbMath1294.65043OpenAlexW2087276227MaRDI QIDQ2252236
Kazuo Murota, Takayasu Matsuo, Kensuke Aishima, Masaaki Sugihara
Publication date: 16 July 2014
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2013.08.021
global convergencesingular valuebidiagonal matrixsuperquadratic convergencedifferential quotient difference with shifts (dqds) algorithm
Numerical solutions to overdetermined systems, pseudoinverses (65F20) Eigenvalues, singular values, and eigenvectors (15A18)
Related Items (4)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A Wilkinson-like multishift QR algorithm for symmetric eigenvalue problems and its global convergence
- A note on the dqds algorithm with Rutishauser's shift for singular values
- Rigorous proof of cubic convergence for the dqds algorithm for singular values
- Accurate singular values and differential qd algorithms
- Multiple representations to compute orthogonal eigenvectors of symmetric tridiagonal matrices
- An implementation of the dqds algorithm (positive case)
- Accurate Singular Values of Bidiagonal Matrices
- On Convergence of the DQDS Algorithm for Singular Value Computation
- LAPACK Users' Guide
- Orthogonal Eigenvectors and Relative Gaps
- Über eine kubisch konvergente Variante der LR‐Transformation
This page was built for publication: A shift strategy for superquadratic convergence in the dqds algorithm for singular values
