Abstract

The one-sided block Jacobi method (OSBJ) has attracted attention as a fast and accurate algorithm for the singular value decomposition (SVD). The computational kernel of OSBJ is orthogonalization of a column block pair, which amounts to computing the SVD of this block pair. Hari proposes three methods for this partial SVD, and we found through numerical experiments that the variant named ``V2'', which is based on the Cholesky QR method, is the fastest variant and achieves satisfactory accuracy. While it is a good news from a practical viewpoint, it seems strange considering the well-known instability of the Cholesky QR method. In this paper, we perform a detailed error analysis of the V2 variant and explain why and when it can be used to compute the partial SVD accurately. Thus, our results provide a theoretical support for using the V2 variant safely in the OSBJ method.

Keywords

MSC

65F15, 65F25, 65G50

Cite this article

@article{cai-5118,
  author  = {Shuhei Kudo and Yusaku Yamamoto and Toshiyuki Imamura},
  title   = {Error Analysis of the Cholesky QR-Based Block Orthogonalization Process for the One-Sided Block Jacobi SVD Algorithm},
  journal = {Computing and Informatics},
  volume  = {39},
  number  = {6},
  pages   = {1203--1228},
  year    = {2020},
  issn    = {1335-9150},
  doi     = {10.31577/cai_2020_6_1203}
}
Download .bib