LU-Cholesky QR algorithms for thin QR decomposition in an oblique inner product

Takeshi Terao, Katsuhisa Ozaki, Takeshi Ogita

Research output: Contribution to journalConference article

Abstract

This paper concerns thin QR decomposition in an oblique inner product. Cholesky QR is known as a fast algorithm for thin QR decomposition. On the other hand, this algorithm is not applicable for ill-conditioned matrices. The preconditioned Cholesky QR algorithms named LU-Cholesky QR for thin QR decomposition are recently proposed. We apply these preconditioning techniques to thin QR decomposition in an oblique inner product.

Original languageEnglish
Article number012067
JournalJournal of Physics: Conference Series
Volume1490
Issue number1
DOIs
Publication statusPublished - 2020 Jun 9
Event5th International Conference on Mathematics: Pure, Applied and Computation, ICoMPAC 2019 - Surabaya, Indonesia
Duration: 2019 Oct 19 → …

ASJC Scopus subject areas

  • Physics and Astronomy(all)

Fingerprint Dive into the research topics of 'LU-Cholesky QR algorithms for thin QR decomposition in an oblique inner product'. Together they form a unique fingerprint.

  • Cite this