Four algorithms for the the efficient computation of truncated pivoted QR approximations to a sparse matrix
From MaRDI portal
Publication:1806006
DOI10.1007/s002110050451zbMath0957.65031OpenAlexW2132582398MaRDI QIDQ1806006
Publication date: 11 March 2001
Published in: Numerische Mathematik (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s002110050451
algorithmssingular value decompositionsparse matricesGram-Schmidt algorithmHouseholder triangularizationpivoted QR decompositions
Computational methods for sparse matrices (65F50) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Numerical solutions to overdetermined systems, pseudoinverses (65F20)
Related Items
A Distance-Preserving Matrix Sketch, Column subset selection problem is UG-hard, Preconditioners for nonsymmetric linear systems with low-rank skew-symmetric part, A Generalized CUR Decomposition for Matrix Pairs, A randomized algorithm for a tensor-based generalization of the singular value decomposition, Perturbations of the \textsc{Tcur} decomposition for tensor valued data in the Tucker format, Subspaces Analysis for Random Projection UTV Framework, A randomized algorithm for the decomposition of matrices, A literature survey of matrix methods for data science, Randomized algorithms in numerical linear algebra, New fast divide-and-conquer algorithms for the symmetric tridiagonal eigenvalue problem, The Computation of Low Multilinear Rank Approximations of Tensors via Power Scheme and Random Projection, Literature survey on low rank approximation of matrices, Optimal CUR Matrix Decompositions, Low Rank Approximation of a Sparse Matrix Based on LU Factorization with Column and Row Tournament Pivoting, Compression of tokamak boundary plasma simulation data using a maximum volume algorithm for matrix skeleton decomposition, Exemplar-based low-rank matrix decomposition for data clustering, Random Sampling and Efficient Algorithms for Multiscale PDEs, Low-Rank Approximation in the Frobenius Norm by Column and Row Subset Selection, Introduction to Communication Avoiding Algorithms for Direct Methods of Factorization in Linear Algebra, A QR-method for computing the singular values via semiseparable matrices, Generalizing the column-row matrix decomposition to multi-way arrays, On the QR decomposition of \({\mathcal {H}}\)-matrices, Q-less QR decomposition in inner product spaces, CUR matrix decompositions for improved data analysis, A DEIM Induced CUR Factorization, Perspectives on CUR decompositions, An extended DEIM algorithm for subset selection and class identification, HOID: Higher Order Interpolatory Decomposition for Tensors Based on Tucker Representation, Randomized algorithms of maximum likelihood estimation with spatial autoregressive models for large-scale networks, Estimating Leverage Scores via Rank Revealing Methods and Randomization, Perturbations of CUR Decompositions, Interpretation and solution of ill-conditioned equations arising in parameter estimation and system identification
