The Mathematical Institute, University of Oxford, Eprints Archive

Algorithm Developments for Discrete Adjoint Methods

Giles, M. B. and Duta, Mihai C. and Mueller, Jens-Dominik and Pierce, Niles A. (2001) Algorithm Developments for Discrete Adjoint Methods. Technical Report. Unspecified. (Submitted)

[img]
Preview
PDF
367Kb

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.

Item Type:Technical Report (Technical Report)
Subjects:H - N > Numerical analysis
Research Groups:Numerical Analysis Group
ID Code:1236
Deposited By:Lotti Ekert
Deposited On:20 May 2011 09:20
Last Modified:20 May 2011 09:20

Repository Staff Only: item control page