DocumentCode
1332549
Title
Parallel algorithm for solving sparse linear systems
Author
Balasubramanya Murthy, K.N. ; Siva Ram Murthy, C.
Author_Institution
Dept. of Comput. Sci. & Eng., Indian Inst. of Technol., Madras
Volume
32
Issue
19
fYear
1996
fDate
9/12/1996 12:00:00 AM
Firstpage
1766
Lastpage
1768
Abstract
The authors consider the problem of solving a sparse system of linear equations using a new LU factorisation based algorithm. The algorithm uses a new technique called `two-sided factorisation´ to produce the complete solution by solving only one triangular system after the factorisation phase rather than solving two triangular systems as in existing LU factorisation based methods. The effectiveness of the new algorithm in solving sparse linear systems on hypercubes is demonstrated using IEEE standard power system networks as benchmarks
Keywords
hypercube networks; matrix decomposition; parallel algorithms; sparse matrices; LU factorisation; hypercube; linear equations; parallel algorithm; power system network; sparse system; triangular system; two-sided factorisation;
fLanguage
English
Journal_Title
Electronics Letters
Publisher
iet
ISSN
0013-5194
Type
jour
DOI
10.1049/el:19961203
Filename
533571
Link To Document