Kumar, FRK and Sen, SK (1994) Concise systolic algorithms for linear systems. In: Proceedings of the 29th Annual Convention of the Computer Society of India. Information Technology for Growth and Prosperity, 21-24 Nov. 1994, Calcutta, India, pp. 117-124.Full text not available from this repository.
Concise algorithms to compute a solution of a system of m linear equations Ax=b with n variables are presented. It is matrix inversion free. It provides an in built consistency check and also produces the rank of the matrix A. It converts A into a full rank matrix, thus preserving the complete information of the system. Four designs based on systolic processor arrays are presented and their scope is discussed. The first one is the Leiserson systolic design while the remaining three, viz. the double pipe design the fitted diagonal design, and the folding design are derived versions of the first design with improved performance
|Item Type:||Conference Paper|
|Additional Information:||Copyright of this article belongs to Tata McGraw-Hill.|
|Department/Centre:||Division of Information Sciences > Supercomputer Education & Research Centre|
|Date Deposited:||16 Jul 2007|
|Last Modified:||11 Jan 2012 09:26|
Actions (login required)