Gaussian elimination is not optimal

@article{Strassen1969GaussianEI,
  title={Gaussian elimination is not optimal},
  author={V. Strassen},
  journal={Numerische Mathematik},
  year={1969},
  volume={13},
  pages={354-356}
}
  • V. Strassen
  • Published 1969
  • Mathematics
  • Numerische Mathematik
  • 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… CONTINUE READING
    2,241 Citations
    On the complexity of matrix multiplication
    • 209
    Negation can be exponentially powerful
    • L. Valiant
    • Mathematics, Computer Science
    • STOC '79
    • 1979
    • 65
    Fast Sparse Matrix Multiplication
    • 10
    • Highly Influenced
    • PDF
    The aggregation and cancellation techniques as a practical tool for faster matrix multiplication
    • I. Kaporin
    • Computer Science, Mathematics
    • Theor. Comput. Sci.
    • 2004
    • 82
    • Highly Influenced
    Arithmetic matrices for number fields I
    • 1
    • PDF

    References

    SHOWING 1-3 OF 3 REFERENCES
    A New Algorithm for Inner Product
    • S. Winograd
    • Mathematics, Computer Science
    • IEEE Transactions on Computers
    • 1968
    • 132
    Seminar fiir angewandte Mathematik der Universit~tt 8032 Ziirich, Freie Str
    • Seminar fiir angewandte Mathematik der Universit~tt 8032 Ziirich, Freie Str