In this paper we propose an efficient algorithm to implement parallel integer multiplication by a combination of parallel additions, shifts and reads from a memoryresident lookup table dedicated to squares. Such an operator called PIM (parallel integer multiplication) is in fact microprogrammed at t
✦ LIBER ✦
An algorithm for multiplication of concatenated matrices
✍ Scribed by M.K Stojčev; E.I Milovanović; I.Ž Milovanović
- Publisher
- Elsevier Science
- Year
- 1990
- Tongue
- English
- Weight
- 811 KB
- Volume
- 13
- Category
- Article
- ISSN
- 0167-8191
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
An efficient algorithm for parallel inte
✍
Benjamin Singer; George Saon
📂
Article
📅
1996
🏛
Elsevier Science
🌐
English
⚖ 67 KB
An algorithm for the multiplication of t
✍
O.M. Makarov
📂
Article
📅
1977
🏛
Elsevier Science
⚖ 126 KB
A submatrix algorithm for the matrix-vec
✍
Roland Lindh; Per-Årke Malmquist
📂
Article
📅
1989
🏛
John Wiley and Sons
🌐
English
⚖ 179 KB
In self-consistent field (SCF) calculations the construction of the Fock matrix is most time-consuming step. The Fock matrix construction may formally be seen as a matrix-vector multiplication, where the matrix is the supermatrix, Tikl, and the vector is the first-order density matrix, yi. This form
An algorithm for the pseudoinversion of
✍
A.A. Matveev
📂
Article
📅
1974
🏛
Elsevier Science
⚖ 306 KB
An algorithm for inverting rational matr
✍
Ching-An Lin; Chien-Wen Yang; Tung-Fu Hsieh
📂
Article
📅
1996
🏛
Elsevier Science
🌐
English
⚖ 389 KB
An algorithm for multiplying 3×3 matrice
✍
O.M. Makarov
📂
Article
📅
1986
🏛
Elsevier Science
⚖ 182 KB