Analysis of randomized Householder-Cholesky QR factorization with multisketching
From MaRDI portal
Cites work
- \texttt{pylspack}: parallel algorithms and data structures for sketching, column subset selection, regression, and leverage scores
- A fast randomized algorithm for overdetermined linear least-squares regression
- Accuracy and Stability of Numerical Algorithms
- Communication-optimal parallel and sequential QR and LU factorizations
- Das asymptotische Verteilungsgesetz der Eigenwerte linearer partieller Differentialgleichungen (mit einer Anwendung auf die Theorie der Hohlraumstrahlung).
- Database-friendly random projections: Johnson-Lindenstrauss with binary coins.
- Enlarged Krylov subspace conjugate gradient methods for reducing communication
- Estimating Leverage Scores via Rank Revealing Methods and Randomization
- High-dimensional probability. An introduction with applications in data science
- scientific article; zbMATH DE number 2086663 (Why is no real title available?)
- scientific article; zbMATH DE number 3248502 (Why is no real title available?)
- scientific article; zbMATH DE number 3408799 (Why is no real title available?)
- Implementation of the GMRES Method Using Householder Transformations
- LAPACK Users' Guide
- Low-distortion subspace embeddings in input-sparsity time and applications to robust linear regression
- Randomized Gram-Schmidt process with application to GMRES
- Roundoff error analysis of the CholeskyQR2 algorithm
- s-step iterative methods for symmetric linear systems
- Shifted Cholesky QR for computing the QR factorization of ill-conditioned matrices
- Sketching as a tool for numerical linear algebra
- The block conjugate gradient algorithm and related methods
Cited in
(3)
This page was built for publication: Analysis of randomized Householder-Cholesky QR factorization with multisketching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6913931)