Subset selection for matrices

DOI10.1016/J.LAA.2006.08.034MaRDI QIDQ874986zbMATH OpenOpenAlexFDO

Authors F. R. De Hoog, R. M. M. Mattheij

Publication date 10 April 2007

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

Full work available at URL https://doi.org/10.1016/j.laa.2006.08.034

zbMATH Keywords

optimally conditioned submatricesselection of submatricessingular values

Mathematics Subject Classification ID

Theory of matrix inversion and generalized inverses (15A09) Inequalities involving eigenvalues and eigenvectors (15A42) Norms of matrices, numerical range, applications of functional analysis to matrix theory (15A60)

Review text

The authors consider the question of how to delete \(m - k\) rows from an \(m \times n\) real matrix \(X\) so that the resulting \(k \times n\) matrix \(A\) is as nonsingular as possible. They derive bounds for the singular values of \(A\) which decrease only algebraically with \(m\) and \(n\). Applications of these bounds are also given.

Recommendations

• Subset selection in sparse matrices
• A note on subset selection for matrices
• Subset selection for matrices with fixed blocks
• Faster subset selection for matrices and applications
• Matrix choosability
• scientific article; zbMATH DE number 6982912
• Column subset selection, matrix factorization, and eigenvalue optimization
• Feature subset selection using separability index matrix
• Determinant and Exchange Algorithms for Observation Subset Selection

Cites work

• Extensions and Applications of the Householder Algorithm for Solving Linear Least Squares Problems
• Handbook series linear algebra. Linear least squares solutions by Householder transformations
• scientific article; zbMATH DE number 3176344 (Why is no real title available?)
• scientific article; zbMATH DE number 3892457 (Why is no real title available?)
• scientific article; zbMATH DE number 3336999 (Why is no real title available?)
• Incomplete cross approximation in the mosaic-skeleton method
• On the Conditioning of Multipoint and Integral Boundary Value Problems

Cited in

(19)

• On selecting a maximum volume sub-matrix of a matrix and related problems
• Optimal column subset selection for image classification by genetic algorithms
• Pseudo-skeleton approximations with better accuracy estimates
• Rectangular maximum-volume submatrices and their applications
• Exponential inapproximability of selecting a maximum volume sub-matrix
• Subset selection for matrices with fixed blocks
• Column subset selection is NP-complete
• Column subset selection problem is UG-hard
• scientific article; zbMATH DE number 6982912 (Why is no real title available?)
• Extracting a basis with fixed block inside a matrix
• Proportional volume sampling and approximation algorithms for \(A\)-optimal design
• Determinant and Exchange Algorithms for Observation Subset Selection
• A note on subset selection for matrices
• Bayesian D-optimal experimental designs via column subset selection
• Approximating total effective resistance minimization with small budget
• Subset selection for matrices in spectral norm
• Approximating total effective resistance minimization with small budget
• Subset selection for matrices by volume sampling
• Column subset selection via sparse approximation of SVD

This page was built for publication: Subset selection for matrices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q874986)