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

Takeshi Terao, Katsuhisa Ozaki, Takeshi Ogita

研究成果: Conference article査読

抄録

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.

本文言語English
論文番号012067
ジャーナルJournal of Physics: Conference Series
1490
1
DOI
出版ステータスPublished - 2020 6 9
イベント5th International Conference on Mathematics: Pure, Applied and Computation, ICoMPAC 2019 - Surabaya, Indonesia
継続期間: 2019 10 19 → …

ASJC Scopus subject areas

  • Physics and Astronomy(all)

フィンガープリント 「LU-Cholesky QR algorithms for thin QR decomposition in an oblique inner product」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル