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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have