Semi-optimal bases for linear dependencies

DOI10.1080/03081088508817636MaRDI QIDQ3220692zbMATH OpenOpenAlexWikidataFDO

Authors Donald E. Knuth

Publication date 1985

Published in Linear and Multilinear Algebra (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/03081088508817636

zbMATH Keywords

linear dependenciessemi-optimal bases

Mathematics Subject Classification ID

Vector spaces, linear dependence, rank, lineability (15A03)

Recommendations

• Bases of spaces of matrices satisfying rank conditions
• scientific article; zbMATH DE number 4106132
• Extracting a basis with fixed block inside a matrix
• ON THE MAXIMAL RANK IN A SUBSPACE OF MATRICES
• On Rota's problem about n bases in a rank n matroid

Cited in

(13)

• Rank revealing Gaussian elimination by the maximum volume concept
• Implementation of an interior point method with basis preconditioning
• Parallel cross interpolation for high-precision calculation of high-dimensional integrals
• A fast block-greedy algorithm for quasi-optimal meshless trial subspace selection
• scientific article; zbMATH DE number 4134221 (Why is no real title available?)
• The Discrete Empirical Interpolation Method: Canonical Structure and Formulation in Weighted Inner Product Spaces
• Preconditioning linear least-squares problems by identifying a basis matrix
• Least Angle Regression Coarsening in Bootstrap Algebraic Multigrid
• Optimization on a Grassmann manifold with application to system identification
• Chronos: a general purpose classical AMG solver for high performance computing
• An inverse-free ADI algorithm for computing Lagrangian invariant subspaces.
• Optimal interpolation and compatible relaxation in classical algebraic multigrid
• Parallel Energy-Minimization Prolongation for Algebraic Multigrid

This page was built for publication: Semi-optimal bases for linear dependencies

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