Efficient procedures for using matrix algorithms
A set of basic procedures for constructing matrix multiplication algorithms is defined. Five classes of composite matrix multiplication algorithms are considered and an optimal strategy is presented for each class. Instances are given of improvements in arithmetic cost over Strassen's method for multiplying square matrices. Best and worst case cost coefficients for matrix multiplication are given.
A similar analysis is done for matrix inversion algorithms.
Unable to display preview. Download preview PDF.
- Strassen, V., Gaussian elimination is not optimal, Numer.Math. 13 (1969), 354–356.Google Scholar
- Probert, R., On the complexity of matrix multiplication, Tech. Report CS-73-27 (1973), Dept. of Applied Analysis and Computer Science, University of Waterloo.Google Scholar
- Fischer, P.C., Further schemes for combining matrix algorithms, Proc. 2nd Colloquium on Automata, Languages, and Programming (1974).Google Scholar