UNIFORM-CONVERGENCE OF MULTIGRID V-CYCLE ITERATIONS FOR INDEFINITE AND NONSYMMETRIC PROBLEMS

Cited 56 time in webofscience Cited 0 time in scopus
  • Hit : 234
  • Download : 0
In this paper, an analysis of a multigrid method for nonsymmetric and/or indefinite elliptic problems is presented. In this multigrid method various types of smoothers may be used. One type of smoother considered is defined in terms of an associated symmetric problem and includes point and line, Jacobi, and Gauss-Seidel iterations. Smoothers based entirely on the original operator are also considered. One smoother is based on the normal form, that is, the product of the operator and its transpose. Other smoothers studied include point and line, Jacobi, and Gauss-Seidel. It is shown that the uniform estimates of [J.H. Bramble and J. E. Pasciak, Math. Comp., 60 (1993), pp. 447-471] for symmetric positive definite problems carry over to these algorithms. More precisely, the multigrid iteration for the nonsymmetric and/or indefinite problem is shown to converge at a uniform rate provided that the coarsest grid in the multilevel iteration is sufficiently fine (but not dependent on the number of multigrid levels).
Publisher
SIAM PUBLICATIONS
Issue Date
1994-12
Language
English
Article Type
Article
Keywords

ELLIPTIC PROBLEMS; ALGORITHMS

Citation

SIAM JOURNAL ON NUMERICAL ANALYSIS, v.31, no.6, pp.1746 - 1763

ISSN
0036-1429
URI
http://hdl.handle.net/10203/65978
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 56 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0