Subset selection for matrices

DOI10.1016/j.laa.2006.08.034zbMath1158.15017OpenAlexW2161921901MaRDI QIDQ874986

Frank R. de Hoog, Robert 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

singular valuesoptimally conditioned submatricesselection of submatrices

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)

Related Items (12)

Optimal column subset selection for image classification by genetic algorithms ⋮ Column subset selection problem is UG-hard ⋮ Proportional Volume Sampling and Approximation Algorithms for A-Optimal Design ⋮ Pseudo-skeleton approximations with better accuracy estimates ⋮ Rectangular maximum-volume submatrices and their applications ⋮ Exponential inapproximability of selecting a maximum volume sub-matrix ⋮ A note on subset selection for matrices ⋮ Column subset selection is NP-complete ⋮ Extracting a basis with fixed block inside a matrix ⋮ Subset selection for matrices with fixed blocks ⋮ Column subset selection via sparse approximation of SVD ⋮ On selecting a maximum volume sub-matrix of a matrix and related problems

Cites Work

• Incomplete cross approximation in the mosaic-skeleton method
• Handbook series linear algebra. Linear least squares solutions by Householder transformations
• On the Conditioning of Multipoint and Integral Boundary Value Problems
• Extensions and Applications of the Householder Algorithm for Solving Linear Least Squares Problems
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Subset selection for matrices