TY - JOUR
T1 - LU-Cholesky QR algorithms for thin QR decomposition in an oblique inner product
AU - Terao, Takeshi
AU - Ozaki, Katsuhisa
AU - Ogita, Takeshi
N1 - Publisher Copyright:
© Published under licence by IOP Publishing Ltd.
PY - 2020/6/9
Y1 - 2020/6/9
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=85088122118&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85088122118&partnerID=8YFLogxK
U2 - 10.1088/1742-6596/1490/1/012067
DO - 10.1088/1742-6596/1490/1/012067
M3 - Conference article
AN - SCOPUS:85088122118
SN - 1742-6588
VL - 1490
JO - Journal of Physics: Conference Series
JF - Journal of Physics: Conference Series
IS - 1
M1 - 012067
T2 - 5th International Conference on Mathematics: Pure, Applied and Computation, ICoMPAC 2019
Y2 - 19 October 2019
ER -