Local-maximum-and-minimum-preserving solution remapping technique to accelerate flow convergence for discontinuous Galerkin methods in shape optimization design (Q2028539)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Local-maximum-and-minimum-preserving solution remapping technique to accelerate flow convergence for discontinuous Galerkin methods in shape optimization design |
scientific article; zbMATH DE number 7353295
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Local-maximum-and-minimum-preserving solution remapping technique to accelerate flow convergence for discontinuous Galerkin methods in shape optimization design |
scientific article; zbMATH DE number 7353295 |
Statements
Local-maximum-and-minimum-preserving solution remapping technique to accelerate flow convergence for discontinuous Galerkin methods in shape optimization design (English)
0 references
1 June 2021
0 references
This article discusses a remapping technique for high-order Discontinuous Galerkin methods to reduce the computational cost of the flow simulations. The proposed technique is applied to a transonic airfoil drag minimization problem and an airfoil inverse design problem where high-order DG solvers are employed for flow simulations of the intermediate shapes.
0 references
solution remapping technique
0 references
discontinuous Galerkin method
0 references
flow convergence
0 references
aerodynamic shape optimization
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
