Pages that link to "Item:Q1806006"

The following pages link to Four algorithms for the the efficient computation of truncated pivoted QR approximations to a sparse matrix (Q1806006):

Displaying 39 items.

• CUR matrix decompositions for improved data analysis (Q134075) (← links)
• On the low-rank approximation by the pivoted Cholesky decomposition (Q412313) (← links)
• A randomized algorithm for the decomposition of matrices (Q617703) (← links)
• A QR-method for computing the singular values via semiseparable matrices (Q706231) (← links)
• Interpretation and solution of ill-conditioned equations arising in parameter estimation and system identification (Q809038) (← links)
• A randomized algorithm for a tensor-based generalization of the singular value decomposition (Q861021) (← links)
• Generalizing the column-row matrix decomposition to multi-way arrays (Q977471) (← links)
• On the QR decomposition of \({\mathcal {H}}\)-matrices (Q985734) (← links)
• Preconditioners for nonsymmetric linear systems with low-rank skew-symmetric part (Q1643846) (← links)
• Exemplar-based low-rank matrix decomposition for data clustering (Q1711222) (← links)
• Algorithms for computing the QR decomposition of a set of matrices with common columns (Q1879361) (← links)
• An extended DEIM algorithm for subset selection and class identification (Q2051261) (← links)
• Perturbations of the \textsc{Tcur} decomposition for tensor valued data in the Tucker format (Q2159450) (← links)
• Least upper bound of truncation error of low-rank matrix approximation algorithm using QR decomposition with pivoting (Q2231598) (← links)
• Perspectives on CUR decompositions (Q2300772) (← links)
• Randomized algorithms of maximum likelihood estimation with spatial autoregressive models for large-scale networks (Q2329831) (← links)
• Column subset selection problem is UG-hard (Q2637653) (← links)
• Compression of tokamak boundary plasma simulation data using a maximum volume algorithm for matrix skeleton decomposition (Q2699387) (← links)
• A DEIM induced CUR factorization (Q2810324) (← links)
• HOID: higher order interpolatory decomposition for tensors based on Tucker representation (Q2818274) (← links)
• New fast divide-and-conquer algorithms for the symmetric tridiagonal eigenvalue problem (Q2955975) (← links)
• Optimal CUR Matrix Decompositions (Q2968164) (← links)
• Stewart's pivoted QLP decomposition for low‐rank matrices (Q3599960) (← links)
• Randomized algorithms in numerical linear algebra (Q4594242) (← links)
• Literature survey on low rank approximation of matrices (Q4603753) (← links)
• Low Rank Approximation of a Sparse Matrix Based on LU Factorization with Column and Row Tournament Pivoting (Q4610132) (← links)
• Introduction to Communication Avoiding Algorithms for Direct Methods of Factorization in Linear Algebra (Q4637194) (← links)
• Estimating Leverage Scores via Rank Revealing Methods and Randomization (Q5006452) (← links)
• A Distance-Preserving Matrix Sketch (Q5057218) (← links)
• A Generalized CUR Decomposition for Matrix Pairs (Q5070854) (← links)
• Subspaces Analysis for Random Projection UTV Framework (Q5099408) (← links)
• The Computation of Low Multilinear Rank Approximations of Tensors via Power Scheme and Random Projection (Q5112244) (← links)
• Random Sampling and Efficient Algorithms for Multiscale PDEs (Q5132000) (← links)
• Low-Rank Approximation in the Frobenius Norm by Column and Row Subset Selection (Q5146626) (← links)
• Perturbations of CUR Decompositions (Q5857848) (← links)
• Q-less QR decomposition in inner product spaces (Q5962490) (← links)
• A literature survey of matrix methods for data science (Q6068265) (← links)
• Block discrete empirical interpolation methods (Q6593337) (← links)
• Randomized GCUR decompositions (Q6614936) (← links)