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 Inclusion of Interval Matrix Multiplication
✍ Scribed by Takeshi Ogita; Shin’ichi Oishi
- Book ID
- 106516055
- Publisher
- Springer
- Year
- 2005
- Tongue
- English
- Weight
- 176 KB
- Volume
- 11
- Category
- Article
- ISSN
- 1385-3139
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 matrix multiplication is stable
✍
James Demmel; Ioana Dumitriu; Olga Holtz; Robert Kleinberg
📂
Article
📅
2007
🏛
Springer-Verlag
🌐
English
⚖ 358 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
On the Inclusion Properties of Interval
✍
Z. Kulpa; S. Markov
📂
Article
📅
2003
🏛
Springer Netherlands
🌐
English
⚖ 492 KB