Affordable Access

Publisher Website

On Kogbetliantz's SVD Algorithm in the Presence of Clusters

Authors
Journal
Linear Algebra and its Applications
0024-3795
Publisher
Elsevier
Publication Date
Volume
95
Identifiers
DOI: 10.1016/0024-3795(87)90031-0
Disciplines
  • Computer Science

Abstract

Abstract We consider matrices with off-diagonal blocks of small norm and derive tight bounds for the approximation of their singular values by those of their diagonal blocks. These results are used to show that triangular matrices with clusters of singular values must possess a principal submatrix of “nearly” diagonal form. From the latter we then derive results pertaining to the quadratic convergence of Kogbetliantz's algorithm for computing the SVD, in the presence of clusters.

There are no comments yet on this publication. Be the first to share your thoughts.