Powers of low rank sparse matrices

DOI10.1016/J.TCS.2025.115082MaRDI QIDQ7021859zbMATH OpenFDO

Authors Keren Cohen

Publication date 26 February 2025

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.TCS.2025.115082

zbMATH Keywords

low rank matricespower of matricessparse matrices

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50)

Cites work

• A generalization of the fast LUP matrix decomposition algorithm and applications
• Fast matrix rank algorithms and applications
• Fast rectangular matrix multiplication and applications
• Fast sparse matrix multiplication
• Faster rectangular matrix multiplication by combination loss analysis
• Gaussian elimination is not optimal
• scientific article; zbMATH DE number 47926 (Why is no real title available?)
• scientific article; zbMATH DE number 1305088 (Why is no real title available?)
• New bounds for matrix multiplication: from alpha to omega
• Rectangular matrix multiplication revisited
• Solving sparse linear equations over finite fields
• Triangular Factorization and Inversion by Fast Matrix Multiplication

This page was built for publication: Powers of low rank sparse matrices

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