基于MRRR的多核处理器和超级计算机特征解算器
MRRR-based Eigensolvers for Multi-core Processors and Supercomputers
摘要:
实对称三对角特征值问题在数值计算中非常重要;它经常作为标准和广义稠密厄米特特征值问题的特征值求解器的一部分出现,这些特征值问题基于三对角形式的简化。对于它的解决方案,多个相对鲁棒表示(MRRR或MR 3)算法-在20世纪90年代后期推出-是最快的方法之一。为了计算一个实n × n三对角T的k个特征对,MRRR只需要O(kn)的算术运算;相比之下,所有其他实用方法在最坏情况下都需要O(k^2 n)或O(n^3)的运算。本文围绕MRRR的性能和准确性展开研究。
英文摘要:
The real symmetric tridiagonal eigenproblem is of outstanding importance in numerical computations; it arises frequently as part of eigensolvers for standard and generalized dense Hermitian eigenproblems that are based on a reduction to tridiagonal form. For its solution, the algorithm of Multiple Relatively Robust Representations (MRRR or MR3 in short) - introduced in the late 1990s - is among the fastest methods. To compute k eigenpairs of a real n-by-n tridiagonal T, MRRR only requires O(kn) arithmetic operations; in contrast, all the other practical methods require O(k^2 n) or O(n^3) operations in the worst case. This thesis centers around the performance and accuracy of MRRR.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。