Show simple item record

A quadtree-based adaptively-refined Cartesian-grid algorithm for solution of the Euler equations.

dc.contributor.authorDe Zeeuw, Darren L.en_US
dc.contributor.advisorPowell, Kenneth G.en_US
dc.date.accessioned2014-02-24T16:17:00Z
dc.date.available2014-02-24T16:17:00Z
dc.date.issued1993en_US
dc.identifier.other(UMI)AAI9409674en_US
dc.identifier.urihttp://gateway.proquest.com/openurl?url_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:dissertation&res_dat=xri:pqm&rft_dat=xri:pqdiss:9409674en_US
dc.identifier.urihttps://hdl.handle.net/2027.42/103745
dc.description.abstractA method for solution of the steady two-dimensional Euler equations is presented. The scheme is designed to overcome the difficulties associated with geometric complexity and the existence of disparate length scales in the computed flow-fields. An adaptively-refined Cartesian grid defined by a tree-based data structure is used. Connectivity information is obtained from the data tree via the parent/children relationships of the cells. Initial grid generation is enhanced by geometry-based cell adaptation. The solution is converged to a steady state using a linear reconstruction and an approximate Riemann solver. Multi-stage time stepping and multigrid convergence acceleration are used to advance the solution in time. Solution adaptation is achieved through the use of solution-based gradient information. This enables the grid resolution to match more closely the local length scales of the flow. The initial grid is generated with a minimum of user input for any complex configuration. The user need only specify a set of points defining the bodies, the base grid resolution, and cell size thresholds for the geometry-based adaptation. With proper thresholds, the grid is automatically adapted to the curvature of a body, providing the resolution required to resolve that body adequately. The grid is then improved through the use of solution-based adaptation. The difficulties associated with the small cut cells created by the arbitrary way that the Cartesian grid cuts through the body are overcome by using local time-stepping, coupled with a linear reconstruction method designed specifically for unstructured grids. The solutions obtained show the second-order global accuracy of the scheme. Results are presented for airfoils at subsonic, transonic, and supersonic speeds. The results compare favorably with benchmark solutions on structured grids with substantially more cells. Also included are a channel flow, several axisymetric jet flows, and several multi-element airfoil flows. In all cases, the small cut cells generated by the intersection of the body with the Cartesian grid have no adverse effect on the smoothness of the solution. The broad range of results presented demonstrates the geometric flexibility of this approach, as well as the accuracy and efficiency attainable by solution-based adaptation.en_US
dc.format.extent147 p.en_US
dc.subjectEngineering, Aerospaceen_US
dc.subjectComputer Scienceen_US
dc.titleA quadtree-based adaptively-refined Cartesian-grid algorithm for solution of the Euler equations.en_US
dc.typeThesisen_US
dc.description.thesisdegreenamePhDen_US
dc.description.thesisdegreedisciplineAerospace Engineering and Scientific Computingen_US
dc.description.thesisdegreegrantorUniversity of Michigan, Horace H. Rackham School of Graduate Studiesen_US
dc.description.bitstreamurlhttp://deepblue.lib.umich.edu/bitstream/2027.42/103745/1/9409674.pdf
dc.description.filedescriptionDescription of 9409674.pdf : Restricted to UM users only.en_US
dc.owningcollnameDissertations and Theses (Ph.D. and Master's)


Files in this item

Show simple item record

Remediation of Harmful Language

The University of Michigan Library aims to describe library materials in a way that respects the people and communities who create, use, and are represented in our collections. Report harmful or offensive language in catalog records, finding aids, or elsewhere in our collections anonymously through our metadata feedback form. More information at Remediation of Harmful Language.

Accessibility

If you are unable to use this file in its current format, please select the Contact Us link and we can modify it to make it more accessible to you.