Multigrid algorithms for a vertex-centered covolume method for elliptic problems

Cited 17 time in webofscience Cited 0 time in scopus
  • Hit : 221
  • Download : 0
We analyze V-cycle multigrid algorithms for a class of perturbed problems whose perturbation in the bilinear form preserves the convergence properties of the multigrid algorithm of the original problem. As an application, we study the convergence of multigrid algorithms for a covolume method or a vertex-centered finite volume element method for variable coefficient elliptic problems on polygonal domains. As in standard finite element methods, the V-cycle algorithm with one pre-smoothing converges with a rate independent of the number of levels. Various types of smoothers including point or line Jacobi, and Gauss-Seidel relaxation are considered.
Publisher
SPRINGER-VERLAG
Issue Date
2002-01
Language
English
Article Type
Article
Keywords

GENERALIZED STOKES PROBLEM; V-CYCLE; FINITE-DIFFERENCE; CONVERGENCE; EQUATIONS

Citation

NUMERISCHE MATHEMATIK, v.90, no.3, pp.441 - 458

ISSN
0029-599X
URI
http://hdl.handle.net/10203/83660
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 17 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0