All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Parallel Solution Methods and Preconditioners for Evolution Equations

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68145535%3A_____%2F18%3A00495421" target="_blank" >RIV/68145535:_____/18:00495421 - isvavai.cz</a>

  • Result on the web

    <a href="https://www.mla.vgtu.lt/index.php/MMA/article/view/1424/1134" target="_blank" >https://www.mla.vgtu.lt/index.php/MMA/article/view/1424/1134</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.3846/mma.2018.018" target="_blank" >10.3846/mma.2018.018</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Parallel Solution Methods and Preconditioners for Evolution Equations

  • Original language description

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

  • Czech name

  • Czech description

Classification

  • Type

    J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database

  • CEP classification

  • OECD FORD branch

    10102 - Applied mathematics

Result continuities

  • Project

    Result was created during the realization of more than one project. More information in the Projects tab.

  • Continuities

    P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Others

  • Publication year

    2018

  • Confidentiality

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

Data specific for result type

  • Name of the periodical

    Mathematical Modeling and Analysis

  • ISSN

    1392-6292

  • e-ISSN

  • Volume of the periodical

    23

  • Issue of the periodical within the volume

    2

  • Country of publishing house

    LT - LITHUANIA

  • Number of pages

    22

  • Pages from-to

    287-308

  • UT code for WoS article

    000439208500008

  • EID of the result in the Scopus database

    2-s2.0-85046994578