The effect of graph partitioning techniques on parallel Block FSAI preconditioning: a computational study
Adaptive Block FSAI (ABF) is a novel preconditioner which has proved efficient for the parallel solution of symmetric positive definite (SPD) linear systems and eigenproblems. A possible drawback stems from its reduced strong scalability, as the iteration count to converge for a given problem tends...
Uloženo v:
| Vydáno v: | Numerical algorithms Ročník 68; číslo 4; s. 813 - 836 |
|---|---|
| Hlavní autoři: | , , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
Boston
Springer US
01.04.2015
Springer Nature B.V |
| Témata: | |
| ISSN: | 1017-1398, 1572-9265 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Shrnutí: | Adaptive Block FSAI (ABF) is a novel preconditioner which has proved efficient for the parallel solution of symmetric positive definite (SPD) linear systems and eigenproblems. A possible drawback stems from its reduced strong scalability, as the iteration count to converge for a given problem tends to grow with the number of processors used. The preliminary use of graph partitioning techniques can help improve the preconditioner quality and scalability. According to the specific theoretical properties of Block FSAI, different partitionings are selected and tested in a set of matrices arising from SPD engineering applications. The results show that using an appropriate graph partitioning technique with ABF may play an important role to increase the preconditioner efficiency and robustness, allowing for its effective use also in massively parallel simulations. |
|---|---|
| Bibliografie: | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 content type line 23 |
| ISSN: | 1017-1398 1572-9265 |
| DOI: | 10.1007/s11075-014-9873-5 |