Computing rank-revealing QR factorizations of dense matrices
From MaRDI portal
Recommendations
Cited in
(48)- A block algorithm for computing rank-revealing QR factorizations
- Parallel codes for computing the numerical rank
- On the existence and computation of rank-revealing LU factorizations
- On the computation of the Jordan canonical form of regular matrix polynomials
- Rank revealing Gaussian elimination by the maximum volume concept
- A locally optimal rank revealing product decomposition
- Deviation maximization for rank-revealing QR factorizations
- Properties of the CMP inverse and its computation
- Fast linear algebra is stable
- Dynamic block GMRES: An iterative method for block linear systems
- Parallel spectral division using the matrix sign function for the generalized eigenproblem
- A new selection operator for the discrete empirical interpolation method -- improved a priori error bound and extensions
- Numerical Linear Algebra Methods for Linear Differential-Algebraic Equations
- Rank-revealing decomposition of symmetric indefinite matrices via block anti-triangular factorization
- A randomized blocked algorithm for efficiently computing rank-revealing factorizations of matrices
- LU factorization with panel rank revealing pivoting and its communication avoiding version
- Gram-Schmidt orthogonalization: 100 years and more
- Factorized solution of the Lyapunov equation by using the hierarchical matrix arithmetic
- Accurate matrix factorization: Inverse LU and inverse QR factorizations
- Communication avoiding rank revealing QR factorization with column pivoting
- A rank-revealing method with updating, downdating, and applications. II
- Nonnegative diagonals and high performance on low-profile matrices from Householder QR
- Simple varieties for limited precision points
- Structure-Preserving and Rank-Revealing QR-Factorizations
- Rank Detection Methods for Sparse Matrices
- Algorithm 782
- On Rank-Revealing Factorisations
- Low‐rank revealing QR factorizations
- scientific article; zbMATH DE number 2090652 (Why is no real title available?)
- Spectral division methods for block generalized Schur decompositions
- Ordering Givens Rotations for Sparse QR Factorization
- Efficient Algorithms for Computing a Strong Rank-Revealing QR Factorization
- Low rank approximation of binary matrices: column subset selection and generalizations
- Estimating Leverage Scores via Rank Revealing Methods and Randomization
- A variation of RRQR decomposition based on Gershgorin disk theorem
- Householder QR factorization with randomization for column pivoting (HQRRP)
- Randomized numerical linear algebra: Foundations and algorithms
- A Newton method for rigid body frictional impact with multiple simultaneous impact points
- A block algorithm for computing antitriangular factorizations of symmetric matrices
- Accelerated Cartesian expansion (ACE) based framework for the rapid evaluation of diffusion, lossy wave, and Klein-Gordon potentials
- Efficient algorithms for computing rank‐revealing factorizations on a GPU
- Exact expressions for the Drazin inverse of anti-triangular matrices
- Block Krylov subspace methods for the computation of structural response to turbulent wind
- Computing \(\{2,4\}\) and \(\{2,3\}\)-inverses by using the Sherman-Morrison formula
- Estimating a matrix's singular values with interpolative decompositions
- A statistical view of column subset selection
- Block generalized minimal residual method
- Block Krylov-Schur method for large symmetric eigenvalue problems
This page was built for publication: Computing rank-revealing QR factorizations of dense matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4256912)
