Implementing the Parallel Approxmate Schur Complement Preconditioner

Abstract

A modified implementation of Saad's parallel approximate Schur complement preconditioner is presented that is shown to be faster than the original algorithm. This is evaluated for the solution of large sparse matrices as generated by the finite element time domain method. Results indicate that the preconditioner scales well with an increase in processors and problem size.