A Novel Randomized XR-Based Preconditioned CholeskyQR Algorithm

11/22/2021
by   Yuwei Fan, et al.
0

CholeskyQR is a simple and fast QR decomposition via Cholesky decomposition, while it has been considered highly sensitive to the condition number. In this paper, we provide a randomized preconditioner framework for CholeskyQR algorithm. Under this framework, two methods (randomized LU-CholeskyQR and randomized QR-CholeskyQR) are proposed and discussed. We prove the proposed preconditioners can effectively reduce the condition number, which is also demonstrated by numerical tests. Abundant numerical tests indicate our methods are more stable and faster than all the existing algorithms and have good scalability.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/11/2020

Randomized Fast Subspace Descent Methods

Randomized Fast Subspace Descent (RFASD) Methods are developed and analy...
research
05/30/2021

A Note On The Randomized Kaczmarz Method With A Partially Weighted Selection Step

In this note we reconsider two known algorithms which both usually conve...
research
03/13/2023

CPQR-based randomized algorithms for generalized CUR decompositions

Based on the column pivoted QR decomposition, we propose some randomized...
research
07/06/2019

A Randomized Algorithm for Edge-Colouring Graphs in O(m√(n)) Time

We present a simple randomized algorithm to edge-colour arbitrary simple...
research
05/19/2023

A randomized algorithm for the QR decomposition-based approximate SVD

Matrix decomposition is a very important mathematical tool in numerical ...
research
09/11/2023

Analysis of Randomized Householder-Cholesky QR Factorization with Multisketching

CholeskyQR2 and shifted CholeskyQR3 are two state-of-the-art algorithms ...
research
06/30/2022

Randomized K-FACs: Speeding up K-FAC with Randomized Numerical Linear Algebra

K-FAC is a successful tractable implementation of Natural Gradient for D...

Please sign up or login with your details

Forgot password? Click here to reset