The complexity of the multiplication of a banded matrix by a vector is studied with respect to the VLSI model. Upper and lower bounds are showed, which improve the known results. An upper bound, which is optimal up to logarithmic factors, is obtained for the case of fixed band.
VLSI linear transformations of banded matrices
Codenotti B;
1984
Abstract
The complexity of the multiplication of a banded matrix by a vector is studied with respect to the VLSI model. Upper and lower bounds are showed, which improve the known results. An upper bound, which is optimal up to logarithmic factors, is obtained for the case of fixed band.File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
prod_420433-doc_149014.pdf
accesso aperto
Descrizione: VLSI linear transformations of banded matrices
Dimensione
699.63 kB
Formato
Adobe PDF
|
699.63 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
