1992
DOI: 10.1016/0956-0521(92)90116-z
|View full text |Cite
|
Sign up to set email alerts
|

Massively parallel aerodynamic shape optimization

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
12
0

Year Published

1994
1994
2014
2014

Publication Types

Select...
5
1
1

Relationship

0
7

Authors

Journals

citations
Cited by 20 publications
(12 citation statements)
references
References 20 publications
0
12
0
Order By: Relevance
“…Problems of this kind arise in the description of a multitude of scientific and engineering applications including optimal design, control, and parameter identification [8]. Examples of PDE-constrained optimization problems arise in aerodynamics [30,36], mathematical finance [10,15,16], medicine [4,26], and geophysics and environmental engineering [2,1,27]. PDE-constrained optimization problems are infinite-dimensional and often ill-posed in nature, and their discretization invariably leads to systems of equations that are typically very large and difficult to solve.…”
Section: Introductionmentioning
confidence: 99%
“…Problems of this kind arise in the description of a multitude of scientific and engineering applications including optimal design, control, and parameter identification [8]. Examples of PDE-constrained optimization problems arise in aerodynamics [30,36], mathematical finance [10,15,16], medicine [4,26], and geophysics and environmental engineering [2,1,27]. PDE-constrained optimization problems are infinite-dimensional and often ill-posed in nature, and their discretization invariably leads to systems of equations that are typically very large and difficult to solve.…”
Section: Introductionmentioning
confidence: 99%
“…A promising approach to automate the geometric aspects of shape optimization for arbitrary geometries is the skeletal method of [17]. With regard to the difficulties induced by the large number of design and state variables inherent in three dimensions, a framework for addressing these problems is contained within the parallel reduced SQP method of [14]. We intend to incorporate aspects of these approaches into our continuation-SQP algorithm.…”
Section: Discussionmentioning
confidence: 99%
“…The implicit function theorem is invoked to find gradients of objective and constraint functions. In the future we will consider methods that retain the state equations as equality constraints, thereby obviating the need for flow solution at each iteration [14]. An SQP method is used to solve the optimization problem.…”
Section: Numerical Optimizationmentioning
confidence: 99%
“…Optimization problems, constraints with partial differential equation (PDE), arise in many areas such as mathematical finance [2,3,4], aerodynamics [13,15], environmental engineering [11] and medicine [1,10] and generally are infinite dimensional, large and complex. In order to solve a PDE-constrained optimization problem, the question about should I first discretize the optimization problem and then solve the discretized optimization problem (DO), or should first I optimize the continuous problem and obtain a set of equations to discretize (OD), is not avoidable.…”
Section: Introductionmentioning
confidence: 99%
“…Thus (13) and (14) together are aquivalent to (11) and (12). In order to solve this minimization problem, one way is considering the Lagrangian…”
mentioning
confidence: 99%