DocumentCode
1628562
Title
Parallel, iterative solution of large, sparse linear systems on hypercubes
Author
Murthy, C. Siva Ram
Author_Institution
Dept. of Comput. Sci. & Eng., Indian Inst. of Technol., Madras, India
fYear
1989
Firstpage
557
Abstract
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
Keywords
iterative methods; linear algebra; parallel algorithms; analytical evaluation; dense linear algebraic equations; hypercube suitability; hypercubes; iteration execution time; large system solving; optimal algorithm; parallel algorithm performance; parallel iterative algorithm; sparse linear systems; Algorithm design and analysis; Computer science; Concurrent computing; Equations; Hypercubes; Iterative algorithms; Linear systems; Mathematics; Parallel algorithms; Performance analysis;
fLanguage
English
Publisher
ieee
Conference_Titel
Circuits and Systems, 1989., IEEE International Symposium on
Conference_Location
Portland, OR
Type
conf
DOI
10.1109/ISCAS.1989.100413
Filename
100413
Link To Document