Comparison of Exact and Approximate Discrete Adjoint for Aerodynamic Shape Optimization
The effect of approximations in the discrete adjoint on constrained shape optimization is investigated. The different approximations are compared with the exact discrete adjoint, which is capable of producing exact gradient/sensitivity information. The purpose of such a comparison is to understand whether or not approximate adjoint codes can be effective for shape optimization in spite of the error in the computed gradient.
KeywordsShape Optimization AIAA Paper Sequential Quadratic Programming Residual Vector Reconstruction Operator
Unable to display preview. Download preview PDF.
- Barth, T.J.:Analysis of Implicit Local Linearization Techniques for Upwind and TVD Algorithms. AIAA Paper 87–0595 (1987).Google Scholar
- Barth, B.J.: Aspects of Unstructured Grids and Finite–Volume Solvers for the Euler and Navier–Stokes Equations. VKI Lecture Series, 1991-06 (1991).Google Scholar
- Barth, T.J., Linton S.W.: An Unstructured Mesh Newton Solver for Compressible Fluid Flow and its Parallel Implementation. AIAA Paper 95–0221 (1995).Google Scholar
- Carpentieri, G., van Tooren, M.J.L., Koren, B.: Improving the Efficiency of Aerodynamic Shape Optimization on Unstructured Meshes. AIAA Paper 2006-298 (2006).Google Scholar
- Carpentieri, G., van Tooren, M.J.L., Koren, B.: Aerodynamic Shape Optimization by Means of Sequential Linear Programming Techniques. ECCOMAS CFD 2006 Paper, to appear (2006).Google Scholar
- Dwight, R.P., Brezillon, J.: Effect of Various Approximations of the Discrete Adjoint on Gradient–Based Optimization. AIAA Paper 2006-690 (2006).Google Scholar
- Vanderplaats, G.N.: Numerical Optimization Techniques for Engineering Design. 3th Edition, Vanderplaats Reasearch & Development (2001)Google Scholar