Back to Search
Start Over
On the Time Required for a Sequence of Matrix Products.
- Source :
- Communications of the ACM; Jan1973, Vol. 16 Issue 1, p22-26, 5p, 3 Diagrams
- Publication Year :
- 1973
-
Abstract
- This paper discusses the multiplication of conformable sequences of row vectors, column vectors, and square matrices. The minimum time required to evaluate such products on ordinary serial computers as well as parallel computers is discussed. Algorithms are presented which properly parse suck matrix sequences subject to the constraints of the machine organization. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 00010782
- Volume :
- 16
- Issue :
- 1
- Database :
- Complementary Index
- Journal :
- Communications of the ACM
- Publication Type :
- Periodical
- Accession number :
- 5377586
- Full Text :
- https://doi.org/10.1145/361932.361938