NASA Logo

NTRS

NTRS - NASA Technical Reports Server

Back to Results
A Cell-Centered Multigrid Algorithm for All Grid SizesMultigrid methods are optimal; that is, their rate of convergence is independent of the number of grid points, because they use a nested sequence of coarse grids to represent different scales of the solution. This nesting does, however, usually lead to certain restrictions of the permissible size of the discretised problem. In cases where the modeler is free to specify the whole problem, such constraints are of little importance because they can be taken into consideration from the outset. We consider the situation in which there are other competing constraints on the resolution. These restrictions may stem from the physical problem (e.g., if the discretised operator contains experimental data measured on a fixed grid) or from the need to avoid limitations set by the hardware. In this paper we discuss a modification to the cell-centered multigrid algorithm, so that it can be used br problems with any resolution. We discuss in particular a coarsening strategy and choice of intergrid transfer operators that can handle grids with both an even or odd number of cells. The method is described and applied to linear equations obtained by discretization of two- and three-dimensional second-order elliptic PDEs.
Document ID
19970006881
Acquisition Source
Langley Research Center
Document Type
Conference Paper
Authors
Gjesdal, Thor
(Christian Michelsen Research A/S Fantoft, Norway)
Date Acquired
August 17, 2013
Publication Date
September 1, 1996
Publication Information
Publication: Seventh Copper Mountain Conference on Multigrid Methods
Issue: Part 1
Subject Category
Computer Programming And Software
Accession Number
97N13774
Funding Number(s)
CONTRACT_GRANT: NRCW-100556/410
Distribution Limits
Public
Copyright
Work of the US Gov. Public Use Permitted.
Document Inquiry

Available Downloads

There are no available downloads for this record.
No Preview Available