.png){kind=icon}
返回
A two-level GPU-accelerated incomplete LU preconditioner for general sparse linear systems
.png){kind=icon}
PRE
AI
DOI：10.1177/10943420251319334.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper presents a parallel preconditioning approach based on incomplete LU (ILU) factorizations in the framework of Domain Decomposition (DD) for general sparse linear systems. We focus on distributed memory parallel architectures, specifically, those that are equipped with graphic processing units (GPUs). In addition to block-Jacobi, we present general purpose two-level ILU Schur complement-based approaches, where different strategies are presented to solve the coarse-level reduced system. These strategies are combined with modified ILU methods in the construction of the coarse-level operator, in order to effectively remove smooth errors by targeting an algebraically smooth vector. We leverage available GPU-based sparse matrix kernels to accelerate the setup and the solve phases of the proposed ILU preconditioner. We evaluate the efficiency of the proposed methods as a smoother for algebraic multigrid (AMG) and as a preconditioner for Krylov subspace methods on challenging anisotropic diffusion problems and a collection of general sparse matrices.
Keyword:
GPU computing
preconditioning
ILU factorization
multilevel methods
AMG
期刊
IF:
2.5
论文数:
1.1K
被引数:
1.3K
机构
引用论文
.png){kind=icon}
分享收藏
查看更多内容