Robustness of the additive and multiplicative frequency decomposition multi-level method (Q1893150)

From MaRDI portal
Revision as of 05:08, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
scientific article
Language Label Description Also known as
English
Robustness of the additive and multiplicative frequency decomposition multi-level method
scientific article

    Statements

    Robustness of the additive and multiplicative frequency decomposition multi-level method (English)
    0 references
    0 references
    13 November 1995
    0 references
    A multiplicative variant of the frequency decomposition multi-level method (FDMLM) developed earlier by W. Hackbusch is studied. The abstract finite element spaces and their subspaces decomposition that underlies the FDMLM are defined. The additive and multiplicative FDMLM are described as subspace correction methods. Robustness of both the methods applied to second-order symmetric singular perturbation problems is proven. Results of numerical experiments for a two-dimensional anisotropic equation and the Helmholtz equation are presented. They show that the additive FDMLM is superior to standard BPX for these problems. The BPX (Bramble-Pasciak-Xu) preconditioner is a parallel subspace correction method corresponding to the overlapping decomposition with one Jacobi iteration as a smoother.
    0 references
    multigrid method
    0 references
    domain decomposition
    0 references
    hierarchical basis
    0 references
    Bramble- Pasciak-Xu preconditioner
    0 references
    Jacobi iteration
    0 references
    frequency decomposition multi-level method
    0 references
    finite element
    0 references
    subspace correction methods
    0 references
    singular perturbation
    0 references
    numerical experiments
    0 references
    anisotropic equation
    0 references
    Helmholtz equation
    0 references
    0 references

    Identifiers

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