Convergence acceleration for the steady-state Euler equations. (Q1402651): Difference between revisions

The authors consider iterative solution of equation arising from discretizations of Euler equations governing compressible flow. The differential equations are discretized on a structured grid, and the steady-state solution is computed by time-marching method. A convergence acceleration technique based on semicirculant approximations of the difference operator is used. The technique can be combined with a variety of iterative solvers, but the authors focus on nonlinear explicit Kunge-Kutta time-integration schemes. The main result is that the time step \(k\) is not limited by CFL criterion. On the contrary, \(k\) can be chosen independent of the space step, and experiments show that the work per grid point required for computing a converging solution is bounded by a constant independent of the number of grid points.