论文信息 - A compact and modular VLSI design for the solution of general sparse linear systems

A compact and modular VLSI design for the solution of general sparse linear systems

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.

Francesco Romani | Bruno Codenotti

[1] Grazia Lotti,et al. VLSI implementation of iterative methods for the solution of linear systems , 1985, Integr..

[2] Bernard Chazelle,et al. Census functions: An approach to VLSI upper bounds , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).

[3] Kurt Mehlhorn,et al. AT2-optimal VLSI integer division and integer square rooting , 1984, Integr..

[4] Franco P. Preparata,et al. A Mesh-Connected Area-Time Optimal VLSI Multiplier of Large Integers , 1983, IEEE Transactions on Computers.

[5] J. Ortega,et al. Solution of Partial Differential Equations on Vector and Parallel Computers , 1987 .

[6] Lynn Conway,et al. Introduction to VLSI systems , 1978 .