Skip to Main Content

Mathematics of Computation

Published by the American Mathematical Society since 1960 (published as Mathematical Tables and other Aids to Computation 1943-1959), Mathematics of Computation is devoted to research articles of the highest quality in computational mathematics.

ISSN 1088-6842 (online) ISSN 0025-5718 (print)

The 2020 MCQ for Mathematics of Computation is 1.78.

What is MCQ? The Mathematical Citation Quotient (MCQ) measures journal impact by looking at citations over a five-year period. Subscribers to MathSciNet may click through for more detailed information.


Triangular factorization and inversion by fast matrix multiplication
HTML articles powered by AMS MathViewer

by James R. Bunch and John E. Hopcroft PDF
Math. Comp. 28 (1974), 231-236 Request permission


The fast matrix multiplication algorithm by Strassen is used to obtain the triangular factorization of a permutation of any nonsingular matrix of order n in $< {C_1}{n^{{{\log }_2}7}}$ operations, and, hence, the inverse of any nonsingular matrix in $< {C_2}{n^{{{\log }_2}7}}$ operations.
Similar Articles
  • Retrieve articles in Mathematics of Computation with MSC: 65F30
  • Retrieve articles in all journals with MSC: 65F30
Additional Information
  • © Copyright 1974 American Mathematical Society
  • Journal: Math. Comp. 28 (1974), 231-236
  • MSC: Primary 65F30
  • DOI:
  • MathSciNet review: 0331751