Multilevel Gauss-Seidel-algorithms for full and sparse grid problems (Q2366295)

From MaRDI portal
Revision as of 06:52, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
scientific article
Language Label Description Also known as
English
Multilevel Gauss-Seidel-algorithms for full and sparse grid problems
scientific article

    Statements

    Multilevel Gauss-Seidel-algorithms for full and sparse grid problems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    29 June 1993
    0 references
    Grid-oriented and recently developed point-oriented robust multilevel methods for full and sparse grid discretizations are presented. The suitable properties for parallelization and anisotropic model problems are demonstrated. The techniques can easily be generalized to domain- oriented multilevel methods.
    0 references
    Gauss-Seidel-algorithms
    0 references
    anisotropic problems
    0 references
    block-Gauss-Seidel iteration
    0 references
    hiearchical basis
    0 references
    multigrid methods
    0 references
    point-oriented methods
    0 references
    semidefinite system
    0 references
    sparse grids
    0 references
    parallelization
    0 references
    domain-oriented multilevel methods
    0 references

    Identifiers

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