DocumentCode :
3288035
Title :
Parallel preconditioning and approximation inverses on the Connection Machine
Author :
Grote, Marcus ; Simon, Horst D.
Author_Institution :
Dept. of Comput. Sci., Stanford Univ., CA, USA
fYear :
1992
fDate :
26-29 Apr 1992
Firstpage :
76
Lastpage :
83
Abstract :
The authors present a new approach to preconditioning for very large, sparse, non-symmetric, linear systems. It explicitly computes an approximate inverse to the original matrix that can be applied most efficiently for iterative methods on massively parallel machines. The algorithm and its implementation on the Connection Machine CM-2 are discussed in detail and supported by timings obtained from real problem data
Keywords :
iterative methods; matrix algebra; parallel algorithms; CM-2; Connection Machine; approximation inverses; iterative methods; linear systems; massively parallel machines; matrix; parallel algorithms; parallel preconditioning; sparse systems; Acceleration; Computer science; Concurrent computing; Iterative methods; Linear systems; NASA; Parallel machines; Postal services; Sparse matrices; Symmetric matrices;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Scalable High Performance Computing Conference, 1992. SHPCC-92, Proceedings.
Conference_Location :
Williamsburg, VA
Print_ISBN :
0-8186-2775-1
Type :
conf
DOI :
10.1109/SHPCC.1992.232685
Filename :
232685
Link To Document :
بازگشت