Sparse matrix-vector multiplication on a systolic array
暂无分享,去创建一个
[1] S. P. SMITH,et al. A fast inner product processor based on equal alignments , 1985, J. Parallel Distributed Comput..
[2] U. Schwiegelshohn,et al. One- and two-dimensional systolic arrays for least-squares problems , 1987, ICASSP '87. IEEE International Conference on Acoustics, Speech, and Signal Processing.
[3] Francesco Romani,et al. A compact and modular VLSI design for the solution of general sparse linear systems , 1987, Integr..
[4] Omar Wing. A content-addressable systolic array for sparse matrix computation , 1985, J. Parallel Distributed Comput..
[5] H. T. Kung. Why systolic architectures? , 1982, Computer.
[6] Jean-Marc Delosme,et al. Highly concurrent computing structures for matrix arithmetic and signal processing , 1982, Computer.
[7] Mamoru Tanaka,et al. Special parallel processor for lu decomposition of a large-scale sparse matrix , 1987, Systems and Computers in Japan.
[8] J. Cullum,et al. The Lanczos phenomenon—An interpretation based upon conjugate gradient optimization , 1980 .
[9] H. T. Kung,et al. Numerically Stable Solution of Dense Systems of Linear Equations Using Mesh-Connected Processors , 1984 .
[10] M. Hestenes,et al. Methods of conjugate gradients for solving linear systems , 1952 .
[11] H. T. Kung,et al. Sorting on a mesh-connected parallel computer , 1977, CACM.