The hierarchical basis multigrid method (Q1103353): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Added link to MaRDI item.
links / mardi / namelinks / mardi / name
 

Revision as of 01:49, 31 January 2024

scientific article
Language Label Description Also known as
English
The hierarchical basis multigrid method
scientific article

    Statements

    The hierarchical basis multigrid method (English)
    0 references
    0 references
    0 references
    0 references
    1988
    0 references
    Based on earlier work of the third author and the PLTMG package of the first author, the authors describe, analyze and implement the mentioned method for the numerical solution of a standard self-adjoint twodimensional elliptic problem as a symmetric block Gauß-Seidel method with inner iterations (which can be rewritten in V-cycle manner). For the discretization, linear triangular elements are employed. The point is here that the triangulation may be generated (refined) adaptively: The described multigrid method does not assume that the numbers of unknowns on the different refinement levels grow geometrically to assure a work estimate per iteration of the overall unknown number since on any level only the new points are iterated. The analysis also does not require the usual strong ellipticity condition. The price for these advantages is that the number of iterations depends on the number of levels.
    0 references
    hierarchical basis multigrid method
    0 references
    finite elements
    0 references
    condition number
    0 references
    mesh refinement
    0 references
    symmetric block Gauß-Seidel method
    0 references
    inner iterations
    0 references
    V-cycle
    0 references
    linear triangular elements
    0 references

    Identifiers

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