A systolic algorithm for solving dense linear systems

✍ Scribed by Chau-Jy Lin

• Publisher: Elsevier Science
• Year: 1996
• Tongue: English
• Weight: 799 KB
• Volume: 32
• Category: Article
• ISSN: 0898-1221
• DOI: 10.1016/s0898-1221(96)00208-8

✦ Synopsis

For an arbitrary n x n matrix A and an n × 1 column vector b, we present a systolic algorithm to solve the dense linear equations Ax = b. An important consideration is that the pivot row can be changed during the execution of our systolic algorithm. The computational model consists of n linear systolic arrays. For 1 < i < n, the ith linear array is responsible to eliminate the ith unknown variable xi of x. This algorithm requires 4n time steps to solve the linear system. The elapsed time unit within a time step is independent of the problem size n. Since the structure of a PE is simple and the same type PE executes the identical instructions, it is very suitable for VLSI implementation. The design process and correctness proof axe considered in detail. Moreover, this algorithm can detect whether A is singular or not.