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

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3323187 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Optimal Order Process for Solving Finite Element Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: The contraction number of a multigrid method for solving the Poisson equation / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Iterative Method for Elliptic Problems on Regions Partitioned into Substructures / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Construction of Preconditioners for Elliptic Problems by Substructuring. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3727300 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3909906 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4742262 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for refining triangular grids suitable for adaptive and multigrid techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence properties of the symmetric and unsymmetric successive overrelaxation methods and related methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the multi-level splitting of finite element spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hierarchical bases give conjugate gradient type methods a multigrid speed of convergence / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Multi-Level Splitting of Finite Element Spaces for Indefinite Elliptic Boundary Value Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hierarchical bases of finite-element spaces in the discretization of nonsymmetric elliptic boundary value problems / rank
 
Normal rank

Latest revision as of 16:27, 18 June 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