Parallel algorithms for successive convolution (Q2221135)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Parallel algorithms for successive convolution |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Parallel algorithms for successive convolution |
scientific article |
Statements
Parallel algorithms for successive convolution (English)
0 references
26 January 2021
0 references
The authors of the work under review, propose hybrid parallel algorithms that can handle a wide class of linear as well as nonlinear partial differential equations. In order to enable parallel simulations on distributed systems, a set of conditions that use available wave speed, either in conjunction with, or without diffusivity information, together with the size of the sub-domains (to limit the communication through an adjustment of the time step), is derived. In this frame work, boundary conditions are enforced across sub-domains in the decomposition. Results presented for two-dimensional examples consisting of linear advection, linear diffusion, and a nonlinear Hamilton-Jacobi equation, exhibit the adaptability of the methods in addressing qualitatively different partial differential equations.
0 references
high-performance computing
0 references
domain decomposition
0 references
method-of-lines-transpose
0 references
integral solution
0 references
fast algorithms
0 references
numerical analysis
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.7084029912948608
0 references
0.6970023512840271
0 references
0.6944606304168701
0 references
0.6917650699615479
0 references
0.6916268467903137
0 references