Data di Pubblicazione:
1987
Abstract:
A VLSI design is presented for the solution of a linear system tailored to handle general sparse coefficient matrices. We show a network with area proportional to the number of nonzero entries in the matrix and modularity not dependent on the particular coefficient matrix.
Tipologia CRIS:
01.01 Articolo in rivista
Keywords:
VLSI ModeIs; Area-time Complexity; Sparse Matrices; Iterative Methods
Elenco autori:
Romani, Francesco; Codenotti, Bruno
Link alla scheda completa:
Pubblicato in: