The numerical stability analysis of pipelined conjugate gradient methods: historical context and methodology

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985840%3A_____%2F18%3A00495023" target="_blank" >RIV/67985840:_____/18:00495023 - isvavai.cz</a>

Nalezeny alternativní kódy

RIV/00216208:11320/18:10384838

Výsledek na webu

<a href="http://dx.doi.org/10.1137/16M1103361" target="_blank" >http://dx.doi.org/10.1137/16M1103361</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1137/16M1103361" target="_blank" >10.1137/16M1103361</a>

Jazyk výsledku

angličtina

Název v původním jazyce

The numerical stability analysis of pipelined conjugate gradient methods: historical context and methodology

Popis výsledku v původním jazyce

Algebraic solvers based on preconditioned Krylov subspace methods are among the most powerful tools for large-scale numerical computations in applied mathematics, sciences, technology, as well as in emerging applications in social sciences. As the name suggests, Krylov subspace methods can be viewed as a sequence of projections onto nested subspaces of increasing dimension. They are therefore by their nature implemented as synchronized recurrences. This is the fundamental obstacle to efficient parallel implementation. Standard approaches to overcoming this obstacle described in the literature involve reducing the number of global synchronization points and increasing parallelism in performing arithmetic operations within individual iterations. One such approach, employed by the so-called pipelined Krylov subspace methods, involves overlapping the global communication needed for computing inner products with local arithmetic computations.

Název v anglickém jazyce

The numerical stability analysis of pipelined conjugate gradient methods: historical context and methodology

Popis výsledku anglicky

Algebraic solvers based on preconditioned Krylov subspace methods are among the most powerful tools for large-scale numerical computations in applied mathematics, sciences, technology, as well as in emerging applications in social sciences. As the name suggests, Krylov subspace methods can be viewed as a sequence of projections onto nested subspaces of increasing dimension. They are therefore by their nature implemented as synchronized recurrences. This is the fundamental obstacle to efficient parallel implementation. Standard approaches to overcoming this obstacle described in the literature involve reducing the number of global synchronization points and increasing parallelism in performing arithmetic operations within individual iterations. One such approach, employed by the so-called pipelined Krylov subspace methods, involves overlapping the global communication needed for computing inner products with local arithmetic computations.

Druh

J_imp - Článek v periodiku v databázi Web of Science

CEP obor

—

OECD FORD obor

10101 - Pure mathematics

Projekt

Výsledek vznikl pri realizaci vícero projektů. Více informací v záložce Projekty.

Návaznosti

I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Rok uplatnění

2018

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název periodika

SIAM Journal on Scientific Computing

ISSN

1064-8275

e-ISSN

—

Svazek periodika

40

Číslo periodika v rámci svazku

5

Stát vydavatele periodika

US - Spojené státy americké

Počet stran výsledku

32

Strana od-do

"A3549"-"A3580"

Kód UT WoS článku

000448803100029

EID výsledku v databázi Scopus

2-s2.0-85056122511