Algorithm Developments for Discrete Adjoint Methods

Abstract

This paper presents a number of algorithm developments for adjoint methods using the 'discrete' approach in which the discretisation of the non-linear equations is linearised and the resulting matrix is then transposed. With a new iterative procedure for solving the adjoint equations, exact numerical equivalence is maintained between the linear and adjoint discretisations. The incorporation of strong boundary conditions within the discrete approach is discussed, as well as a new application of adjoint methods to linear unsteady flow in turbomachinery.