Istituto di Scienza e Tecnologie dell'Informazione     
Codenotti B., Romani F., Lotti G. Area-time complexity of matrix-vector multiplication. Internal note IEI-B4-02, 1986.
It is studied the matrix-vector multiplication problem in VLSI. Both lower and upper bounds are derived which depend on the chosen model, obtained by different I/O conventions. The problems of multiplying a sparse matrix by a vector is taken into consideration as well. the results obtained for matrix-vector product are applied to study the VLSI complexity of other numerical problems.
Subject VLSI ModeIs
Area-time Complexity
Sparse Matrices
Matrix-Vector Product
Iterative Methods

Icona documento 1) Download Document PDF

Icona documento Open access Icona documento Restricted Icona documento Private


Per ulteriori informazioni, contattare: Librarian http://puma.isti.cnr.it

Valid HTML 4.0 Transitional