A hybrid probabilistic domain decomposition algorithm suited for very large-scale elliptic PDEs
State of the art domain decomposition algorithms for large-scale boundary value problems (with \(M\gg 1\) degrees of freedom) suffer from bounded strong scalability because they involve the synchronisation and communication of workers inherent to iterative linear algebra. Here, we introduce PDDSpars...
Saved in:
Published in | arXiv.org |
---|---|
Main Authors | , , |
Format | Paper Journal Article |
Language | English |
Published |
Ithaca
Cornell University Library, arXiv.org
13.01.2023
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Be the first to leave a comment!