## Abstract

Parallel block-preconditioned domain-decomposed Krylov methods for sparse linear systems are described and illustrated on large two-dimensional model problems and Jacobian matrices from different stages of a nonlinear multicomponent problem in chemically reacting flows. The main motivation of the work is to examine the practicality of parallelization, under the domain decomposition paradigm, of the solution of systems of equations typical of implicit finite difference applications from fluid dynamics. Such systems presently lie beyond the realm of most of the theory for domain-decomposed symmetric or nonsymmetric scalar operators. We describe techniques depending formally only on the sparsity structure of the linear operator and thus of broad applicability. Results of tests run on an Encore Multimax with up to 16 processors demonstrate their utility in the coarse-granularity parallelization of hydrocodes: parallel efficiencies in the 40 to 100 percent range are available on the largest number of processors employed over a mix of problems, relative to a serial approach employing the same iterative technique (GMRES) and preconditioner (ILU) on a single domain. These efficiencies are already competitive with results from undecomposed parallel implementations of ILU-preconditioned GMRES on the same multiprocessor, and many avenues for their improvement remain unexplored.

Original language | English (US) |
---|---|

Pages (from-to) | 281-301 |

Number of pages | 21 |

Journal | Applied Numerical Mathematics |

Volume | 6 |

Issue number | 4 |

DOIs | |

State | Published - May 1990 |

Externally published | Yes |

### Bibliographical note

Funding Information:in part by the National Science Foundation under contract number EET-8707109. in part by the Office of Naval Research under contract N00014-86-K-0310 and the National under contract number DCR 8521451.

## ASJC Scopus subject areas

- Numerical Analysis
- Computational Mathematics
- Applied Mathematics