VLSI Algorithms for Doolittle’s, Crout’s and Cholesky’s Methods
1982 (English)Conference paper (Refereed)
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 pipelining the computations in two dimensional arrays is given special attention.
Place, publisher, year, edition, pages
1982. 372-377 p.
Computer and Information Science
IdentifiersURN: urn:nbn:se:kth:diva-65765OAI: oai:DiVA.org:kth-65765DiVA: diva2:483667
the International Conference on Circuits and Computers, ICCC 82
NR 201408052012-01-252012-01-25Bibliographically approved