2015
DOI: 10.1016/j.jcp.2015.06.036
|View full text |Cite
|
Sign up to set email alerts
|

Stabilisation of discrete steady adjoint solvers

Abstract: 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 … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
46
0

Year Published

2015
2015
2023
2023

Publication Types

Select...
4
3
1

Relationship

4
4

Authors

Journals

citations
Cited by 59 publications
(46 citation statements)
references
References 38 publications
0
46
0
Order By: Relevance
“…The JT-KIRK method presented in [4] uses m Runge-Kutta stages to proceed from an intermediate solution Un to an improved solution Un+1 as follows:…”
Section: The Jt-kirk Methodsmentioning
confidence: 99%
See 1 more Smart Citation
“…The JT-KIRK method presented in [4] uses m Runge-Kutta stages to proceed from an intermediate solution Un to an improved solution Un+1 as follows:…”
Section: The Jt-kirk Methodsmentioning
confidence: 99%
“…JT-KIRK, a method that has been presented recently [4] for problems with mild unsteadiness, uses a different approach to stabilise the adjoint solver. Instead of using an arbitrary snapshot with shedding, an implicit solver with strong temporal damping properties is used for the primal solution.…”
Section: Introductionmentioning
confidence: 99%
“…The Reynolds-Averaged Navier-Stokes equations are solved on multiblock structured grids with a cell-centered finite volume formulation, based on an adaptation of the JT-KIRK scheme of Xu et al [22]. Convective fluxes are computed using Roe's approximate Riemann solver [23] with a MUSCL-type reconstruction [24] of primitive variables for second-order accuracy.…”
Section: Cfd Solvermentioning
confidence: 99%
“…Furthermore, to reduce the computational cost, periodic boundary conditions are applied in circumferential direction. Time integration is realized with an adaption of the JT-KIRK scheme [50] that combines Runge-Kutta time-stepping and Krylov methods inside a geometric multigrid cycle. As illustrated in [50], the proposed algorithm enables fully converged flow solutions for some cases where conventional algorithms would fail, and therefore extends the applicability of adjoint-based optimization for marginally stable applications.…”
Section: Flow Solvermentioning
confidence: 99%
“…This approach has two main advantages: first, the resulting memory footprint of the adjoint solver is similar to the primal flow solver, which is largely determined by the system matrix P, while the run-time of the adjoint solver is equivalent to the primal flow solver. Secondly, since the transposed system matrix P T has the same eigenspectra as P, the adjoint solver inherits the convergence rate of the flow solver [50,52,53], which is illustrated in Figure 8 for a radial turbine test case. This is a desirable property as it guarantees convergence of the adjoint problem, provided that primal flow solver converges (i.e., the system matrix at the last iteration of the flow solver is contractive with the magnitude of all eigenvalues less than unity).…”
Section: Adjoint Solver and Gradient Evaluationmentioning
confidence: 99%