Extracting a basis with fixed block inside a matrix

DOI10.1016/J.LAA.2014.11.016MaRDI QIDQ486196zbMATH OpenOpenAlexFDO

Authors Pierre Youssef

Publication date 14 January 2015

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

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

zbMATH Keywords

rankalgorithmsingular valuesrestricted invertibilitybasissubset selection

Mathematics Subject Classification ID

Eigenvalues, singular values, and eigenvectors (15A18) Vector spaces, linear dependence, rank, lineability (15A03)

Abstract: Given $U$ an $nimesm$ matrix of rank $n$ and $V$ block of columns inside $U$, we consider the problem of extracting a block of columns of rank $n$ which minimize the Hilbert-Schmidt norm of the inverse while preserving the block $V$. This generalizes a previous result of Gluskin-Olevskii, and improves the estimates when given a "good" block $V$.

Recommendations

• Subset selection for matrices with fixed blocks
• Faster subset selection for matrices and applications
• A note on column subset selection
• A note on subset selection for matrices
• Subset selection for matrices

Cites work

• scientific article; zbMATH DE number 4105142 (Why is no real title available?)
• scientific article; zbMATH DE number 3706628 (Why is no real title available?)
• scientific article; zbMATH DE number 898105 (Why is no real title available?)
• An elementary proof of the restricted invertibility theorem
• Column subset selection, matrix factorization, and eigenvalue optimization
• Extreme points in sets of positive linear maps on B ( H)
• Faster subset selection for matrices and applications
• Interlacing families. II: Mixed characteristic polynomials and the Kadison-Singer problem
• Invertibility of ``large submatrices with applications to the geometry of Banach spaces and harmonic analysis
• Invertibility of sub-matrices and the octahedron width theorem
• John's decompositions: Selecting a large part
• RESTRICTED INVERTIBILITY AND THE BANACH–MAZUR DISTANCE TO THE CUBE
• Sparse sums of positive semidefinite matrices
• Subgraph sparsification and nearly optimal ultrasparsifiers
• Subset selection for matrices
• Twice-Ramanujan sparsifiers

Cited in

(2)

• Semi-optimal bases for linear dependencies
• Subset selection for matrices with fixed blocks

This page was built for publication: Extracting a basis with fixed block inside a matrix

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