Parallel solution of sparse algebraic equations
- Feng Chia Univ., Taichung (Taiwan, Province of China)
- Northwestern Univ., Evanston, IL (United States)
Two methods that have been studied in recent years for solving large, sparse sets of algebraic equations, the multiple factoring method and the W-matrix method, are shown to be two independent methods of explaining equivalent computational procedures. The forward and backward substitution part of these methods are investigated using parallel processing techniques on commercially available computers. The results are presented from testing the proposed methods on two local memory machines, the Intel iPSC/1 and iPSC/860 hypercubes, and a shared memory machine, the Sequent SymmetryS81. With the iPSC/1, which is characterized by its slow communication rate and high communication overhead for a short message, the best speedup obtained is less than 2.5, and that was with only 8 of the 16 available processors in use. The iPSC/860, a more advance model of the iPSC family, is even worse as far as these parallel methods are concerned. Much better results were obtained on the Sequent Symmetry where a speedup of 7.48 was obtained with 16 processors.
- OSTI ID:
- 7154349
- Journal Information:
- IEEE Transactions on Power Systems (Institute of Electrical and Electronics Engineers); (United States), Vol. 9:2; ISSN 0885-8950
- Country of Publication:
- United States
- Language:
- English
Similar Records
An iterative algorithm for solving the multidimensional neutron diffusion nodal method equations on parallel computers
Parallel computing and quantum simulations/011
Related Subjects
99 GENERAL AND MISCELLANEOUS//MATHEMATICS, COMPUTING, AND INFORMATION SCIENCE
EQUATIONS
NUMERICAL SOLUTION
HYPERCUBE COMPUTERS
PARALLEL PROCESSING
ALGEBRA
AUGMENTATION
MEMORY DEVICES
NUMERICAL ANALYSIS
TASK SCHEDULING
COMPUTERS
DATA PROCESSING
MATHEMATICS
PROCESSING
PROGRAMMING
240100* - Power Systems- (1990-)
990200 - Mathematics & Computers