Johnsson, Lennart (1982) VLSI algorithms for Doolittle's, Crout's, and Cholesky's methods. California Institute of Technology , Pasadena, CA. (Submitted) http://resolver.caltech.edu/CaltechAUTHORS:20120420-105611583
See Usage Policy.
Use this Persistent URL to link to this item: http://resolver.caltech.edu/CaltechAUTHORS:20120420-105611583
In order to take full advantage of the emerging VLSI technology it is required to recognize its limited communication capability and structure algorithms accordingly. In this paper concurrent algorithms for the methods of Crout, Doolittle and Cholesky are described and compared with concurrent algorithms for Gauss' , Given's and Householder's method. The effect of pipe lining the computations in two dimensional arrays is given special attention.
|Item Type:||Report or Paper (Technical Report)|
|Additional Information:||this paper will appear in Proc. IEEE International Conference on Circuits and Computers, ICCC 82 New York, September 29 - October 1, 1982. The author gratefully acknowledges the support provided by the Defense Advanced Research Project Agency, order 3771, and monitored by the Office of Naval Research under contract N00014-79-C-0597. Views and conclusions contained in this paper are the author's and should not be interpreted as representing the official opinion of DARPA, the u.s. Government, nor any person or agency connected with them.|
|Group:||Computer Science Technical Reports|
|Other Numbering System:|
|Usage Policy:||No commercial reproduction, distribution, display or performance rights in this work are provided.|
|Deposited By:||Kristin Buxton|
|Deposited On:||02 May 2012 17:49|
|Last Modified:||26 Dec 2012 15:05|
Repository Staff Only: item control page