Skip to main content
Log in

The analysis of multigrid algorithms for cell centered finite difference methods

  • Published:
Advances in Computational Mathematics Aims and scope Submit manuscript

Abstract

In this paper, we examine multigrid algorithms for cell centered finite difference approximations of second order elliptic boundary value problems. The cell centered application gives rise to one of the simplest non-variational multigrid algorithms. We shall provide an analysis which guarantees that the W-cycle and variable V-cycle multigrid algorithms converge with a rate of iterative convergence which can be bounded independently of the number of multilevel spaces. In contrast, the natural variational multigrid algorithm converges much more slowly.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. R.E. Bank and T. Dupont, An optimal order process for solving finite element equations, Math. Comp. 36 (1981) 35–51.

    Google Scholar 

  2. D. Braess and W. Hackbusch, A new convergence proof for the multigrid method including the V-cycle, SIAM J. Numer. Anal. 20 (1983) 967–975.

    Article  Google Scholar 

  3. J.H. Bramble and J.E. Pasciak, The analysis of smoothers for multigrid algorithms, Math. Comp. 58 (1992) 467–488.

    Google Scholar 

  4. J.H. Bramble and J.E. Pasciak, New estimates for multigrid algorithms including the V-cycle, Math. Comp. 60 (1993) 447–471.

    Google Scholar 

  5. R.E. Ewing, R.D. Lazarov and P.S. Vassilevski, Local refinement techniques for elliptic problems on cell-centered grids, I. Error analysis, Math. Comp. 56 (1991) 437–461.

    Google Scholar 

  6. J.H. Bramble, J.E. Pasciak, J. Wang and J. Xu, Convergence estimates for multigrid algorithms without regularity assumptions, Math. Comp. 57 (1991) 23–45.

    Google Scholar 

  7. J.H. Bramble, J.E. Pasciak and J. Xu, The analysis of multigrid algorithms with non-nested spaces or non-inherited quadratic forms, Math. Comp. 56 (1991) 1–34.

    Google Scholar 

  8. A. Brandt, Multi-level adaptive solutions to boundary-valued problems, Math. Comp. 31 (1977) 333–390.

    Google Scholar 

  9. R.E. Ewing and J. Shen, A multigrid algorithm for the cell-centered finite difference scheme,Proceedings of the Sixth Copper Mountain Conference on Multigrid Methods, NASA Conference Publication 3224 (1993).

  10. R.P. Fedorenko, The speed of convergence of one iterative process, USSR Comp. Math. and Math. Phys. (1961) 1092–1096.

  11. W. Hackbusch,Multi-Grid Methods and Applications (Springer, New York, 1985).

    Google Scholar 

  12. T.F. Russell and M.F. Wheeler, Finite element and finite difference methods for continuous flows in porous media, in:The Mathematics of Reservoir Simulation, ed. R. E. Ewing (SIAM, 1983) pp. 35–106.

  13. J. Xu, Iterative methods by space decomposition and subspace correction, SIAM Review 34 (19xx) 581–613.

  14. X. Zhang, Multi-level additive Schwarz methods, Courant Inst. Math. Sci., Dept. Comp. Sci. Rep. (August, 1991).

Download references

Author information

Authors and Affiliations

Authors

Additional information

Communicated by J.C. Mason

Rights and permissions

Reprints and permissions

About this article

Cite this article

Bramble, J.H., Ewing, R.E., Pasciak, J.E. et al. The analysis of multigrid algorithms for cell centered finite difference methods. Adv Comput Math 5, 15–29 (1996). https://doi.org/10.1007/BF02124733

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02124733

AMS subject classification

Navigation