Degrees of Freedom and Modular Structure in Matrix Multiplication

  • Authors:

  • H. C. Andrews;K. L. Caspari

  • Affiliations:

  • -;-

  • Venue:
  • IEEE Transactions on Computers
  • Year:
  • 1971

Quantified Score

Hi-index 14.98

Visualization

Abstract

An algorithm is presented which enables certain matrix multiplications in a digital computer to be implemented with a considerable savings in storage and computational operations. For NxN matrix vector multiplication (that is a multiplication of a matrix by a vector) a maximum of N Sn-1 r=0 pr, storage words are necessary compared to normal full matrix storage requirements of N2