The matrix capacity of a tensor

DOI10.1007/S10958-012-1009-7MaRDI QIDQ1947657zbMATH OpenOpenAlexFDO

Authors D. V. Zhdanovich

Publication date 23 April 2013

Published in Journal of Mathematical Sciences (New York) (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10958-012-1009-7

zbMATH Keywords

algorithmcomplexitymatrix multiplicationnumerical examplestensur algebra

Mathematics Subject Classification ID

Vector and tensor algebra, theory of invariants (15A72) Complexity and performance of numerical algorithms (65Y20)

Recommendations

• Powers of tensors and fast matrix multiplication
• An optimal algorithm for matrix multiplication
• Matrix multiplication via arithmetic progressions
• Algebraic complexity theory. II: Tast matrix multiplication and combinatorics.
• Fast rectangular matrix multiplication and applications

Cites work

• \(0(n^{2.7799})\) complexity for \(n\times n\) approximate matrix multiplication
• Gaussian elimination is not optimal
• Matrix multiplication via arithmetic progressions
• On Sets of Integers Which Contain No Three Terms in Arithmetical Progression
• On Sets of Integers Which Contain No Three Terms in Arithmetical Progression
• On Some Sequences of Integers
• Partial and Total Matrix Multiplication
• Relations between exact and approximate bilinear algorithms. Applications
• Relative bilinear complexity and matrix multiplication.

This page was built for publication: The matrix capacity of a tensor

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