Convergence estimates for multigrid algorithms (Q1376695): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
RedirectionBot (talk | contribs)
Removed claim: reviewed by (P1447): Item:Q167873
Property / reviewed by
 
Property / reviewed by: Zdeněk Dostál / rank
Normal rank
 

Revision as of 01:00, 10 February 2024

scientific article
Language Label Description Also known as
English
Convergence estimates for multigrid algorithms
scientific article

    Statements

    Convergence estimates for multigrid algorithms (English)
    0 references
    0 references
    1 June 1998
    0 references
    The rate of convergence of multigrid algorithms is known to depend on assumptions concerning the smoothing process. The authors give a condition on smoothing that grants the optimal convergence of the multigrid method and is weaker than that considered by \textit{J. H. Bramble} and \textit{J. E. Pasciak} [Math. Comput. 58, No. 198, 467-488 (1992; Zbl 0771.65082)]. The new condition is shown to be satisfied also by the Kaczmarz smoother, unlike the conditions analyzed by Bramble and Pasciak [loc. cit.]. The importance of the new results is illustrated by numerical experiments.
    0 references
    convergence
    0 references
    multigrid algorithms
    0 references
    smoothing
    0 references
    numerical experiments
    0 references

    Identifiers

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