关键词：移动数据；并行通讯；并行矩阵
摘 要：In this work, we derive a new parallel communication-avoiding matrix powers algorithm for matrices of the form A = D+USV H, where D is sparse and USV H has low rank but may be dense. Matrices of this form arise in many practical applications, including power-law graph analysis, circuit simulation, and algorithms involving hierarchical (H) matrices, such as multigrid methods, fast multipole methods, numerical partial di erential equation solvers, and preconditioned iterative methods.