equations. A sparse approximate inverse is computed explicitly and then applied as a
preconditioner to an iterative method. The computation of the preconditioner is inherently
parallel, and its application only requires a matrix-vector product. The sparsity pattern of the
approximate inverse is not imposed a priori but captured automatically. This keeps the
amount of work and the number of nonzero entries in the preconditioner to a minimum …