Return to search

A Quadtree-based Adaptively-refined Cartesian-grid Algorithm For Solution Of The Euler Equations

A Cartesian method for solution of the steady two-dimensional Euler equations is produced. Dynamic data structures are used and both geometric and solution-based
adaptations are applied. Solution adaptation is achieved through solution-based gradient information. The finite volume method is used with cell-centered approach. The solution is converged to a steady state by means of an approximate Riemann solver. Local time step is used for convergence acceleration. A multistage time stepping scheme is used to advance the solution in time. A number of internal and
external flow problems are solved in order to demonstrate the efficiency and accuracy of the method.

Identiferoai:union.ndltd.org:METU/oai:etd.lib.metu.edu.tr:http://etd.lib.metu.edu.tr/upload/12606687/index.pdf
Date01 October 2005
CreatorsBulgok, Murat
ContributorsAksel, Haluk M.
PublisherMETU
Source SetsMiddle East Technical Univ.
LanguageEnglish
Detected LanguageEnglish
TypeM.S. Thesis
Formattext/pdf
RightsTo liberate the content for public access

Page generated in 0.0017 seconds