Document Type

Article

Publication Date

10-1-2018

Abstract

We design and analyze V-cycle multigrid methods for an H(div) problem discretized by the lowest-order Raviart–Thomas hexahedral element. The smoothers in the multigrid methods involve nonoverlapping domain decomposition preconditioners that are based on substructuring. We prove uniform convergence of the V-cycle methods on bounded convex hexahedral domains (rectangular boxes). Numerical experiments that support the theory are also presented.

Publication Source (Journal or Book title)

Numerical Linear Algebra with Applications

Share

COinS