V-cycle Galerkin-multigrid methods for nonconforming methods for nonsymmetric and indefinite problems

Cited 2 time in webofscience Cited 0 time in scopus
  • Hit : 394
  • Download : 0
In this paper we analyze a class of V-cycle multigrid methods for discretizations of second-order nonsymmetric and/or indefinite elliptic problems using nonconforming Pt and rotated el finite elements. These multigrid methods are based on the so-called Galerkin approach where the quadratic forms over coarse grids are constructed from the quadratic form on the finest grid and iterated coarse-to-fine grid operators. The analysis shows that these V-cycle multigrid iterations with one smoothing on each level converge at a uniform rate provided that the coarsest level in the multilevel iterations is sufficiently fine (but independent of the number of multigrid levels). Various types of smoothers for the nonsymmetric and indefinite problems are considered and analyzed. The theory presented here also applies to mixed finite element methods for the nonsymmetric and indefinite problems. (C) 1998 Elsevier Science B.V. and IMACS. All rights reserved.
Publisher
ELSEVIER SCIENCE BV
Issue Date
1998-09
Language
English
Article Type
Article
Keywords

FINITE-ELEMENT METHODS; 2ND-ORDER ELLIPTIC PROBLEMS; MIXED METHODS; IMPLEMENTATION; ALGORITHMS; EQUATIONS

Citation

APPLIED NUMERICAL MATHEMATICS, v.28, no.1, pp.17 - 35

ISSN
0168-9274
URI
http://hdl.handle.net/10203/67806
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 2 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0