稀疏对称不定系统的压缩阈值主元
Compressed threshold pivoting for sparse symmetric indefinite systems
摘要:
在稀疏直接求解器中,控制数值稳定性的一个关键技术是阈值部分主元。选择透视表时,对角线下方的整个候选透视表列必须是最新的,并且必须进行扫描。如果因子分解在大量核上并行化,则通信延迟可能是主要的计算成本。在本文中,我们提出了两种替代的旋转战略稀疏对称不定矩阵,显着减少通信压缩到一个小的矩阵,可用于选择枢轴所需的数据。一旦选择了枢轴,它们就可以以有效的通信方式应用。对于P处理器上的n × p子矩阵,我们表明我们的方法使用O(log P)消息而不是O(p log P)进行阈值部分旋转的因式分解。业务和通信带宽方面的额外费用相对较小。一个稳定性证明和数值结果,使用一系列的对称不定矩阵所产生的实际问题,以证明实际的鲁棒性。大型随机示例的时序结果说明了当前多核机器上的潜在加速。
英文摘要:
A key technique for controlling numerical stability in sparse direct solvers is threshold partial pivoting. When selecting a pivot, the entire candidate pivot column below the diagonal must be up-to-date and must be scanned. If the factorization is parallelized across a large number of cores, communication latencies can be the dominant computational cost. In this paper, we propose two alternative pivoting strategies for sparse symmetric indefinite matrices that significantly reduce communication by compressing the necessary data into a small matrix that can be used to select pivots. Once pivots have been chosen, they can be applied in a communication-efficient fashion. For an n x p submatrix on P processors, we show our methods perform a factorization using O(log P) messages instead of the O(p log P) for threshold partial pivoting. The additional costs in terms of operations and communication bandwidth are relatively small. A stability proof is given and numerical results using a range of symmetric indefinite matrices arising from practical problems are used to demonstrate the practical robustness. Timing results on large random examples illustrate the potential speedup on current multicore machines.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。