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

一种允许低复杂度多线程实现的线性系统协同共轭梯度法

A cooperative conjugate gradient method for linear systems permitting multithread implementation of low complexity

Federal University of Rio de Janeiro(里约热内卢联邦大学);Inria(法国国家信息与自动化研究所)

Amit Bhaya, Pierre-Alexandre Bliman, Guilherme Niedu, Fernando Pazos

AI总结:

提出协同共轭梯度法(cCG),通过将标量控制参数替换为矩阵实现多下降和共轭方向同时更新,并证明多线程实现的最坏情况复杂度为O(n^{2+1/3})。

摘要:

本文提出了共轭梯度(CG)方法的一种推广,用于求解对称正定矩阵$A$(大规模$n$)的方程$Ax=b$。该推广允许将标量控制参数(即梯度方向和共轭梯度方向上的步长)替换为矩阵,从而同时更新多个下降方向和共轭方向。实现涉及多个代理或线程的使用,称为协同CG (cCG),其中代理之间的合作在于控制参数矩阵的每个条目的计算现在涉及来自其他代理的信息。对于足够大的维度$n$,使用最优数量的核心使得多线程实现在精确算术下的最坏情况复杂度为$O(n^{2+1/3})$。在多核计算机上进行了数值实验,说明了理论结果的意义。

英文摘要:

This paper proposes a generalization of the conjugate gradient (CG) method used to solve the equation $Ax=b$ for a symmetric positive definite matrix $A$ of large size $n$. The generalization consists of permitting the scalar control parameters (= stepsizes in gradient and conjugate gradient directions) to be replaced by matrices, so that multiple descent and conjugate directions are updated simultaneously. Implementation involves the use of multiple agents or threads and is referred to as cooperative CG (cCG), in which the cooperation between agents resides in the fact that the calculation of each entry of the control parameter matrix now involves information that comes from the other agents. For a sufficiently large dimension $n$, the use of an optimal number of cores gives the result that the multithread implementation has worst case complexity $O(n^{2+1/3})$ in exact arithmetic. Numerical experiments, that illustrate the interest of theoretical results, are carried out on a multicore computer.

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

↑