Location of Repository

The Analysis Of Multigrid Algorithms For Cell Centered Finite Difference Methods

By James H. Bramble, Richard E. Ewing, Joseph E. Pasciak and Jian Shen

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. 1. Introduction. In recent years, it has become increasingly obvious that iterative methods provide the only feasible technique for solving the large systems of algebraic equations which arise from large scale scientific simulations modeled by partial differential equations. Multigrid methods often represent the most efficient strategy for iteratively solving these systems. For this reason, the multigrid method has been subject to inten..

Year: 1994
OAI identifier: oai:CiteSeerX.psu:10.1.1.32.9802
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.isc.tamu.edu/~ewing... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.