V-cycle multigrid for cell-centered finite differences

Cited 13 time in webofscience Cited 0 time in scopus
  • Hit : 344
  • Download : 0
We introduce and analyze a V-cycle multigrid algorithm for cell-centered finite difference methods applied to second-order elliptic boundary value problems. Unlike conventional cell-centered multigrid algorithms that use the natural injection operator for prolongation, we use a new prolongation operator whose energy norm we prove is bounded by 1 in the constant coefficient case and 1+Ch in the nonconstant case. We are thus able to use general finite element multigrid theory to conclude that the V-cycle either converges well or serves as a reasonably good preconditioner, respectively. While our theory does not establish optimal performance, our numerical experiments do show that the resulting algorithm converges much faster than the conventional schemes. In fact, these results show that the energy norm convergence factor is small and remains bounded uniformly in the finest mesh size, while that of the conventional algorithm grows.
Publisher
SIAM PUBLICATIONS
Issue Date
1999-10
Language
English
Article Type
Article
Keywords

INTERFACE PROBLEMS; ALGORITHMS; EQUATIONS; GRIDS

Citation

SIAM JOURNAL ON SCIENTIFIC COMPUTING, v.21, no.2, pp.552 - 564

ISSN
1064-8275
URI
http://hdl.handle.net/10203/74273
Appears in Collection
MA-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 13 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0