Title: Efficient procedures for using matrix algorithms
Abstract: 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.
Publication Year: 1974
Publication Date: 1974-01-01
Language: en
Type: book-chapter
Indexed In: ['crossref']
Access and Citation
Cited By Count: 36
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot