Actions for Uniform convergence of multigrid V-cycle iterations for indefinite and nonsymmetric problems

Email RIS file
Bookmark
Report an Issue

Uniform convergence of multigrid V-cycle iterations for indefinite and nonsymmetric problems

Author
Pasciak, Joseph E.
Published
Nov 1, 1993.
Physical Description
1 electronic document
Additional Creators
Kwak, Do Y. and Bramble, James H.
Online Version

Availability

I Want It
I Want It

Finding items...

Restrictions on Access
Unclassified, Unlimited, Publicly available.
Free-to-read Unrestricted online access
Summary
In this paper, we present an analysis of a multigrid method for nonsymmetric and/or indefinite elliptic problems. In this multigrid method various types of smoothers may be used. One type of smoother which we consider is defined in terms of an associated symmetric problem and includes point and line, Jacobi, and Gauss-Seidel iterations. We also study smoothers based entirely on the original operator. One 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. We show that the uniform estimates 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 depending on the number of multigrid levels).
Other Subject(s)
Collection
NASA Technical Reports Server (NTRS) Collection.
Note
Document ID: 19940019204.
Accession ID: 94N23677.
NASA. Langley Research Center, The Sixth Copper Mountain Conference on Multigrid Methods, Part 1; p 43-59.
Terms of Use and Reproduction
No Copyright.
View MARC record | catkey: 15660728