{"id":{"repo_id":"uiuc","oai_identifier":"oai:www.ideals.illinois.edu:2142/44204"},"canonical_url":"https://search.dev.ndltd.org/etd/uiuc/oai:www.ideals.illinois.edu:2142/44204","repository":{"repo_id":"uiuc","name":"University of Illinois - Urbana-Champaign","base_url":"https://www.ideals.illinois.edu/oai-pmh"},"display":{"title":"Conservative data transfer between non-matching planar interfaces","abstract":"This thesis presents the theory and implementation of a parallel software package for transferring data between non-matching planar interfaces. The method used for transferring data is based on the common refinement technique developed by Jiao and Heath in 2004 [X. Jiao and M.T. Heath. Common-refinement-based data transfer between non-matching meshes in multiphysics simulations. Int. J. Numer. Meth. Engng., 61:2402-2427, 2004]. A modification is made to the base method that provides strict conservation between participating meshes. It is shown that the modified common refinement based method provides accuracy that is equivalent to the standard method while strictly enforcing the form of conservation that is desired. A parallel implementation of the data transfer method is shown to have good scaling when the number of unknowns per processor exceeds 1000. Solving the linear system is the primary aspect of the data transfer process that determines the scalability of the method.","abstract_html":"This thesis presents the theory and implementation of a parallel software package for transferring data between non-matching planar interfaces. The method used for transferring data is based on the common refinement technique developed by Jiao and Heath in 2004 [X. Jiao and M.T. Heath. Common-refinement-based data transfer between non-matching meshes in multiphysics simulations. Int. J. Numer. Meth. Engng., 61:2402-2427, 2004]. A modification is made to the base method that provides strict conservation between participating meshes. It is shown that the modified common refinement based method provides accuracy that is equivalent to the standard method while strictly enforcing the form of conservation that is desired. A parallel implementation of the data transfer method is shown to have good scaling when the number of unknowns per processor exceeds 1000. Solving the linear system is the primary aspect of the data transfer process that determines the scalability of the method.","abstract_has_math":false,"creators":["Tomokiyo, Ryan"],"institution":"University of Illinois at Urbana-Champaign","degree_name":"M.S.","degree_level":"Thesis","degree_discipline":"Aerospace Engineering","degree_department":null,"school":null,"contributors":["Bodony, Daniel J."],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2013,"date_issued":"2013-05-24T21:54:07Z","date_published":"2013-05-24T21:54:07Z","updated_at":"2026-07-22T22:25:33Z","subjects":["Conservative data transfer","Common refinement"],"languages":["en"],"rights":["Copyright 2013 Ryan Tomokiyo"],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/2142/44204","outbound_label":"Handle","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Bodony, Daniel J."]},{"key":"dc:creator","label":"Author","values":["Tomokiyo, Ryan"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2013-05-24T21:54:07Z","2013-05"]},{"key":"dc:type","label":"Dc Type","values":["text"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Aerospace Engineering"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Thesis"]},{"key":"thesis:degree_name","label":"Degree Name","values":["M.S."]},{"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":["Conservative data transfer","Common refinement"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["en"]},{"key":"dc:rights","label":"Dc Rights","values":["Copyright 2013 Ryan Tomokiyo"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["http://hdl.handle.net/2142/44204"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["This thesis presents the theory and implementation of a parallel software package for transferring data between non-matching planar interfaces. The method used for transferring data is based on the common refinement technique developed by Jiao and Heath in 2004 [X. Jiao and M.T. Heath. Common-refinement-based data transfer between non-matching meshes in multiphysics simulations. Int. J. Numer. Meth. Engng., 61:2402-2427, 2004]. A modification is made to the base method that provides strict conservation between participating meshes. It is shown that the modified common refinement based method provides accuracy that is equivalent to the standard method while strictly enforcing the form of conservation that is desired. A parallel implementation of the data transfer method is shown to have good scaling when the number of unknowns per processor exceeds 1000. Solving the linear system is the primary aspect of the data transfer process that determines the scalability of the method.","Item withdrawn by Mark Zulauf (zulauf@illinois.edu) on 2013-04-25T22:28:22Z Item was in collections: University of Illinois Theses & Dissertations (ID: 1) No. of bitstreams: 3 Tomokiyo_Ryan.pdf: 764086 bytes, checksum: 8e7ac3a4ca8166542451b79e40f35428 (MD5) Tomokiyo_Ryan.tex: 57527 bytes, checksum: dc2abb204f0891b3b073dd6eedfd72ad (MD5) Tomokiyo_Ryan.pdf: 764086 bytes, checksum: 8e7ac3a4ca8166542451b79e40f35428 (MD5)","Made available in DSpace on 2013-05-24T21:54:07Z (GMT). No. of bitstreams: 3 Ryan_Tomokiyo.pdf: 764086 bytes, checksum: 8e7ac3a4ca8166542451b79e40f35428 (MD5) Tomokiyo_Ryan.tex: 57527 bytes, checksum: dc2abb204f0891b3b073dd6eedfd72ad (MD5) license.txt: 4063 bytes, checksum: 04a1ff6b92860c61c5bf88bcee2eca86 (MD5)"]},{"key":"dc:title","label":"Title","values":["Conservative data transfer between non-matching planar interfaces"]}]}],"canonical_facts":{"dc:contributor":["Bodony, Daniel J."],"dc:creator":["Tomokiyo, Ryan"],"dc:date":["2013-05-24T21:54:07Z","2013-05"],"dc:description":["This thesis presents the theory and implementation of a parallel software package for transferring data between non-matching planar interfaces. The method used for transferring data is based on the common refinement technique developed by Jiao and Heath in 2004 [X. Jiao and M.T. Heath. Common-refinement-based data transfer between non-matching meshes in multiphysics simulations. Int. J. Numer. Meth. Engng., 61:2402-2427, 2004]. A modification is made to the base method that provides strict conservation between participating meshes. It is shown that the modified common refinement based method provides accuracy that is equivalent to the standard method while strictly enforcing the form of conservation that is desired. A parallel implementation of the data transfer method is shown to have good scaling when the number of unknowns per processor exceeds 1000. Solving the linear system is the primary aspect of the data transfer process that determines the scalability of the method.","Item withdrawn by Mark Zulauf (zulauf@illinois.edu) on 2013-04-25T22:28:22Z Item was in collections: University of Illinois Theses & Dissertations (ID: 1) No. of bitstreams: 3 Tomokiyo_Ryan.pdf: 764086 bytes, checksum: 8e7ac3a4ca8166542451b79e40f35428 (MD5) Tomokiyo_Ryan.tex: 57527 bytes, checksum: dc2abb204f0891b3b073dd6eedfd72ad (MD5) Tomokiyo_Ryan.pdf: 764086 bytes, checksum: 8e7ac3a4ca8166542451b79e40f35428 (MD5)","Made available in DSpace on 2013-05-24T21:54:07Z (GMT). No. of bitstreams: 3 Ryan_Tomokiyo.pdf: 764086 bytes, checksum: 8e7ac3a4ca8166542451b79e40f35428 (MD5) Tomokiyo_Ryan.tex: 57527 bytes, checksum: dc2abb204f0891b3b073dd6eedfd72ad (MD5) license.txt: 4063 bytes, checksum: 04a1ff6b92860c61c5bf88bcee2eca86 (MD5)"],"dc:identifier":["http://hdl.handle.net/2142/44204"],"dc:language":["en"],"dc:rights":["Copyright 2013 Ryan Tomokiyo"],"dc:subject":["Conservative data transfer","Common refinement"],"dc:title":["Conservative data transfer between non-matching planar interfaces"],"dc:type":["text"],"thesis:degree_discipline":["Aerospace Engineering"],"thesis:degree_level":["Thesis"],"thesis:degree_name":["M.S."],"thesis:institution_name":["University of Illinois at Urbana-Champaign"]},"updated_at":"2026-07-22T22:25:33Z"}