The matrix capacity of a tensor

DOI10.1007/s10958-012-1009-7zbMath1264.65067OpenAlexW2076011937MaRDI QIDQ1947657

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

complexityalgorithmnumerical examplesmatrix multiplicationtensur algebra

Mathematics Subject Classification ID

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

Cites Work

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

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