On Rank-Revealing Factorisations
From MaRDI portal
Recommendations
Cited in
(66)- On selecting a maximum volume sub-matrix of a matrix and related problems
- Parallel codes for computing the numerical rank
- Improved bound for rank revealing LU factorizations
- On the existence and computation of rank-revealing LU factorizations
- Symbiosis between linear algebra and optimization
- SVD update methods for large matrices and applications
- SCDM-k: localized orbitals for solids via selected columns of the density matrix
- Strong rank revealing LU factorizations
- Exponential inapproximability of selecting a maximum volume sub-matrix
- Deviation maximization for rank-revealing QR factorizations
- An efficient algorithm for computing the approximate t-URV and its applications
- Reduction of multivariate mixtures and its applications
- Least upper bound of truncation error of low-rank matrix approximation algorithm using QR decomposition with pivoting
- Convergence to diagonal form of block Jacobi-type methods
- Time and space efficient generators for quasiseparable matrices
- Fast linear algebra is stable
- Column subset selection problem is UG-hard
- Symmetric rank revealing factorizations
- A new selection operator for the discrete empirical interpolation method -- improved a priori error bound and extensions
- A fast memory efficient construction algorithm for hierarchically semi-separable representations
- Gram-Schmidt orthogonalization: 100 years and more
- The Discrete Empirical Interpolation Method: Canonical Structure and Formulation in Weighted Inner Product Spaces
- New studies of randomized augmentation and additive preprocessing
- scientific article; zbMATH DE number 4063273 (Why is no real title available?)
- Some Applications of the Rank Revealing QR Factorization
- Computing rank-revealing QR factorizations of dense matrices
- Algorithm 782
- scientific article; zbMATH DE number 741106 (Why is no real title available?)
- Literature survey on low rank approximation of matrices
- Low Rank Approximation of a Sparse Matrix Based on LU Factorization with Column and Row Tournament Pivoting
- Effectively subsampled quadratures for least squares polynomial approximations
- Disentanglement via Entanglement: A Unified Method for Wannier Localization
- scientific article; zbMATH DE number 4592 (Why is no real title available?)
- Efficient Algorithms for Computing a Strong Rank-Revealing QR Factorization
- Low rank approximation of binary matrices: column subset selection and generalizations
- Fast and Accurate Gaussian Kernel Ridge Regression Using Matrix Decompositions for Preconditioning
- Estimating Leverage Scores via Rank Revealing Methods and Randomization
- CUR LRA at Sublinear Cost Based on Volume Maximization
- A generalized CUR decomposition for matrix pairs
- The Computation of Low Multilinear Rank Approximations of Tensors via Power Scheme and Random Projection
- Low-Rank Approximation in the Frobenius Norm by Column and Row Subset Selection
- Randomized approximation of the Gram matrix: exact computation and probabilistic bounds
- Subspace Iteration Randomization and Singular Value Problems
- A nonlinear QR algorithm for banded nonlinear eigenvalue problems
- A variation of RRQR decomposition based on Gershgorin disk theorem
- Estimation of atmospheric PSF parameters for hyperspectral imaging.
- An algebraic multifrontal preconditioner that exploits the low-rank property.
- A Newton method for rigid body frictional impact with multiple simultaneous impact points
- Pass-efficient truncated UTV for low-rank approximations
- Efficient algorithms for computing rank‐revealing factorizations on a GPU
- Block discrete empirical interpolation methods
- A stochastic perturbation analysis of the QR decomposition and its applications
- Estimating a matrix's singular values with interpolative decompositions
- A statistical view of column subset selection
- Interior point methods are not worse than simplex
- Block generalized minimal residual method
- Sparse linear least-squares problems
- New algebraic fast algorithms for N-body problems in two and three dimensions
- Structure-aware analyses and algorithms for interpolative decompositions
- A QR-method for computing the singular values via semiseparable matrices
- On the computation of accurate initial conditions for linear higher-index differential-algebraic equations and its application in initial value solvers
- Canonically centered coordinates for Grassmann interpolation: Lagrange, Hermite, and errors
- Computing Strong Rank-Revealing Factorizations for Matrices with Orthonormal Rows
- Collect, commit, expand: efficient CPQR-based column selection for extremely wide matrices
- Column subset selection via sparse approximation of SVD
- On the solution of large-scale algebraic Riccati equations by using low-dimensional invariant subspaces
This page was built for publication: On Rank-Revealing Factorisations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4292687)
