We propose a multiprocessor structure for solving a dense system of n linear equations. The solution is obtained in two stages. First, the matrix of coefficients is reduced to upper triangular form via Givens rotations. Second, a back substitution process is applied to the triangular system. A two-dimensional array of θ (n² ) processors is employed to implement the first step, and (using a previously known scheme) a one-dimensional array of θ (n) processors is employed to implement the second step. These processor arrays allow both stages to be carried out in time $O(n)$, and they are well suited for VLSI implementation as identical processors with a simple and regular interconnection pattern are required.
No takes yet. Share an insight, caveat, or question.
Bojańczyk et al. (1984) studied this question.
Synapse has enriched 3 closely related papers on similar clinical questions. Consider them for comparative context: