Processor efficient parallel solution of linear systems of equations

We present a deterministic parallel algorithm chat solves a n-dimensional s ystem Ax = b of linear equations over an ordered field or over a subfield o f the complex numbers. This algorithm uses a(log(2) n) parallel time and O( max{M(n),n(2) (log log n)/log n}) arithmetic processors if M(n) is the proc essor complexity of fast parallel matrix multiplication. (C) 2000 Academic Press.