When using incomplete factorization preconditioners with an iterative method to solve large
sparse linear systems, each application of the preconditioner involves solving two sparse
triangular systems. These triangular systems are challenging to solve efficiently on
computers with high levels of concurrency. On such computers, it has recently been
proposed to use Jacobi iterations, which are highly parallel, to approximately solve the
triangular systems from incomplete factorizations. The effectiveness of this approach …