Efficient implementations of the modified Gram–Schmidt orthogonalization with a non-standard inner product
- 28 Downloads
The modified Gram–Schmidt (MGS) orthogonalization is one of the most well-used algorithms for computing the thin QR factorization. MGS can be straightforwardly extended to a non-standard inner product with respect to a symmetric positive definite matrix A. For the thin QR factorization of an \(m \times n\) matrix with the non-standard inner product, a naive implementation of MGS requires 2n matrix-vector multiplications (MV) with respect to A. In this paper, we propose n-MV implementations: a high accuracy (HA) type and a high performance type, of MGS. We also provide error bounds of the HA-type implementation. Numerical experiments and analysis indicate that the proposed implementations have competitive advantages over the naive implementation in terms of both computational cost and accuracy.
KeywordsModified Gram–Schmidt orthogonalization Non-standard inner product Efficient implementations Error bounds
- 3.ELSES matrix library. http://www.elses.jp/matrix/. Accessed 15 Apr 2018
- 10.Lowery, B.R., Langou, J.: Stability analysis of QR factorization in an oblique inner product. arXiv:1401.5171 [math.NA] (2014)
- 17.Yanagisawa, Y., Nakatsukasa, Y., Fukaya, T.: Cholesky-QR and Householder-QR factorizations in nonstandard inner product spaces. International Workshop on Eigenvalue Problems: Algorithms; Software and Applications, in Petascale Computing (EPASA2014) (2014)Google Scholar
- 18.Zhao, J.Q.: S-Orthogonal QR decomposition algorithms on multicore systems. ProQuest Dissertations Publishing, University of California, Davis (2013)Google Scholar