Multilevel algorithms for generating coarse grids for multigrid methods
Proceedings of the 2001 ACM/IEEE conference on Supercomputing
Guaranteed-quality parallel Delaunay refinement for restricted polyhedral domains
Computational Geometry: Theory and Applications - Special issue on the 18th annual symposium on computational geometry—SoCG2002
| Hi-index | 0.00 |
A complete ``geometry to drag-polar'''' analysis capability for the three-dimensional high-lift configurations is described. The approach is based on the use of unstructured meshes in order to enable rapid turnaround for complicated geometries that arise in high-lift configurations. Special attention is devoted to creating a capability for enabling analyses on highly resolved grids. Unstructured meshes of several million vertices are initially generated on a work-station, and subsequently refined on a supercomputer. The flow is solved on these refined meshes on large parallel computers using an unstructured agglomeration multigrid algorithm. Good prediction of lift and drag throughout the range of incidences is demonstrated on a transport take-off configuration using up to 24.7 million grid points. The feasibility of using this approach in a production environment on existing parallel machines is demonstrated, as well as the scalability of the solver on machines using up to 1450 processors.