| dc.creator |
D’Ambra, Pasqua |
|
| dc.creator |
Filippone, Salvatore |
|
| dc.creator |
Vassilevski, Panayot S. |
|
| dc.date |
2018-07-16T14:19:44Z |
|
| dc.date |
2018-07-16T14:19:44Z |
|
| dc.date |
2018-07-14 |
|
| dc.date.accessioned |
2022-05-25T16:37:10Z |
|
| dc.date.available |
2022-05-25T16:37:10Z |
|
| dc.identifier |
D'Ambra P, Filippone S, Vassilevski P. (2018) BootCMatch: a software package for bootstrap AMG based on graph weighted matching. ACM Transactions on Mathematical Software, Volume 44, Issue 4, July 2018, Article number 39 |
|
| dc.identifier |
0098-3500 |
|
| dc.identifier |
http://dx.doi.org/10.1145/3190647 |
|
| dc.identifier |
http://dspace.lib.cranfield.ac.uk/handle/1826/13344 |
|
| dc.identifier |
19748203 |
|
| dc.identifier.uri |
http://localhost:8080/xmlui/handle/CUHPOERS/182202 |
|
| dc.description |
This article has two main objectives: one is to describe some extensions of an adaptive Algebraic Multigrid (AMG) method of the form previously proposed by the first and third authors, and a second one is to present a new software framework, named BootCMatch, which implements all the components needed to build and apply the described adaptive AMG both as a stand-alone solver and as a preconditioner in a Krylov method. The adaptive AMG presented is meant to handle general symmetric and positive definite (SPD) sparse linear systems, without assuming any a priori information of the problem and its origin; the goal of adaptivity is to achieve a method with a prescribed convergence rate. The presented method exploits a general coarsening process based on aggregation of unknowns, obtained by a maximum weight matching in the adjacency graph of the system matrix. More specifically, a maximum product matching is employed to define an effective smoother subspace (complementary to the coarse space), a process referred to as compatible relaxation, at every level of the recursive two-level hierarchical AMG process.
Results on a large variety of test cases and comparisons with related work demonstrate the reliability and efficiency of the method and of the software. |
|
| dc.language |
en |
|
| dc.publisher |
Association for Computing Machinery (ACM) |
|
| dc.rights |
Attribution 4.0 International |
|
| dc.rights |
http://creativecommons.org/licenses/by/4.0/ |
|
| dc.subject |
Mathematics of computing |
|
| dc.subject |
Solvers |
|
| dc.subject |
Algebraic multigrid |
|
| dc.subject |
Preconditioner |
|
| dc.subject |
Iterative solver |
|
| dc.subject |
Graph matching |
|
| dc.title |
BootCMatch: A software package for bootstrap AMG based on graph weighted matching |
|
| dc.type |
Article |
|