Several implementations of matrix multiplication (MMUL) in Fortran and VAX assembly language are discussed. On a VAX-11/780 computer, the most efficient MMUL is achieved through vector-scalarmultiply-and-add (VSMA) operations, rather than by means of dot products. We also discuss optimal MMUL algori
β¦ LIBER β¦
Fast matrix multiplication is stable
β Scribed by James Demmel; Ioana Dumitriu; Olga Holtz; Robert Kleinberg
- Book ID
- 105878920
- Publisher
- Springer-Verlag
- Year
- 2007
- Tongue
- English
- Weight
- 358 KB
- Volume
- 106
- Category
- Article
- ISSN
- 0029-599X
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Fast matrix multiplication
β
Carlos F. Bunge; Gerardo Cisneros
π
Article
π
1987
π
John Wiley and Sons
π
English
β 358 KB
Fast sparse matrix multiplication
β
S.C. Park; J.P. Draayer; S.-Q. Zheng
π
Article
π
1992
π
Elsevier Science
π
English
β 834 KB
A new space-efficient representation for sparse matrices is introduced and a fast sparse matrix multiplication algorithm based on the new representation is presented. The scheme is very efficient when the nonzero elements of a sparse matrix are partially or fully adjacent to one another as in band o
Fast Inclusion of Interval Matrix Multip
β
Takeshi Ogita; Shinβichi Oishi
π
Article
π
2005
π
Springer
π
English
β 176 KB
Fast Rectangular Matrix Multiplication a
β
Xiaohan Huang; Victor Y. Pan
π
Article
π
1998
π
Elsevier Science
π
English
β 561 KB
Stability of fast algorithms for matrix
β
Dario Bini; Grazia Lotti
π
Article
π
1980
π
Springer-Verlag
π
English
β 362 KB
Fast rectangular matrix multiplication a
β
ShanXue Ke; BenSheng Zeng; WenBao Han; Victor Y. Pan
π
Article
π
2008
π
SP Science China Press
π
English
β 278 KB