scispace - formally typeset
Journal ArticleDOI

Unsteady Discrete Adjoint Formulation for Two-Dimensional Flow Problems with Deforming Meshes

Karthik Mani, +1 more
- 01 Jun 2008 - 
- Vol. 46, Iss: 6, pp 1351-1364
Reads0
Chats0
TLDR
In this article, a method to apply the discrete adjoint for computing sensitivity derivatives in two-dimensional unsteady flow problems is presented, which is very general in that it applies directly to the arbitrary Lagrangian-Eulerian form of the governing equations.
Abstract
A method to apply the discrete adjoint for computing sensitivity derivatives in two-dimensional unsteady flow problems is presented. The approach is to first develop a forward or tangent linearization of the nonlinear flow problem in which each individual component building up the complete flow solution is differentiated against the design variables using the chain rule. The reverse or adjoint linearization is then constructed by transposing and reversing the order of multiplication of the forward problem. The developed algorithm is very general in that it applies directly to the arbitrary Lagrangian-Eulerian form of the governing equations and includes the effect of deforming meshes in unsteady flows. It is shown that an unsteady adjoint formulation is essentially a single backward integration in time and that the cost of constructing the final sensitivity vector is close to that of solving the unsteady flow problem integrated forward in time. It is also shown that the unsteady adjoint formulation can be applied to time-integration schemes of different orders of accuracy with minimal changes to the base formulation. The developed technique is then applied to three optimization examples, the first in which the shape of a pitching airfoil is morphed to match a target time-dependent load profile, the second in which the shape is optimized to match a target time-dependent pressure profile, and the last in which the time-dependent drag profile is minimized without any loss in lift.

read more

Citations
More filters
Journal ArticleDOI

Review and Unification of Methods for Computing Derivatives of Multidisciplinary Computational Models

TL;DR: This paper presents a review of all existing discrete methods for computing the derivatives of computational models within a unified mathematical framework that hinges on a new equation, the unifying chain rule, from which all the methods can be derived.
Journal ArticleDOI

Numerical sensitivity analysis for aerodynamic optimization: A survey of approaches

TL;DR: The historical development of these approaches are examined, the theoretical background of each major method and the associated numerical techniques required to make them practical in an engineering setting are described, and what is considered to be the state-of-the-art in these methods are described.
Journal ArticleDOI

Discrete Adjoint-Based Approach for Optimization Problems on Three-Dimensional Unstructured Meshes

TL;DR: A comprehensive strategy for developing and implementing discrete adjoint methods for aerodynamic shape optimization problems is presented, and the adjoint of the complete optimization problem, including flow equations and mesh motion equations is constructed in a modular and verifiable fashion.
Journal ArticleDOI

Least Squares Shadowing sensitivity analysis of chaotic limit cycle oscillations

TL;DR: This paper overcomes the adjoint method failure by replacing the initial value problem with the well-conditioned “least squares shadowing (LSS) problem”, which is then linearized in the sensitivity analysis algorithm, which computes a derivative that converges to the derivative of the infinitely long time average.
Journal ArticleDOI

Topology optimization for unsteady flow

TL;DR: In this paper, a computational methodology for optimizing the conceptual layout of unsteady flow problems at low Reynolds numbers is presented, where a Brinkman penalization is used to enforce zero-velocities in solid material.
References
More filters
Journal ArticleDOI

Approximate Riemann Solvers, Parameter Vectors, and Difference Schemes

TL;DR: In this article, it is shown that these features can be obtained by constructing a matrix with a certain property U, i.e., property U is a property of the solution of the Riemann problem.
Journal ArticleDOI

A limited memory algorithm for bound constrained optimization

TL;DR: An algorithm for solving large nonlinear optimization problems with simple bounds is described, based on the gradient projection method and uses a limited memory BFGS matrix to approximate the Hessian of the objective function.
Journal ArticleDOI

Wing Design by Numerical Optimization

TL;DR: In this article, a study was conducted to assess the feasibility of performing computerized wing design by numerical optimization, which combined a full potential, inviscid aerodynamics code with a conjugate gradient optimization algorithm.
Journal ArticleDOI

Unsteady Euler airfoil solutions using unstructured dynamic meshes

TL;DR: In this article, two algorithms for the solution of the time-dependent Euler equations are presented for unsteady aerodynamic analysis of oscillating airfoils for use on an unstructured grid made up of triangles.
Journal ArticleDOI

What is an adjoint model

TL;DR: Adjoint models are powerful tools for many studies that require an estimate of sensitivity of model output (e.g., a forecast) with respect to input, which can then be used in a variety of applications, including data assimilation, parameter estimation, stability analysis, and synoptic studies as mentioned in this paper.