An analysis of domain decomposition methods using deal.II
dc.contributor.author | Rigsby, Christina, author | |
dc.contributor.author | Tavener, Simon, advisor | |
dc.contributor.author | Bangerth, Wolfgang, committee member | |
dc.contributor.author | Heyliger, Paul, committee member | |
dc.contributor.author | Liu, Jiangguo, committee member | |
dc.date.accessioned | 2022-01-07T11:29:00Z | |
dc.date.available | 2022-01-07T11:29:00Z | |
dc.date.issued | 2021 | |
dc.description.abstract | Iterative solvers have attracted significant attention since the mid-20th century as the computational problems of interest have grown to a size beyond which direct methods are viable. Projection methods, and the two classical iterative schemes, Jacobi and Gauss-Seidel, provide a framework in which many other methods may be understood. Parallel methods or Jacobi-like methods are particularly attractive as Moore's Law and computer architectures transition towards multiple cores on a chip. We implement and explore two such methods, the multiplicative and restricted additive Schwarz algorithms for overlapping domain decomposition. We implement these in deal.II software, which is written in C++ and uses the finite element method. Finally, we point out areas for potential improvement in the implementation and present a possible extension of this work to an agent-based modeling prototype currently being developed by the Air Force Research Laboratory's Autonomy Capability Team (ACT3). | |
dc.format.medium | born digital | |
dc.format.medium | masters theses | |
dc.identifier | Rigsby_colostate_0053N_16939.pdf | |
dc.identifier.uri | https://hdl.handle.net/10217/234190 | |
dc.language | English | |
dc.language.iso | eng | |
dc.publisher | Colorado State University. Libraries | |
dc.relation.ispartof | 2020- | |
dc.rights | Copyright and other restrictions may apply. User is responsible for compliance with all applicable laws. For information about copyright law, please see https://libguides.colostate.edu/copyright. | |
dc.subject | domain decomposition | |
dc.subject | computational problems | |
dc.subject | projection methods | |
dc.subject | parallel methods | |
dc.subject | computer architectures | |
dc.subject | multiple cores on a chip | |
dc.title | An analysis of domain decomposition methods using deal.II | |
dc.type | Text | |
dcterms.rights.dpla | This Item is protected by copyright and/or related rights (https://rightsstatements.org/vocab/InC/1.0/). You are free to use this Item in any way that is permitted by the copyright and related rights legislation that applies to your use. For other uses you need to obtain permission from the rights-holder(s). | |
thesis.degree.discipline | Mathematics | |
thesis.degree.grantor | Colorado State University | |
thesis.degree.level | Masters | |
thesis.degree.name | Master of Science (M.S.) |
Files
Original bundle
1 - 1 of 1
Loading...
- Name:
- Rigsby_colostate_0053N_16939.pdf
- Size:
- 1.41 MB
- Format:
- Adobe Portable Document Format