arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1401.5522math.NAcs.NA
收藏

设计LU-QR混合求解器以提高性能和稳定性

Designing LU-QR hybrid solvers for performance and stability

Mathieu Faverge, Julien Herrmann, Julien Langou, Bradley Lowery, Yves Robert, Jack Dongarra

摘要:

本文介绍求解Ax = b的稠密线性系的混合LU-QR算法。在整个矩阵分解过程中,这些算法根据一些鲁棒性标准动态地交替LU与局部旋转和QR消除步骤。LU消除步骤可以非常有效地并行化,并且在浮点运算方面是QR步骤的两倍便宜。然而,LU步长不一定稳定,而QR步长总是稳定的。当鲁棒性标准检测到某些不稳定风险时,混合算法执行QR步骤,否则执行LU步骤。理想情况下,LU和QR步骤之间的选择必须有一个小的计算开销,必须提供一个令人满意的稳定性水平与尽可能少的QR步骤。在本文中,我们引入了几个鲁棒性准则,我们建立上界的增长因子的更新矩阵的范数的增长因子的这些标准。此外,我们描述了通过扩展的PaRSEC软件,以允许在执行过程中的动态选择的混合算法的实现。最后,我们分析了稳定性和性能结果相比,最先进的线性求解器的并行分布式多核平台。

英文摘要:

This paper introduces hybrid LU-QR al- gorithms for solving dense linear systems of the form Ax = b. Throughout a matrix factorization, these al- gorithms dynamically alternate LU with local pivoting and QR elimination steps, based upon some robustness criterion. LU elimination steps can be very efficiently parallelized, and are twice as cheap in terms of floating- point operations, as QR steps. However, LU steps are not necessarily stable, while QR steps are always stable. The hybrid algorithms execute a QR step when a robustness criterion detects some risk for instability, and they execute an LU step otherwise. Ideally, the choice between LU and QR steps must have a small computational overhead and must provide a satisfactory level of stability with as few QR steps as possible. In this paper, we introduce several robustness criteria and we establish upper bounds on the growth factor of the norm of the updated matrix incurred by each of these criteria. In addition, we describe the implementation of the hybrid algorithms through an exten- sion of the PaRSEC software to allow for dynamic choices during execution. Finally, we analyze both stability and performance results compared to state-of-the-art linear solvers on parallel distributed multicore platforms.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑