Stabilisation of discrete steady adjoint solvers

A new implicit time-stepping scheme which uses Runge–Kutta time-stepping and Krylov methods as a smoother inside FAS-cycle multigrid acceleration is proposed to stabilise the flow solver and its discrete adjoint counterpart. The algorithm can fully converge the discrete adjoint solver in a wide rang...

Full description

Saved in:
Bibliographic Details
Published in:Journal of computational physics 2015-10, Vol.299, p.175-195
Main Authors: Xu, Shenren, Radford, David, Meyer, Marcus, Müller, Jens-Dominik
Format: Article
Language:English
Subjects:
Adjoints
Algorithms
Blocking
Discrete adjoint
FAS-cycle
GMRES
Implicit
Instability
Multigrid
Reynolds-averaged Navier–Stokes
Robustness
Runge-Kutta method
Solvers
Stability
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:A new implicit time-stepping scheme which uses Runge–Kutta time-stepping and Krylov methods as a smoother inside FAS-cycle multigrid acceleration is proposed to stabilise the flow solver and its discrete adjoint counterpart. The algorithm can fully converge the discrete adjoint solver in a wide range of cases where conventional point-implicit methods fail due to either physical or numerical instability. This enables the discrete adjoint to be applied to a much wider range of flow regimes. In addition, the new algorithm offers improved efficiency when applied to stable cases for which the conventional Block–Jacobi solver can fully converge. Both stable and unstable cases are presented to demonstrate the improved robustness and performance of the new scheme. Eigen-analysis is presented to outline the mechanism of the adjoint stabilisation effect.
ISSN:0021-9991
1090-2716
DOI:10.1016/j.jcp.2015.06.036