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

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	IEEE transactions on parallel and distributed systems Ročník 30; číslo 11; s. 2507 - 2522
Hlavní autoři:	Cools, Siegfried, Cornelis, Jeffrey, Vanroose, Wim
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York IEEE 01.11.2019 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!