Randomized QR with Column Pivoting
From MaRDI portal
Publication:5348261
DOI10.1137/15M1044680zbMath1371.65026arXiv1509.06820MaRDI QIDQ5348261
No author found.
Publication date: 15 August 2017
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1509.06820
singular value decompositionparallel computationrandom samplingQR factorizationlow-rank approximationcolumn pivotingtruncated SVDblocked algorithmsample update
Numerical solutions to overdetermined systems, pseudoinverses (65F20) Parallel numerical computation (65Y05) Direct numerical methods for linear systems and matrix inversion (65F05)
Related Items (15)
Randomized numerical linear algebra: Foundations and algorithms ⋮ Randomized Local Model Order Reduction ⋮ Randomized Complete Pivoting for Solving Symmetric Indefinite Linear Systems ⋮ Randomized quaternion QLP decomposition for low-rank approximation ⋮ Randomized QLP decomposition ⋮ A training set subsampling strategy for the reduced basis method ⋮ Efficient Randomized Algorithms for the Fixed-Precision Low-Rank Matrix Approximation ⋮ Subspaces Analysis for Random Projection UTV Framework ⋮ Pass-efficient truncated UTV for low-rank approximations ⋮ Computing Localized Representations of the Kohn--Sham Subspace Via Randomization and Refinement ⋮ Randomized Projection for Rank-Revealing Matrix Factorizations and Low-Rank Approximations ⋮ Flip-flop spectrum-revealing QR factorization and its applications to singular value decomposition ⋮ ALORA: affine low-rank approximations ⋮ Deviation maximization for rank-revealing QR factorizations ⋮ Single-pass randomized QLP decomposition for low-rank approximation
Cites Work
- Unnamed Item
- Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions
- Rang revealing QR factorizations
- A randomized algorithm for the decomposition of matrices
- On the convergence of Stewart's QLP algorithm for approximating the SVD
- Communication-optimal Parallel and Sequential QR and LU Factorizations
- Randomized algorithms for the low-rank approximation of matrices
- Minimizing Communication in Numerical Linear Algebra
- Extensions of Lipschitz mappings into a Hilbert space
- Communication Avoiding Rank Revealing QR Factorization with Column Pivoting
- The WY Representation for Products of Householder Matrices
- A Storage-Efficient $WY$ Representation for Products of Householder Transformations
- Some Applications of the Rank Revealing QR Factorization
- The QLP Approximation to the Singular Value Decomposition
- A BLAS-3 Version of the QR Factorization with Column Pivoting
- Efficient Algorithms for Computing a Strong Rank-Revealing QR Factorization
- A Parallel QR Factorization Algorithm with Controlled Local Pivoting
This page was built for publication: Randomized QR with Column Pivoting