REVIEW 2 cited by
A Novel Randomized XR-Based Preconditioned CholeskyQR Algorithm
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
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.
Forward citations
Cited by 2 Pith papers
-
GPU-Parallelizable Randomized Sketch-and-Precondition for Linear Regression using Sparse Sign Sketches
A GPU implementation of sparse-sign-sketch-and-precondition for linear regression scales well on up to 8 NVIDIA A100s, with a novel rejection-sampling sketch generator.
-
RCLUPPr: a new randomized CholeskyQR with LU preconditioning
RCLUPPr, a randomized CholeskyQR variant with LU preconditioning, is shown stable and more applicable to ill-conditioned tall-skinny matrices than prior CholeskyQR-type algorithms.
Discussion (0). Continue with ORCID to comment.