The analysis of multigrid algorithms for cell centered finite difference methods (Q1914574): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: An Optimal Order Process for Solving Finite Element Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Convergence Proof for the Multigrid Method Including the <i>V</i>-Cycle / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Analysis of Smoothers for Multigrid Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Estimates for Multilevel Algorithms Including the V-Cycle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local Refinement Techniques for Elliptic Problems on Cell-Centered Grids I. Error Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence Estimates for Multigrid Algorithms without Regularity Assumptions / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Analysis of Multigrid Algorithms with Nonnested Spaces or Noninherited Quadratic Forms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-Level Adaptive Solutions to Boundary-Value Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3727300 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iterative Methods by Space Decomposition and Subspace Correction / rank
 
Normal rank

Latest revision as of 12:47, 24 May 2024

scientific article
Language Label Description Also known as
English
The analysis of multigrid algorithms for cell centered finite difference methods
scientific article

    Statements

    The analysis of multigrid algorithms for cell centered finite difference methods (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    23 June 1996
    0 references
    A multigrid algorithm for cell centered finite difference approximations is examined. The cell centered discretization gives rise to a non-variational multigrid algorithm. It is shown that the \(W\)-cycle and variable \(V\)-cycle converge with a rate which is independent of the number of multilevel spaces. In contrast, the natural variational multigrid method converges much more slowly.
    0 references
    convergence
    0 references
    multigrid algorithm
    0 references
    cell centered finite difference approximations
    0 references
    \(W\)-cycle
    0 references
    \(V\)-cycle
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references