Convergence acceleration for the steady-state Euler equations

We consider the iterative solution of systems of equations arising from discretizations of the non-linear Euler equations governing compressible flow. The differential equation is discretized on a structured grid, and the steady-state solution is computed by a time-marching method.A convergence acceleration technique based on semicirculant approximations of the difference operator or the Jacobian is used. Implementation issues and variants of the scheme allowing for a reduction of the arithmetic complexity and memory requirement are discussed. The technique can be combined with a variety of iterative solvers, but we focus on non-linear explicit Runge-Kutta time-integration schemes. The results show that the single-stage forward Euler method can be used, and that the time step is not limited by a CFL-criterion. This results in that the arithmetic work required for computing the solution is equivalent to the work required for a fixed number of residual evaluations.