A parallel algorithm for exact solution of linear equations via congruence technique (Q1205881): Difference between revisions

The exact solution of a linear system of equations is obtained by decomposition into a system of congruences modulo various primes, solve these independent systems by integer arithmetic and combine the final solution by the aid of the Chinese remainder theorem. The first part of the paper discusses the theory and complexity of the algorithm, and second part the implementation on a distributed memory parallel computer (example of Intel hypercube).