Parallel Preconditioning and Approximate Inverses on the Connection Machine

We present a new approach to preconditioning for very large, sparse, non-symmetric, linear systems. We explicitly compute an approximate inverse to our 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.

• Type: Conference
• Year: 1993
• Where: PPSC
• Authors: Marcus J. Grote, Horst D. Simon
• Keywords: Approximate Inverse, Connection Machine CM-2, PPSC 1993, PPSC 2001, Real Problem Data