By Topic

Parallel, iterative solution of large, sparse linear systems on hypercubes

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
$33 $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

1 Author(s)
C. S. R. Murthy ; Dept. of Comput. Sci. & Eng., Indian Inst. of Technol., Madras, India

A parallel, iterative algorithm for solving large, dense linear systems on hypercubes is presented. This algorithm is shown to be optimal, i.e. it results in minimum execution time for an iteration. The performance of the parallel algorithm is evaluated analytically and the results show that the hypercubes are highly effective in solving large systems of dense linear algebraic equations. Finally, the suitability of the hypercubes for solving sparse linear systems is discussed

Published in:

Circuits and Systems, 1989., IEEE International Symposium on

Date of Conference:

8-11 May 1989