Towards robustness in algorithms: accelerated domain decomposition, multisecant equations, and simplicial intersections
ContributorsMccoid, Conor Joseph
DirectorsGander, Martin Jakob
Number of pages135
Imprimatur date2022-08-30
Defense date2022-08-30
Abstract
Keywords
- Domain decomposition
- Newton's method
- Krylov subspace methods
- Extrapolation methods
- Intersection algorithms
- Parsimony
- Robustness
Affiliation
Citation (ISO format)
MCCOID, Conor Joseph. Towards robustness in algorithms: accelerated domain decomposition, multisecant equations, and simplicial intersections. 2022. doi: 10.13097/archive-ouverte/unige:164515
Main files (1)
Thesis
Secondary files (1)
Identifiers
- PID : unige:164515
- DOI : 10.13097/archive-ouverte/unige:164515
- URN : urn:nbn:ch:unige-1645151
- Thesis number : Sc. 5681