Triangular Factorization and Inversion by Fast Matrix Multiplication

Abstract

The fast matrix multiplication algorithm by Strassen is used to obtain the triangular factorization of a permutation of any non-singular matrix of order n in (C sub 1)(n sup(log of 7 to the base 2)) operations, and hence the inverse of any non-singular matrix in (C sub 2)(n sup (log of 7 to the base 2)) operations.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Dec 01, 1972
Accession Number
AD0754790

Entities

People

  • James R. Bunch
  • John E. Hopcroft

Organizations

  • Cornell University

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Coefficients
  • Computations
  • Computer Science
  • Decomposition
  • Guarantees
  • Inversion
  • Military Research
  • New York
  • Permutations
  • Three Dimensional
  • Universities

Fields of Study

  • Mathematics

Readers

  • Linear Algebra