Parallel kinetic schemes for conservation laws, with large time steps (Q6123350)

From MaRDI portal
scientific article; zbMATH DE number 7812559
Language Label Description Also known as
English
Parallel kinetic schemes for conservation laws, with large time steps
scientific article; zbMATH DE number 7812559

    Statements

    Parallel kinetic schemes for conservation laws, with large time steps (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    4 March 2024
    0 references
    A new parallel discontinuous Galerkin (DG) method is formulated for the approximation of hyperbolic systems of conservation laws. The approach is based on a kinetic representation of the system of conservation laws previously investigated by the authors, which presents good parallelization features for shared memory computers. In this paper, a subdomain decomposition method is proposed to improve the parallel scaling on distributed memory computers. The subdomain decomposition introduces a stability condition associated with the size of the subdomains rather than being constrained by the size of the cells, which enables large gains compared to a traditional explicit scheme, as shown in validation tests on academic test cases and realistic electromagnetic simulations. It is stable with large time steps, and it does not require the assembly and resolution of large linear systems for the time iterations. This technique is particularly well-suited in cases where geometrical constraints locally impose very small cells, whereas the time step can be freely chosen to obtain a given accuracy, keeping the complexity of an explicit scheme.
    0 references
    discontinuous Galerkin
    0 references
    kinetic approximation
    0 references
    CFL-less
    0 references
    unconditional stability
    0 references
    parallelization
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references