{"id":{"repo_id":"uiuc","oai_identifier":"oai:www.ideals.illinois.edu:2142/22248"},"canonical_url":"https://search.dev.ndltd.org/etd/uiuc/oai:www.ideals.illinois.edu:2142/22248","repository":{"repo_id":"uiuc","name":"University of Illinois - Urbana-Champaign","base_url":"https://www.ideals.illinois.edu/oai-pmh"},"display":{"title":"Boundary method-based domain decomposition on multiprocessors","abstract":"An efficient method has been developed for the fast solution of the boundary problems of Poisson's equation on irregular as well as regular domains. The method, called the boundary method-based domain decomposition or BMDD, combines the attractiveness of the domain decomposition technique in parallel solution of the boundary value problem with the advantage of a boundary method. Unlike the Schwarz alternating method or the iterative substructuring method, where the interface values are usually solved by Preconditioned Conjugate Gradient iteration which requires subdomain solvers for all subdomains at each step, in the BMDD approach the interface values are evaluated after an approximate solution in an explicit form is obtained by a boundary method. Our method is suitable for parallel processing, because the dominant part of computation is solving completely independent subproblems, and computation of the interface values by a boundary method also involves trivial parallelization in matrix generation and in evaluation of interface values. The HPA (harmonic polynomial approximation), including the AHPA (augmented HPA), has been identified as a preferred boundary method to be used with BMDD, based on our analysis and numerical experiments. A new parallel Poisson solver has been obtained, which consists of a Poisson kernel method-like parallel Laplace solver on an irregular domain and a parallel Poisson solver on a disk based on integral formulation.","abstract_html":"An efficient method has been developed for the fast solution of the boundary problems of Poisson's equation on irregular as well as regular domains. The method, called the boundary method-based domain decomposition or BMDD, combines the attractiveness of the domain decomposition technique in parallel solution of the boundary value problem with the advantage of a boundary method. Unlike the Schwarz alternating method or the iterative substructuring method, where the interface values are usually solved by Preconditioned Conjugate Gradient iteration which requires subdomain solvers for all subdomains at each step, in the BMDD approach the interface values are evaluated after an approximate solution in an explicit form is obtained by a boundary method. Our method is suitable for parallel processing, because the dominant part of computation is solving completely independent subproblems, and computation of the interface values by a boundary method also involves trivial parallelization in matrix generation and in evaluation of interface values. The HPA (harmonic polynomial approximation), including the AHPA (augmented HPA), has been identified as a preferred boundary method to be used with BMDD, based on our analysis and numerical experiments. A new parallel Poisson solver has been obtained, which consists of a Poisson kernel method-like parallel Laplace solver on an irregular domain and a parallel Poisson solver on a disk based on integral formulation.","abstract_has_math":false,"creators":["Lee, Daeshik"],"institution":"University of Illinois at Urbana-Champaign","degree_name":"Ph.D.","degree_level":"Dissertation","degree_discipline":"Computer Science","degree_department":null,"school":null,"contributors":["Gallopoulos, E."],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2011,"date_issued":"2011-05-07T13:33:50Z","date_published":"2011-05-07T13:33:50Z","updated_at":"2026-07-22T22:25:19Z","subjects":["Mathematics","Computer Science"],"languages":["eng"],"rights":["Copyright 1991 Lee, Daeshik"],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier","label":"Identifier","values":["(UMI)AAI9210885","AAI9210885"],"render_values":[{"text":"(UMI)AAI9210885","href":null,"code":true},{"text":"AAI9210885","href":null,"code":true}]}]},"links":{"outbound_url":"http://hdl.handle.net/2142/22248","outbound_label":"Handle","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Gallopoulos, E."]},{"key":"dc:creator","label":"Author","values":["Lee, Daeshik"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2011-05-07T13:33:50Z","10000-01-01","1991"]},{"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":["Mathematics","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 1991 Lee, Daeshik"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["(UMI)AAI9210885","http://hdl.handle.net/2142/22248","AAI9210885"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["An efficient method has been developed for the fast solution of the boundary problems of Poisson's equation on irregular as well as regular domains. The method, called the boundary method-based domain decomposition or BMDD, combines the attractiveness of the domain decomposition technique in parallel solution of the boundary value problem with the advantage of a boundary method. Unlike the Schwarz alternating method or the iterative substructuring method, where the interface values are usually solved by Preconditioned Conjugate Gradient iteration which requires subdomain solvers for all subdomains at each step, in the BMDD approach the interface values are evaluated after an approximate solution in an explicit form is obtained by a boundary method. Our method is suitable for parallel processing, because the dominant part of computation is solving completely independent subproblems, and computation of the interface values by a boundary method also involves trivial parallelization in matrix generation and in evaluation of interface values. The HPA (harmonic polynomial approximation), including the AHPA (augmented HPA), has been identified as a preferred boundary method to be used with BMDD, based on our analysis and numerical experiments. A new parallel Poisson solver has been obtained, which consists of a Poisson kernel method-like parallel Laplace solver on an irregular domain and a parallel Poisson solver on a disk based on integral formulation.","Made available in DSpace on 2011-05-07T13:33:50Z (GMT). No. of bitstreams: 2 license.txt: 4922 bytes, checksum: 910b249b4beec47e7ab768910c8f966f (MD5) 9210885.pdf: 4593583 bytes, checksum: 5615d5846ba009ef52022f070bb88e73 (MD5) Previous issue date: 1991","Item marked as restricted to the 'UIUC Users [automated]' Group (id=2) by Howard Ding (hding2@illinois.edu) on 2011-05-07T14:56:20Z Item is restricted indefinitely.","Restriction data tranferred 2014-07-01T11:26:19-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":["Boundary method-based domain decomposition on multiprocessors"]}]}],"canonical_facts":{"dc:contributor":["Gallopoulos, E."],"dc:creator":["Lee, Daeshik"],"dc:date":["2011-05-07T13:33:50Z","10000-01-01","1991"],"dc:description":["An efficient method has been developed for the fast solution of the boundary problems of Poisson's equation on irregular as well as regular domains. The method, called the boundary method-based domain decomposition or BMDD, combines the attractiveness of the domain decomposition technique in parallel solution of the boundary value problem with the advantage of a boundary method. Unlike the Schwarz alternating method or the iterative substructuring method, where the interface values are usually solved by Preconditioned Conjugate Gradient iteration which requires subdomain solvers for all subdomains at each step, in the BMDD approach the interface values are evaluated after an approximate solution in an explicit form is obtained by a boundary method. Our method is suitable for parallel processing, because the dominant part of computation is solving completely independent subproblems, and computation of the interface values by a boundary method also involves trivial parallelization in matrix generation and in evaluation of interface values. The HPA (harmonic polynomial approximation), including the AHPA (augmented HPA), has been identified as a preferred boundary method to be used with BMDD, based on our analysis and numerical experiments. A new parallel Poisson solver has been obtained, which consists of a Poisson kernel method-like parallel Laplace solver on an irregular domain and a parallel Poisson solver on a disk based on integral formulation.","Made available in DSpace on 2011-05-07T13:33:50Z (GMT). No. of bitstreams: 2 license.txt: 4922 bytes, checksum: 910b249b4beec47e7ab768910c8f966f (MD5) 9210885.pdf: 4593583 bytes, checksum: 5615d5846ba009ef52022f070bb88e73 (MD5) Previous issue date: 1991","Item marked as restricted to the 'UIUC Users [automated]' Group (id=2) by Howard Ding (hding2@illinois.edu) on 2011-05-07T14:56:20Z Item is restricted indefinitely.","Restriction data tranferred 2014-07-01T11:26:19-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":["(UMI)AAI9210885","http://hdl.handle.net/2142/22248","AAI9210885"],"dc:language":["eng"],"dc:rights":["Copyright 1991 Lee, Daeshik"],"dc:subject":["Mathematics","Computer Science"],"dc:title":["Boundary method-based domain decomposition on multiprocessors"],"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:19Z"}