Answers are grounded in this paper and cite their sources.
A multigrid algorithm has been developed to accelerate the convergence of the Euler equations to a steady state on unstructured triangular meshes. The method operates on a sequence of coarse and fine unstructured meshes and assumes no relation exists between the various meshes. A tree-search algorithm is used to efficiently identify regions of overlap between coarse and fine grid cells. The multigrid method is applied to two different discretizations of the Euler equations, and results about multi-element airfoils are presented. For both discretization schemes, convergence is accelerated by an order of magnitude, resulting in convergence rates comparable to those obtained with structured multigrid algorithms.
No takes yet. Share an insight, caveat, or question.
Dimitri J. Mavriplis (1988) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: