An iterative algorithm to find maximum spanning sets and minimum linearly independent sets which partition a finite generator

DOI10.1080/03081087.2018.1505825zbMath1448.65288OpenAlexW2886244669WikidataQ114641425 ScholiaQ114641425MaRDI QIDQ5210723

No author found.

Publication date: 21 January 2020

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

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

zbMATH Keywords

generatoriterative methodsspanning setlinearly independent setRado-Horn theorem

Mathematics Subject Classification ID

Complexity and performance of numerical algorithms (65Y20) General topics in the theory of algorithms (68W01)

Cites Work

• Unnamed Item
• Finite frames. Theory and applications.
• A redundant version of the Rado-Horn theorem
• An elementary, illustrative proof of the Rado-Horn theorem
• Decomposition of Riesz frames and wavelets into a finite union of linearly independent sets
• A Combinatorial Theorem on Vector Spaces
• Lehmans switching game and a theorem of Tutte and Nash-Williams
• A Characterization of Union of Linearly Independent Sets

This page was built for publication: An iterative algorithm to find maximum spanning sets and minimum linearly independent sets which partition a finite generator