Počet záznamů: 1
Parallel Solution Methods and Preconditioners for Evolution Equations
- 1.
SYSNO ASEP 0495421 Druh ASEP J - Článek v odborném periodiku Zařazení RIV J - Článek v odborném periodiku Poddruh J Článek ve WOS Název Parallel Solution Methods and Preconditioners for Evolution Equations Tvůrce(i) Axelsson, Owe (UGN-S) RID
Neytcheva, M. (SE)
Liang, Z. Z. (CN)Celkový počet autorů 3 Zdroj.dok. Mathematical Modeling and Analysis. - : Taylor & Francis - ISSN 1392-6292
Roč. 23, č. 2 (2018), s. 287-308Poč.str. 22 s. Forma vydání Online - E Jazyk dok. eng - angličtina Země vyd. LT - Litva Klíč. slova parallel solution ; evolution equation ; preconditioning ; PDE-constrained optimization Vědní obor RIV BA - Obecná matematika Obor OECD Applied mathematics CEP LD15105 GA MŠMT - Ministerstvo školství, mládeže a tělovýchovy LQ1602 GA MŠMT - Ministerstvo školství, mládeže a tělovýchovy Institucionální podpora UGN-S - RVO:68145535 UT WOS 000439208500008 EID SCOPUS 85046994578 DOI 10.3846/mma.2018.018 Anotace The recent development of the high performance computer platforms shows a clear trend towards heterogeneity and hierarchy. In order to utilize the computational power, particular attention must be paid to finding new algorithms or adjust existing ones so that they better match the HPC computer architecture. In this work we consider an alternative to classical time-stepping methods based on use of time-harmonic properties and discuss solution approaches that allow efficient utilization of modern HPC resources. The method in focus is based on a truncated Fourier expansion of the solution of an evolutionary problem. The analysis is done for linear equations and it is remarked on the possibility to use two- or multilevel mesh methods for nonlinear problems, which can enable further, even higher degree of parallelization.
The arising block matrix system to be solved admits a two-by-two block form with square blocks, for which a very efficient preconditioner exists. It leads to tight eigenvalue bounds for the preconditioned matrix and, hence, to a very fast convergence of a preconditioned Krylov subspace or iterative refinement method. The analytical background is shown as well as some illustrating numerical examples.Pracoviště Ústav geoniky Kontakt Lucie Gurková, lucie.gurkova@ugn.cas.cz, Tel.: 596 979 354 Rok sběru 2019 Elektronická adresa https://www.mla.vgtu.lt/index.php/MMA/article/view/1424/1134
Počet záznamů: 1