Pages that link to "Item:Q3987930"

The following pages link to Rank-Revealing QR Factorizations and the Singular Value Decomposition (Q3987930):

Displaying 39 items.

• Simple varieties for limited precision points (Q385012) (← links)
• Column subset selection via sparse approximation of SVD (Q764372) (← links)
• On the solution of large-scale algebraic Riccati equations by using low-dimensional invariant subspaces (Q896864) (← links)
• On iterative QR pre-processing in the parallel block-Jacobi SVD algorithm (Q991114) (← links)
• On selecting a maximum volume sub-matrix of a matrix and related problems (Q1034598) (← links)
• A block algorithm for computing rank-revealing QR factorizations (Q1200543) (← links)
• A theory of pseudoskeleton approximations (Q1362649) (← links)
• Improved bound for rank revealing LU factorizations (Q1362659) (← links)
• Componentwise analysis of direct factorization of real symmetric and Hermitian matrices (Q1379115) (← links)
• On the existence and computation of rank-revealing LU factorizations (Q1587285) (← links)
• Strong rank revealing LU factorizations (Q1873693) (← links)
• Exponential inapproximability of selecting a maximum volume sub-matrix (Q1939669) (← links)
• Structural instability analyses based on generalised path-following (Q1971464) (← links)
• Deviation maximization for rank-revealing QR factorizations (Q2084250) (← links)
• Pass-efficient methods for compression of high-dimensional turbulent flow data (Q2123807) (← links)
• Least upper bound of truncation error of low-rank matrix approximation algorithm using QR decomposition with pivoting (Q2231598) (← links)
• A block \(\mathrm{GCROT}(m, k)\) method for linear systems with multiple right-hand sides (Q2252728) (← links)
• Random multipliers numerically stabilize Gaussian and block Gaussian elimination: proofs and an extension to low-rank approximation (Q2350005) (← links)
• Fast linear algebra is stable (Q2461610) (← links)
• A note on properties and computations of matrix pseudospectra (Q2489346) (← links)
• Column subset selection problem is UG-hard (Q2637653) (← links)
• A Fast Memory Efficient Construction Algorithm for Hierarchically Semi-Separable Representations (Q2797105) (← links)
• Gram-Schmidt orthogonalization: 100 years and more (Q2931519) (← links)
• Rank deficiencies and bifurcation into affine subspaces for separable parameterized equations (Q3450038) (← 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)
• Spectral division methods for block generalized Schur decompositions (Q4813611) (← links)
• Sparse Polynomial Chaos Expansions: Literature Survey and Benchmark (Q4995117) (← links)
• (Q5005143) (← links)
• Fast and Accurate Gaussian Kernel Ridge Regression Using Matrix Decompositions for Preconditioning (Q5006445) (← links)
• Efficient Construction of Tensor Ring Representations from Sampling (Q5006479) (← links)
• The Computation of Low Multilinear Rank Approximations of Tensors via Power Scheme and Random Projection (Q5112244) (← links)
• Randomized Approximation of the Gram Matrix: Exact Computation and Probabilistic Bounds (Q5251753) (← links)
• Subspace Iteration Randomization and Singular Value Problems (Q5254699) (← links)
• A Nonlinear QR Algorithm for Banded Nonlinear Eigenvalue Problems (Q5270767) (← links)
• Hierarchical Cholesky decomposition of sparse matrices arising from curl–curl-equation (Q5446877) (← links)
• Simpler is better: a comparative study of randomized pivoting algorithms for CUR and interpolative decompositions (Q6052452) (← links)
• Algebraic inverse fast multipole method: a fast direct solver that is better than HODLR based fast direct solver (Q6119254) (← links)
• A fast randomized algorithm for computing an approximate null space (Q6161581) (← links)