Zobrazeno 1 - 10
of 455
pro vyhledávání: '"Gander, Martin J."'
The Parareal algorithm was invented in 2001 in order to parallelize the solution of evolution problems in the time direction. It is based on parallel fine time propagators called F and sequential coarse time propagators called G, which alternatingly
Externí odkaz:
http://arxiv.org/abs/2409.02673
When considered as a standalone iterative solver for elliptic boundary value problems, the Dirichlet-Neumann (DN) method is known to converge geometrically for domain decompositions into strips, even for a large number of subdomains. However, wheneve
Externí odkaz:
http://arxiv.org/abs/2307.09204
Autor:
Gander, Martin J., Palitta, Davide
Time-parallel time integration has received a lot of attention in the high performance computing community over the past two decades. Indeed, it has been shown that parallel-in-time techniques have the potential to remedy one of the main computationa
Externí odkaz:
http://arxiv.org/abs/2304.12597
We investigate three directions to further improve the highly efficient Space-Time Multigrid algorithm with block-Jacobi smoother introduced in [GanNeu16]. First, we derive an analytical expression for the optimal smoothing parameter in the case of a
Externí odkaz:
http://arxiv.org/abs/2302.13881
In this work, we focus on the Neumann-Neumann method (NNM), which is one of the most popular non-overlapping domain decomposition methods. Even though the NNM is widely used and proves itself very efficient when applied to discrete problems in practi
Externí odkaz:
http://arxiv.org/abs/2302.13802
Autor:
Gander, Martin J., Zhang, Hui
Publikováno v:
published in Acta Numerica 2022, pp.1-134
Schwarz methods use a decomposition of the computational domain into subdomains and need to put boundary conditions on the subdomain boundaries. In domain truncation one restricts the unbounded domain to a bounded computational domain and also needs
Externí odkaz:
http://arxiv.org/abs/2207.09791
Optimized transmission conditions in domain decomposition methods have been the focus of intensive research efforts over the past decade. Traditionally, transmission conditions are optimized for two subdomain model configurations, and then used in pr
Externí odkaz:
http://arxiv.org/abs/2204.09754
In this work, the Parareal algorithm is applied to evolution problems that admit good low-rank approximations and for which the dynamical low-rank approximation (DLRA) can be used as time stepper. Many discrete integrators for DLRA have recently been
Externí odkaz:
http://arxiv.org/abs/2203.08455
Autor:
McCoid, Conor, Gander, Martin J.
Publikováno v:
In Linear Algebra and Its Applications 15 July 2024 693:83-97
Autor:
Gander, Martin J., Outrata, Michal
Publikováno v:
In Linear Algebra and Its Applications 15 July 2024 693:214-235