Numerically Stable Recurrence Relations for the Communication Hiding Pipelined Conjugate Gradient Method

Pipelined Krylov subspace methods (also referred to as communication-hiding methods) have been proposed in the literature as a scalable alternative to classic Krylov subspace algorithms for iteratively computing the solution to a large linear system in parallel. For symmetric and positive definite s...

Full description

Saved in:

Bibliographic Details
Published in:	IEEE transactions on parallel and distributed systems Vol. 30; no. 11; pp. 2507 - 2522
Main Authors:	Cools, Siegfried, Cornelis, Jeffrey, Vanroose, Wim
Format:	Journal Article
Language:	English
Published:	New York IEEE 01.11.2019 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:	Algorithms attainable accuracy Communication Conjugate gradient method conjugate gradients Conjugates Distributed memory Distributed processing Global communication Gradient methods Hardware inexact computations Krylov subspace methods latency hiding Mathematical analysis Matrix algebra Matrix methods Methods Numerical stability parallel performance Pipeline processing pipelining Pipelining (computers) Rounding Stability Subspace methods Subspaces Symmetric matrices
ISSN:	1045-9219, 1558-2183
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!