The asymptotic spectrum of tensors and the exponent of matrix multiplication

We introduce an asymptotic data structure for the relative bilinear complexity of bilinear maps (tensors). It consists of a compact Hausdorff space Δ together with an interpretation of the tensors under consideration as continuous functions on Δ. The asymptotic rank of a tensor is simply the maximum of the associated function. On the way we present a new method for estimating the exponent ω of matrix multiplication, leading at present to the bound ω ≪ 2.48. The paper gives only brief indications of proofs, if any. Detailed arguments may be found in 26,27.

[1]  Victor Y. Pan,et al.  New Fast Algorithms for Matrix Operations , 1980, SIAM J. Comput..

[2]  V. Pan.  New combinations of methods for the acceleration of matrix multiplications , 1981 .

[3]  Arnold Schönhage,et al.  Partial and Total Matrix Multiplication , 1981, SIAM J. Comput..

[4]  Eberhard Becker,et al.  Zum Darstellungssatz von Kadison-Dubois , 1983 .

[5]  Volker Strassen.  Evaluation of Rational Functions , 1972, Complexity of Computer Computations.

[6]  Walter Baur,et al.  The Complexity of Partial Derivatives , 1983, Theor. Comput. Sci..

[7]  Grazia Lotti,et al.  O(n2.7799) Complexity for n*n Approximate Matrix Multiplication , 1979, Inf. Process. Lett..

[8]  Philip Alan Gartenberg.  Fast rectangular matrix multiplication (algebraic computational, asymptotic complexity) , 1985 .

[9]  Francesco Romani,et al.  Some Properties of Disjoint Sums of Tensors Related to Matrix Multiplication , 1982, SIAM J. Comput..

[10]  V. Strassen.  Gaussian elimination is not optimal , 1969 .

[11]  J. Hopcroft,et al.  Triangular Factorization and Inversion by Fast Matrix Multiplication , 1974 .

[12]  N. Gastinel,et al.  Sur le calcul des produits de matrices , 1971 .

[13]  V. Strassen.  Relative bilinear complexity and matrix multiplication. , 1987 .

[14]  K. Ramachandra,et al.  Vermeidung von Divisionen. , 1973 .

[15]  John E. Hopcroft,et al.  Duality Applied to the Complexity of Matrix Multiplication and Other Bilinear Forms , 1973, SIAM J. Comput..

[16]  Hanspeter Kraft,et al.  Geometrische Methoden in der Invariantentheorie , 1984 .

[17]  Don Coppersmith,et al.  On the Asymptotic Complexity of Matrix Multiplication , 1982, SIAM J. Comput..