Discrete adjoint methodology for general multiphysics problems: A modular and efficient algorithmic outline with implementation in an open-source simulation software

17Citations
Citations of this article
22Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

This article presents a methodology whereby adjoint solutions for partitioned multiphysics problems can be computed efficiently, in a way that is completely independent of the underlying physical sub-problems, the associated numerical solution methods, and the number and type of couplings between them. By applying the reverse mode of algorithmic differentiation to each discipline, and by using a specialized recording strategy, diagonal and cross terms can be evaluated individually, thereby allowing different solution methods for the generic coupled problem (for example block-Jacobi or block-Gauss-Seidel). Based on an implementation in the open-source multiphysics simulation and design software SU2, we demonstrate how the same algorithm can be applied for shape sensitivity analysis on a heat exchanger (conjugate heat transfer), a deforming wing (fluid–structure interaction), and a cooled turbine blade where both effects are simultaneously taken into account.

Cite

CITATION STYLE

APA

Burghardt, O., Gomes, P., Kattmann, T., Economon, T. D., Gauger, N. R., & Palacios, R. (2022). Discrete adjoint methodology for general multiphysics problems: A modular and efficient algorithmic outline with implementation in an open-source simulation software. Structural and Multidisciplinary Optimization, 65(1). https://doi.org/10.1007/s00158-021-03117-5

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free