Rank revealing Gaussian elimination by the maximum volume concept

DOI10.1016/j.laa.2019.12.037zbMath1439.65051arXiv1802.02746OpenAlexW2786210445WikidataQ126403712 ScholiaQ126403712MaRDI QIDQ1987003

Lukas Schork, Jacek Gondzio

Publication date: 9 April 2020

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1802.02746

zbMATH Keywords

maximum volume submatrixrank revealing factorization

Mathematics Subject Classification ID

Factorization of matrices (15A23) Eigenvalues, singular values, and eigenvectors (15A18) Numerical computation of matrix norms, conditioning, scaling (65F35) Numerical computation of determinants (65F40) Vector spaces, linear dependence, rank, lineability (15A03) Conditioning of matrices (15A12)

Related Items (1)

Revisiting degeneracy, strict feasibility, stability, in linear programming

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A volume associated with \(m{\times}n\) matrices
• On the existence and computation of rank-revealing LU factorizations
• Manifestations of the Schur complement
• Semi-optimal bases for linear dependencies
• Updated triangular factors of the basis to maintain sparsity in the product form simplex method
• Efficient Algorithms for Computing a Strong Rank-Revealing QR Factorization
• Row Modifications of a Sparse Cholesky Factorization
• The least squares problem and pseudo-inverses

This page was built for publication: Rank revealing Gaussian elimination by the maximum volume concept