Multigrid acceleration of the flux-split Euler equations

Abstract

Multigrid acceleration is applied to a flux-split algorithm for solving the Euler equations in three dimensions. The basic algorithm is an implicit spatially split approximate factorization method. The stability and performance of the scheme in comparison to other factorizations are examined. Results are presented for three-dimensional flows that demonstrate substantially unproved convergence with the multigrid algorithm.