2018
DOI: 10.1016/j.ast.2018.05.023
|View full text |Cite
|
Sign up to set email alerts
|

Multi-fidelity aerodynamic design trade-off exploration using point-by-point Pareto set identification

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
10
0
2

Year Published

2019
2019
2023
2023

Publication Types

Select...
4
2

Relationship

2
4

Authors

Journals

citations
Cited by 20 publications
(12 citation statements)
references
References 67 publications
0
10
0
2
Order By: Relevance
“…The multi-fidelity point-by-point algorithm (Amrit et al , 2017b) utilizes any single point on the Pareto front as its starting point and is obtained by a space-mapping-based single objective optimization. From the starting point, the MOO algorithm produces a sequence of optimal designs x ( k ) , k = 1, 2, …, point by point.…”
Section: Methodsmentioning
confidence: 99%
See 4 more Smart Citations
“…The multi-fidelity point-by-point algorithm (Amrit et al , 2017b) utilizes any single point on the Pareto front as its starting point and is obtained by a space-mapping-based single objective optimization. From the starting point, the MOO algorithm produces a sequence of optimal designs x ( k ) , k = 1, 2, …, point by point.…”
Section: Methodsmentioning
confidence: 99%
“…The two SOO problems, i.e. to minimize the drag coefficient ( C D ) and to minimize the pitching moment coefficient ( C M ), are solved using the SM algorithm (Amrit et al , 2017b), and results are shown in Table IV. The cost in terms of CPU time for each of the SOO process is approximately 9 h on an HPC with 32 processors.…”
Section: Numerical Examplesmentioning
confidence: 99%
See 3 more Smart Citations