By Topic

Solving System of Linear Equations in a Network of Workstations

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Dimitriu, G. ; Politehnica Univ. of Bucharest ; Ionescu, F.

In this article we propose an evaluation of the three common algorithms for solving linear system of equations: Gauss elimination, Gauss-Jordan without pivoting and Jacobi with dominant rows. The parallel design of the chosen algorithms is a compromise between the easies and elegant way to implement in MPI and the performance. The result confirmed that for a small number of low cost computers the speedup is acceptable for the Gauss elimination and Gauss-Jordan but for Jacobi with dominant rows if data is not already distributed it is better to implement the serial version

Published in:

Parallel and Distributed Computing, 2006. ISPDC '06. The Fifth International Symposium on

Date of Conference:

6-9 July 2006