On practical algorithms for accelerated matrix multiplication (Q1183208)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On practical algorithms for accelerated matrix multiplication |
scientific article; zbMATH DE number 32952
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On practical algorithms for accelerated matrix multiplication |
scientific article; zbMATH DE number 32952 |
Statements
On practical algorithms for accelerated matrix multiplication (English)
0 references
28 June 1992
0 references
The authors present several bilinear algorithms for fast matrix multiplication of \(n\times n\) matrices. The algorithms are superior to both the classical and Strassen's algorithm for moderate \(n\) \((n\geq 20)\). When these algorithms are used over finite fields the bilinear complexity decreases below the current record upper bound for the same computation over infinite fields. Numerical experiments are also reported.
0 references
acceleration of computation
0 references
bilinear algorithms
0 references
matrix multiplication
0 references
Strassen's algorithm
0 references
finite fields
0 references
bilinear complexity
0 references
Numerical experiments
0 references
0 references
