## Globalized Newton-Krylov-Schwarz algorithms and software for parallel implicit CFD (1998)

### Cached

### Download Links

Venue: | Int. J. High Performance Computing Applications |

Citations: | 36 - 14 self |

### BibTeX

@ARTICLE{Gropp98globalizednewton-krylov-schwarz,

author = {W. D. Gropp and D. E. Keyes and L. C. Mcinnes and M. D. Tidriri},

title = {Globalized Newton-Krylov-Schwarz algorithms and software for parallel implicit CFD},

journal = {Int. J. High Performance Computing Applications},

year = {1998},

volume = {14},

pages = {102--136}

}

### Years of Citing Articles

### OpenURL

### Abstract

Key words. Newton-Krylov-Schwarz algorithms, parallel CFD, implicit methods Abstract. Implicit solution methods are important in applications modeled by PDEs with disparate temporal and spatial scales. Because such applications require high resolution with reasonable turnaround, parallelization is essential. The pseudo-transient matrix-free Newton-Krylov-Schwarz (ΨNKS) algorithmic framework is presented as a widely applicable answer. This article shows that, for the classical problem of three-dimensional transonic Euler flow about an M6 wing, ΨNKS can simultaneously deliver • globalized, asymptotically rapid convergence through adaptive pseudo-transient continuation and Newton’s method; • reasonable parallelizability for an implicit method through deferred synchronization and favorable communication-to-computation scaling in the Krylov linear solver; and • high per-processor performance through attention to distributed memory and cache locality, especially through the Schwarz preconditioner. Two discouraging features of ΨNKS methods are their sensitivity to the coding of the underlying PDE discretization and the large number of parameters that must be selected to govern convergence. We therefore distill several recommendations from our experience and from our reading of the literature on various algorithmic components of ΨNKS, and we describe a freely available, MPI-based portable parallel software implementation of the solver employed here. 1. Introduction. Disparate