Aerodynamic shape optimization using simultaneous pseudo-timestepping

Hazra, Subhendu Bikash; Schulz, Volker; Brézillon, Joël; Gauger, Nicolas R.

doi:10.1016/j.jcp.2004.10.007

Cited by 91 publications

(64 citation statements)

References 30 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…ASO problems in compressible viscous flow were also performed using simultaneous pseudo-time stepping (Hazra et al, 2005). Hazra et al (2005) could optimize airfoil surface by use of a preconditioner for convergence acceleration which stems from the reduced sequential quadratic programming (SQP) methods.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Optimization of Airfoils for Minimum Pitching Moment and Compressibility Drag Coefficients

Farrokhfal

Pishevar²

2014

J.Aerosp. Technol. Manag.

View full text Add to dashboard Cite

This paper concerns a numerical optimization method for designing airfoils based on adjoint method. The goal of present work is to reduce the compressibility drag or pitching moment of transonic airfoils without compromising on the lift coefficient. A new cost function based on this requirement is defined and the corresponding adjoint equations are discussed in details. At the end, by demonstrating some numerical results, we show that this technique is capable of converging to the optimum design point corresponding to the initial geometry of the airfoil.

show abstract

Section: Introductionmentioning

confidence: 99%

“…Hazra et al (2005) could optimize airfoil surface by use of a preconditioner for convergence acceleration which stems from the reduced sequential quadratic programming (SQP) methods.…”

Section: Introductionmentioning

confidence: 99%

Optimization of Airfoils for Minimum Pitching Moment and Compressibility Drag Coefficients

Farrokhfal

Pishevar²

2014

J.Aerosp. Technol. Manag.

View full text Add to dashboard Cite

show abstract

“…Several authors have effectively used these methods in the field of aerodynamics design, see e.g. [6,7]. Using these methods, the complete shape optimization problem can be solved at an equivalent cost of roughly 5 to 10 forward flow simulations.…”

Section: The Optimization Approach To Divertor Target Designmentioning

confidence: 99%

Adapting computational optimization concepts from aeronautics to nuclear fusion reactor design

Dekeyser

Reiter

Baelmans

2012

EPJ Web of Conferences

View full text Add to dashboard Cite

Abstract. Even on the most powerful supercomputers available today, computational nuclear fusion reactor divertor design is extremely CPU demanding, not least due to the large number of design variables and the hybrid micro-macro character of the flows. Therefore, automated design methods based on optimization can greatly assist current reactor design studies. Over the past decades, have proven their virtue in the field of aerodynamics. Applications include drag reduction for wing and wing-body configurations. Here we demonstrate that also for divertor design, these optimization methods have a large potential. Specifically, we apply the continuous adjoint method to the optimization of the divertor geometry in a 2D poloidal cross section of an axisymmetric tokamak device (as, e.g., JET and ITER), using a simplified model for the plasma edge. The design objective is to spread the target material heat load as much as possible by controlling the shape of the divertor, while maintaining the full helium ash removal capabilities of the vacuum pumping system.

show abstract

“…In [3][4][5][6] we have applied the method for solving aerodynamic shape optimization problems without additional state constraints and in [7][8][9] applied the method to problems with additional state constraints. The overall cost of computation in all the applications has been between 2 -8 times as that of the forward simulation runs, whereas in traditional gradient methods the cost of computation is between 30 -60 forward simulation runs.…”

Section: Introductionmentioning

confidence: 99%

Multigrid One-Shot Method for PDE-Constrained Optimization Problems

Hazra

2012

View full text Add to dashboard Cite

This paper presents a numerical method for PDE-constrained optimization problems. These problems arise in many fields of science and engineering including those dealing with real applications. The physical problem is modeled by partial differential equations (PDEs) and involve optimization of some quantity. The PDEs are in most cases nonlinear and solved using numerical methods. Since such numerical solutions are being used routinely, the recent trend has been to develop numerical methods and algorithms so that the optimization problems can be solved numerically as well using the same PDE-solver. We present here one such numerical method which is based on simultaneous pseudo-time stepping. The efficiency of the method is increased with the help of a multigrid strategy. Application example is included for an aerodynamic shape optimization problem.

show abstract

Aerodynamic shape optimization using simultaneous pseudo-timestepping

Cited by 91 publications

References 30 publications

Optimization of Airfoils for Minimum Pitching Moment and Compressibility Drag Coefficients

Optimization of Airfoils for Minimum Pitching Moment and Compressibility Drag Coefficients

Adapting computational optimization concepts from aeronautics to nuclear fusion reactor design

Multigrid One-Shot Method for PDE-Constrained Optimization Problems

Contact Info

Product

Resources

About