EURO-PAR '98 PARALLEL PROCESSING, cilt.1470, ss.793-797, 1998 (SCI İndekslerine Giren Dergi)
A parallel computation model to invert a lower triangular matrix using Gauss elimination with sweeping technique is presented. Performance characteristics that we obtain are O(n) time and O(n(2)) processors leading to an efficiency of O(1/n). A comparative performance study with the available fastest parallel matrix inversion algorithms is given. We believe that the method presented here is superior over the existing methods in efficiency measure and in processor complexity.