线性系统的容忍掉队者定常方法
Straggler-tolerant stationary methods for linear systems
AI总结:
本文研究了部分计算矩阵向量积条件下的线性方程组迭代求解,提出了容忍掉队者的Richardson和Chebyshev半迭代方案,并证明了期望收敛的充分条件,数值实验验证了其有效性。
摘要:
本文考虑在系数矩阵的矩阵向量积仅部分计算的条件下,线性代数方程组的迭代求解。同时,未计算的项被置为零。我们假设计算项的数量及其关联的行索引集均为随机变量,且在给定计算项数量的情况下,行索引集均匀采样。该计算模型在受掉队者影响的控制器-工作者分布式混合云计算架构中实现。我们提出了容忍掉队者的Richardson迭代方案和Chebyshev半迭代方案,并证明了其期望收敛的充分条件。数值实验验证了所提出的理论结果及方案在若干稀疏矩阵问题上的有效性。
英文摘要:
In this paper, we consider the iterative solution of linear algebraic equations under the condition that matrix-vector products with the coefficient matrix are computed only partially. At the same time, non-computed entries are set to zeros. We assume that both the number of computed entries and their associated row index set are random variables, with the row index set sampled uniformly given the number of computed entries. This model of computations is realized in hybrid cloud computing architectures following the controller-worker distributed model under the influence of straggling workers. We propose straggler-tolerant Richardson iteration scheme and Chebyshev semi-iterative schemes, and prove sufficient conditions for their convergence in expectation. Numerical experiments verify the presented theoretical results as well as the effectiveness of the proposed schemes on a few sparse matrix problems.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。