Multi-Model Multi-Domain Computational Methods: Algorithm Comparison

The following two figures present the convergence history for a steady Euler simulation using four different globalized solution algorithms. These plots show the cumulative advantages of implicit boundary conditions, advancing CFL, and matrix-free representation of the Jacobian, in terms of both iteration count (number of pseudo-timesteps) and overall execution time. Our preferred matrix-free pseudo-transient NKS technique is represented by the leftmost solid curve, while the legacy code is shown by the rightmost dotted curve; two intermediate enhancements are also indicated.

Reference: W. D. Gropp, D. E. Keyes, L. C. McInnes and M. D. Tidriri, 1997, "Parallel Implicit PDE Computations: Algorithms and Software", in Proceedings of Parallel CFD'97, A. Ecer et al., eds., Elsevier (to appear).

[ Up: Steady Euler Overview ]