The Sparse Basis Problem and Multilinear Algebra

DOI10.1137/S0895479892230067MaRDI QIDQ4325674zbMATH OpenOpenAlexFDO

Authors Richard A. Brualdi, Alex Pothen, S. Friedland

Publication date 1 November 1995

Published in SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/s0895479892230067

zbMATH Keywords

elementary vectorsmultilinear algebrasparse basis problemundetermined matrix

Mathematics Subject Classification ID

Vector spaces, linear dependence, rank, lineability (15A03) Multilinear algebra, tensor calculus (15A69)

Recommendations

• The Null Space Problem II. Algorithms
• The Null Space Problem I. Complexity
• Computing a Sparse Basis for the Null Space
• A \(\{-1,0,1\}\)- and sparsest basis for the null space of a forest in optimal time
• Combinatorial algorithms for computing column space bases that have sparse inverses

Cited in

(11)

• The limit of the product of the parameterized exponentials of two operators
• On tensors of border rank \(l\) in \({\mathbb C}^{m\times n\times l}\)
• Optimal orthogonalization processes
• On matchable subsets in abelian groups and their linear analogues
• Nullspaces of matrices and their compounds
• Towards Mixed Gröbner Basis Algorithms
• Inference of chemical reaction networks based on concentration profiles using an optimization framework
• Conditions for matchability in groups and field extensions
• A SageMath package for elementary and sign vectors with applications to chemical reaction networks
• Best low rank approximations are a special case of best DCD-matrix approximations
• Convergence of products of matrices in projective spaces

This page was built for publication: The Sparse Basis Problem and Multilinear Algebra

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