Sign inGet started
Paper · arXiv

RAPNet: Accelerating Algebraic Multigrid with Learned Sparse Corrections

The scalable solution of large sparse linear systems is a bottleneck in scientific computing and graph analysis. While algebraic multigrid (AMG) offers optimal linear scaling, its performance is severely constrained by the trade-off between the sparsity and convergence quality of coarse-grid operators. Classical AMG heuristics struggle to balance these objectives, often sacrificing stability or performance for sparsity. We propose RAPNet, a graph neural network (GNN) framework that resolves this trade-off by learning to generate sparse, robust coarse operators directly from the sparse algebraic system. Key to our approach is a level-wise training strategy that enables learning from small ...

AuthorsYali Fink, Ido Ben-Yair, Lars Ruthotto et al.
Primary categorycs.LG
Published26 May 2026
Last updated at source31 July 2026
cs.LG
Embed this entry
<iframe src="https://silytics.si/embed/item/d13a7e58-4631-4c54-9f40-17363577acfe" width="420" height="190" style="border:0" loading="lazy" title="Silytics entry"></iframe>

Free, no tracking. More about feeds and embeds.

Silytics shows public metadata from arXiv and links to the original. Information may be incomplete or out of date. Last refreshed 17 October 2026. Licenses and terms of the original apply to the work itself. Not financial, legal or professional advice.