# Gaussian elimination is not optimal

@article{Strassen1969GaussianEI, title={Gaussian elimination is not optimal}, author={Volker Strassen}, journal={Numerische Mathematik}, year={1969}, volume={13}, pages={354-356} }

t. Below we will give an algorithm which computes the coefficients of the product of two square matrices A and B of order n from the coefficients of A and B with tess than 4 . 7 n l°g7 arithmetical operations (all logarithms in this paper are for base 2, thus tog 7 ~ 2.8; the usual method requires approximately 2n 3 arithmetical operations). The algorithm induces algorithms for invert ing a matr ix of order n, solving a system of n linear equations in n unknowns, comput ing a determinant of…

## 2,372 Citations

On the complexity of matrix multiplication

- Mathematics
- 2010

The evaluation of the product of two matrices can be very computationally expensive. The multiplication of two n×n matrices, using the “default” algorithm can take O(n3) field operations in the…

Geometric Configurations of Algorithms for Reduced m x 2 and 2 x 2 Matrix Multiplication

- Computer Science, Mathematics
- 2016

One Bini’s theorem demonstrates that the border rank of the matrix multiplication tensor M<n> is a complexity measurement for matrix multiplication, and a theorem due to Strassen shows the tensor rank is a good measurement for the complexity.

Negation can be exponentially powerful

- Mathematics, Computer ScienceSTOC
- 1979

A positive answer to a problem for which an exponential speedup can be attained using {+,−,×} rather than just {+,×} as operations is given, which is the multivariate polynomial associated with perfect matchings in planar graphs.

An arithmetic complexity lower bound for computing rational functions, with applications to linear algebra

- Computer Science
- 2013

This work proposes yet another algorithmic model, closer in spirit to Klyuev and Kokovkin-Shcherbak, but sufficiently more general to be able to provide lower bounds on the number of arithmetic operations required to perform dense, sparse or “structured” one-sided matrix factorizations.

Fast Sparse Matrix Multiplication

- Computer Science, MathematicsESA
- 2004

A new algorithm that multiplies A and B using O(m 0.7 n 1.2+n 2 + o(1)) algebraic operations over R, obtained using a surprisingly straightforward combination of a simple combinatorial idea and existing fast rectangular matrix multiplication algorithms.

The bit complexity of matrix multiplication and of related computations in linear algebra. The segmented λ algorithms

- Computer Science, Mathematics
- 1985

An arithmetic complexity lower bound for computing rational functions , with applications to structured and sparse linear algebra

- Computer Science
- 2018

This work proposes yet another algorithmic model, closer in spirit to Klyuev and Kokovkin-Shcherbak, but sufficiently more general to be able to provide lower bounds on the number of arithmetic operations required to perform dense, sparse or “structured” one-sided matrix factorizations.

The aggregation and cancellation techniques as a practical tool for faster matrix multiplication

- Computer ScienceTheor. Comput. Sci.
- 2004

Arithmetic matrices for number fields I

- Mathematics
- 2018

We provide a simple way to add, multiply, invert, and take traces and norms of algebraic integers of a number field using integral matrices. With formulas for the integral bases of the ring of…

Research Proposal : Algebraic Methods for Fast Matrix Multiplication

- Computer Science, Mathematics
- 2008

Recent work by Cohn and Umans indicates a possible path to proving that the obvious lower bound of 2 is tight, namely an approach using techniques from group theory and representation theory.

## References

SHOWING 1-3 OF 3 REFERENCES

A New Algorithm for Inner Product

- MathematicsIEEE Transactions on Computers
- 1968

A new way of computing the inner product of two vectors is described that can be performed using roughly n3/2 multiplications instead of the n3multiplications which the regular method necessitates.

Minimization of the number of arithmetic operations in the solution of linear algebraic systems of equations

- Mathematics
- 1965

Seminar fiir angewandte Mathematik der Universit~tt 8032 Ziirich, Freie Str

- Seminar fiir angewandte Mathematik der Universit~tt 8032 Ziirich, Freie Str