Processor arrays for matrix triangularisation with partial pivoting

Two processor arrays for triangularisation of dense matrices using Gaussian elimination with partial pivoting are synthesised from the algorithm description. These arrays consist of processing modules with FIFO buffers and manifest local intermodule communications. Both the one- and two-dimensional arrays process an n*n matrix in O(n²) time, while the last allows an O(n) block pipelining period. The estimations of the processing time on the 1D array and the block pipelining period on the 2D array are identical to those for the numerically unstable case of Gaussian elimination without pivoting.