Semi-optimal bases for linear dependencies

DOI10.1080/03081088508817636zbMath0556.15001OpenAlexW1970627157WikidataQ114641255 ScholiaQ114641255MaRDI QIDQ3220692

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)

Related Items (12)

Preconditioning Linear Least-Squares Problems by Identifying a Basis Matrix ⋮ The Discrete Empirical Interpolation Method: Canonical Structure and Formulation in Weighted Inner Product Spaces ⋮ Least Angle Regression Coarsening in Bootstrap Algebraic Multigrid ⋮ Parallel Energy-Minimization Prolongation for Algebraic Multigrid ⋮ Parallel cross interpolation for high-precision calculation of high-dimensional integrals ⋮ Optimization on a Grassmann manifold with application to system identification ⋮ Implementation of an interior point method with basis preconditioning ⋮ Rank revealing Gaussian elimination by the maximum volume concept ⋮ 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 ⋮ A Fast Block-Greedy Algorithm for Quasi-optimal Meshless Trial Subspace Selection

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