Dynamic Matrix Rank

DOI10.1007/11786986_35MaRDI QIDQ3613776zbMATH OpenOpenAlexFDO

Authors Peter Frands Frandsen, Gudmund S. Frandsen

Publication date 12 March 2009

Published in Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11786986_35

Mathematics Subject Classification ID

Vector spaces, linear dependence, rank, lineability (15A03) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Symbolic computation and algebraic computation (68W30)

Recommendations

• Dynamic matrix rank
• Lower bounds for dynamic algebraic problems
• Dynamic matrix rank with partial lookahead
• Fast matrix rank algorithms and applications
• Fast matrix rank algorithms and applications

Cited in

(12)

• Storing matrices on disk for efficient row and column retrieval
• Lower bounds for dynamic algebraic problems
• Dynamic matrix rank with partial lookahead
• A relaxed algorithm for online matrix inversion
• A graph polynomial for independent sets of bipartite graphs
• Dynamic matrix rank with partial lookahead
• Dynamic Normal Forms and Dynamic Characteristic Polynomial
• Fast matrix rank algorithms and applications
• Fast matrix rank algorithms and applications
• Updating matrix polynomials
• Dynamic normal forms and dynamic characteristic polynomial
• Dynamic matrix rank

This page was built for publication: Dynamic Matrix Rank

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