Algebraic block red-black ordering method for parallelized ICCG solver with fast convergence and low communication costs
Algebraic block red-black ordering method for parallelized ICCG solver with fast convergence and low communication costs
复制标题
具有快速收敛和低通信成本的并行ICCG求解器的代数块红黑排序方法
DOI：
10.1109/tmag.2003.810531
复制
发表时间：
2003
影响因子：
2.1
通讯作者：
M. Shimasaki
中科院分区：
文献类型：
--
作者：
T. Iwashita;M. Shimasaki
提出了一种适用于小规模多处理机系统的并行不完全Cholesky共轭梯度(ICCG)算法。新方法基于一种新的重排技术，即块红黑排序法。在有限边元涡流分析中对其并行性能进行了评估。数值测试表明，该方法收敛速度快，通信开销小，在少量处理器上是有效的。
Proposes a new parallelized incomplete Cholesky conjugate gradient (ICCG) solver effective on a small-scale multiprocessor system. The new method is based on a new reordering technique, namely the block red-black ordering method. Its parallel performance is evaluated in a finite edge-element eddy-current analysis. A numerical test shows that the proposed method is effective on a small number of processors due to fast convergence and low communication costs.