Parallel preconditioning and approximation inverses on the Connection Machine

Marcus J. Grote, Horst D. Simon · 2003

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.>

Read the paper · More papers on PaperTik