矩阵计算的I/O有效算法
I/O Efficient Algorithms for Matrix Computations
摘要:
分析了QR分解算法,证明了基于瓦片的QR分解算法的I/O复杂度与矩阵乘法的I/O复杂度是渐近相同的。这种算法,我们表明,执行最好的瓷砖大小时,选择,使正好一个瓷砖适合在主内存中。我们提出了一个常数因子的改进,以及一个新的递归缓存遗忘算法具有相同的渐近I/O复杂度。我们设计Hessenberg,三对角,双对角减少,使用带状中间形式,并只执行渐近最佳数量的I/O,这些是第一个I/O优化算法,这些问题。特别是,我们发现,已知的板为基础的算法,双方减少都有次优渐近I/O性能,即使他们已被报道做得比传统算法的经验证据的基础上。我们提出了新的基于瓦片的多移位QR和QZ算法的变种,在一定条件下的移位数,有更好的寻求和I/O复杂性比所有已知的变种。我们表明,重新安排的计算步骤,适当选择的阻塞参数,并将更多的矩阵矩阵运算的技术,可以用来提高I/O和寻求矩阵计算的复杂性。
英文摘要:
We analyse some QR decomposition algorithms, and show that the I/O complexity of the tile based algorithm is asymptotically the same as that of matrix multiplication. This algorithm, we show, performs the best when the tile size is chosen so that exactly one tile fits in the main memory. We propose a constant factor improvement, as well as a new recursive cache oblivious algorithm with the same asymptotic I/O complexity. We design Hessenberg, tridiagonal, and bidiagonal reductions that use banded intermediate forms, and perform only asymptotically optimal numbers of I/Os; these are the first I/O optimal algorithms for these problems. In particular, we show that known slab based algorithms for two sided reductions all have suboptimal asymptotic I/O performances, even though they have been reported to do better than the traditional algorithms on the basis of empirical evidence. We propose new tile based variants of multishift QR and QZ algorithms that under certain conditions on the number of shifts, have better seek and I/O complexities than all known variants. We show that techniques like rescheduling of computational steps, appropriate choosing of the blocking parameters and incorporating of more matrix-matrix operations, can be used to improve the I/O and seek complexities of matrix computations.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。