{"id":{"repo_id":"uiuc","oai_identifier":"oai:www.ideals.illinois.edu:2142/21220"},"canonical_url":"https://search.dev.ndltd.org/etd/uiuc/oai:www.ideals.illinois.edu:2142/21220","repository":{"repo_id":"uiuc","name":"University of Illinois - Urbana-Champaign","base_url":"https://www.ideals.illinois.edu/oai-pmh"},"display":{"title":"Autonomous hierarchical adaptive mesh refinement for multiscale simulations","abstract":"Modern high-resolution numerical simulations of multiscale physical phenomena require enormous computer resources; however, these resources are largely wasted on subdomains whose solutions do not require such high resolutions. Adaptive mesh refinement (AMR) addresses this problem by providing a means to perform high-resolution computation only in areas that require it. In the AMR strategy discussed, a nested hierarchy of overlaying grids of increasingly fine resolution--in both space and time--permits high resolution computation in some areas and low resolution in others, either as a set of virtual grids, each encompassing the entire domain, or as a means of zooming in on a subdomain of interest. However, this AMR strategy is both subtle and cumbersome to code, and its data requirements are difficult to manage in a general way. To address this shortcoming, the Hierarchical Adaptive Mesh Refinement (HAMR) system provides support not only for AMR, but also for autonomous data management, thereby decoupling the numerical techniques of a simulation from the adaptive grid hierarchy to which it is applied.","abstract_html":"Modern high-resolution numerical simulations of multiscale physical phenomena require enormous computer resources; however, these resources are largely wasted on subdomains whose solutions do not require such high resolutions. Adaptive mesh refinement (AMR) addresses this problem by providing a means to perform high-resolution computation only in areas that require it. In the AMR strategy discussed, a nested hierarchy of overlaying grids of increasingly fine resolution--in both space and time--permits high resolution computation in some areas and low resolution in others, either as a set of virtual grids, each encompassing the entire domain, or as a means of zooming in on a subdomain of interest. However, this AMR strategy is both subtle and cumbersome to code, and its data requirements are difficult to manage in a general way. To address this shortcoming, the Hierarchical Adaptive Mesh Refinement (HAMR) system provides support not only for AMR, but also for autonomous data management, thereby decoupling the numerical techniques of a simulation from the adaptive grid hierarchy to which it is applied.","abstract_has_math":false,"creators":["Neeman, Henry Joel"],"institution":"University of Illinois at Urbana-Champaign","degree_name":"Ph.D.","degree_level":"Dissertation","degree_discipline":"Computer Science","degree_department":null,"school":null,"contributors":["Heath, Michael T."],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2011,"date_issued":"2011-05-07T13:02:03Z","date_published":"2011-05-07T13:02:03Z","updated_at":"2026-07-22T22:25:17Z","subjects":["Computer Science"],"languages":["eng"],"rights":["Copyright 1996 Neeman, Henry Joel"],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier","label":"Identifier","values":["9780591198430","AAI9712386","(UMI)AAI9712386"],"render_values":[{"text":"9780591198430","href":null,"code":true},{"text":"AAI9712386","href":null,"code":true},{"text":"(UMI)AAI9712386","href":null,"code":true}]}]},"links":{"outbound_url":"http://hdl.handle.net/2142/21220","outbound_label":"Handle","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Heath, Michael T."]},{"key":"dc:creator","label":"Author","values":["Neeman, Henry Joel"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2011-05-07T13:02:03Z","10000-01-01","1996"]},{"key":"dc:type","label":"Dc Type","values":["text"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Computer Science"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Dissertation"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Ph.D."]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["University of Illinois at Urbana-Champaign"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Computer Science"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["eng"]},{"key":"dc:rights","label":"Dc Rights","values":["Copyright 1996 Neeman, Henry Joel"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["9780591198430","AAI9712386","(UMI)AAI9712386","http://hdl.handle.net/2142/21220"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["Modern high-resolution numerical simulations of multiscale physical phenomena require enormous computer resources; however, these resources are largely wasted on subdomains whose solutions do not require such high resolutions. Adaptive mesh refinement (AMR) addresses this problem by providing a means to perform high-resolution computation only in areas that require it. In the AMR strategy discussed, a nested hierarchy of overlaying grids of increasingly fine resolution--in both space and time--permits high resolution computation in some areas and low resolution in others, either as a set of virtual grids, each encompassing the entire domain, or as a means of zooming in on a subdomain of interest. However, this AMR strategy is both subtle and cumbersome to code, and its data requirements are difficult to manage in a general way. To address this shortcoming, the Hierarchical Adaptive Mesh Refinement (HAMR) system provides support not only for AMR, but also for autonomous data management, thereby decoupling the numerical techniques of a simulation from the adaptive grid hierarchy to which it is applied.","Made available in DSpace on 2011-05-07T13:02:03Z (GMT). No. of bitstreams: 2 license.txt: 4922 bytes, checksum: 910b249b4beec47e7ab768910c8f966f (MD5) 9712386.pdf: 9655336 bytes, checksum: 545455bb3779b6aace9cd9659423923f (MD5) Previous issue date: 1996","Item marked as restricted to the 'UIUC Users [automated]' Group (id=2) by Howard Ding (hding2@illinois.edu) on 2011-05-07T14:49:18Z Item is restricted indefinitely.","Restriction data tranferred 2014-07-01T11:22:24-05:00 Original Data Group with Access UIUC Users [automated] Release Date: none Reason: ETDs are only available to UIUC Users without author permission","ETDs are only available to UIUC Users without author permission","U of I Only"]},{"key":"dc:title","label":"Title","values":["Autonomous hierarchical adaptive mesh refinement for multiscale simulations"]}]}],"canonical_facts":{"dc:contributor":["Heath, Michael T."],"dc:creator":["Neeman, Henry Joel"],"dc:date":["2011-05-07T13:02:03Z","10000-01-01","1996"],"dc:description":["Modern high-resolution numerical simulations of multiscale physical phenomena require enormous computer resources; however, these resources are largely wasted on subdomains whose solutions do not require such high resolutions. Adaptive mesh refinement (AMR) addresses this problem by providing a means to perform high-resolution computation only in areas that require it. In the AMR strategy discussed, a nested hierarchy of overlaying grids of increasingly fine resolution--in both space and time--permits high resolution computation in some areas and low resolution in others, either as a set of virtual grids, each encompassing the entire domain, or as a means of zooming in on a subdomain of interest. However, this AMR strategy is both subtle and cumbersome to code, and its data requirements are difficult to manage in a general way. To address this shortcoming, the Hierarchical Adaptive Mesh Refinement (HAMR) system provides support not only for AMR, but also for autonomous data management, thereby decoupling the numerical techniques of a simulation from the adaptive grid hierarchy to which it is applied.","Made available in DSpace on 2011-05-07T13:02:03Z (GMT). No. of bitstreams: 2 license.txt: 4922 bytes, checksum: 910b249b4beec47e7ab768910c8f966f (MD5) 9712386.pdf: 9655336 bytes, checksum: 545455bb3779b6aace9cd9659423923f (MD5) Previous issue date: 1996","Item marked as restricted to the 'UIUC Users [automated]' Group (id=2) by Howard Ding (hding2@illinois.edu) on 2011-05-07T14:49:18Z Item is restricted indefinitely.","Restriction data tranferred 2014-07-01T11:22:24-05:00 Original Data Group with Access UIUC Users [automated] Release Date: none Reason: ETDs are only available to UIUC Users without author permission","ETDs are only available to UIUC Users without author permission","U of I Only"],"dc:identifier":["9780591198430","AAI9712386","(UMI)AAI9712386","http://hdl.handle.net/2142/21220"],"dc:language":["eng"],"dc:rights":["Copyright 1996 Neeman, Henry Joel"],"dc:subject":["Computer Science"],"dc:title":["Autonomous hierarchical adaptive mesh refinement for multiscale simulations"],"dc:type":["text"],"thesis:degree_discipline":["Computer Science"],"thesis:degree_level":["Dissertation"],"thesis:degree_name":["Ph.D."],"thesis:institution_name":["University of Illinois at Urbana-Champaign"]},"updated_at":"2026-07-22T22:25:17Z"}