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

DOI10.1109/CDC.2012.6426341arXiv1204.0069MaRDI QIDQ6232000FDOQ6232000

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

Publication date: 30 March 2012

Abstract: 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.

Mathematics Subject Classification ID

Acceleration of convergence in numerical analysis (65Bxx)

This page was built for publication: A cooperative conjugate gradient method for linear systems permitting multithread implementation of low complexity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6232000)