Texas A&M University LibrariesTexas A&M University LibrariesTexas A&M University Libraries
    • Help
    • Login
    OAKTrust
    View Item 
    •   OAKTrust Home
    • Colleges and Schools
    • Office of Graduate and Professional Studies
    • Electronic Theses, Dissertations, and Records of Study (2002– )
    • View Item
    •   OAKTrust Home
    • Colleges and Schools
    • Office of Graduate and Professional Studies
    • Electronic Theses, Dissertations, and Records of Study (2002– )
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Adaptive mesh refinement for a finite difference scheme using a quadtree decomposition approach

    Thumbnail
    View/Open
    AUVIUR-SRINIVASA-THESIS.pdf (2.163Mb)
    Date
    2009-05-15
    Author
    Auviur Srinivasa, Nandagopalan
    Metadata
    Show full item record
    Abstract
    Some numerical simulations of multi-scale physical phenomena consume a significant amount of computational resources, since their domains are discretized on high resolution meshes. An enormous wastage of these resources occurs in refinement of sections of the domain where computation of the solution does not require high resolutions. This problem is effectively addressed by adaptive mesh refinement (AMR), a technique of local refinement of a mesh only in sections where needed, thus allowing concentration of effort where it is required. Sections of the domain needing high resolution are generally determined by means of a criterion which may vary depending on the nature of the problem. Fairly straightforward criteria could include comparing the solution to a threshold or the gradient of a solution, that is, its local rate of change to a threshold. While the former criterion is not particularly rigorous and hardly ever represents a physical phenomenon of interest, it is simple to implement. However, the gradient criterion is not as simple to implement as a direct comparison of values, but it is still quick and a good indicator of the effectiveness of the AMR technique. The objective of this thesis is to arrive at an adaptive mesh refinement algorithm for a finite difference scheme using a quadtree decomposition approach. In the AMR algorithm developed, a mesh of increasingly fine resolution permits high resolution computation in sub-domains of interest and low resolution in others. In this thesis work, the gradient of the solution has been considered as the criterion determining the regions of the domain needing refinement. Initial tests using the AMR algorithm demonstrate that the paradigm adopted has considerable promise for a variety of research problems. The tests performed thus far depict that the quantity of computational resources consumed is significantly less while maintaining the quality of the solution. Analysis included comparison of results obtained with analytical solutions for four test problems, as well as a thorough study of a contemporary problem in solid mechanics.
    URI
    https://hdl.handle.net/1969.1/ETD-TAMU-1144
    Subject
    Mesh Refinement
    Quadtrees
    Collections
    • Electronic Theses, Dissertations, and Records of Study (2002– )
    Citation
    Auviur Srinivasa, Nandagopalan (2006). Adaptive mesh refinement for a finite difference scheme using a quadtree decomposition approach. Master's thesis, Texas A&M University. Available electronically from https : / /hdl .handle .net /1969 .1 /ETD -TAMU -1144.

    DSpace software copyright © 2002-2016  DuraSpace
    Contact Us | Send Feedback
    Theme by 
    Atmire NV
     

     

    Advanced Search

    Browse

    All of OAKTrustCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsDepartmentThis CollectionBy Issue DateAuthorsTitlesSubjectsDepartment

    My Account

    LoginRegister

    Statistics

    View Usage Statistics
    Help and Documentation

    DSpace software copyright © 2002-2016  DuraSpace
    Contact Us | Send Feedback
    Theme by 
    Atmire NV