A parallel algorithm for exact solution of linear equations via congruence technique (Q1205881): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 03:32, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A parallel algorithm for exact solution of linear equations via congruence technique |
scientific article |
Statements
A parallel algorithm for exact solution of linear equations via congruence technique (English)
0 references
1 April 1993
0 references
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).
0 references
parallel computation
0 references
exact solution
0 references
linear system
0 references
decomposition
0 references
integer arithmetic
0 references
complexity
0 references
algorithm
0 references
distributed memory parallel computer
0 references
