Local Multilevel Method on Adaptively Refined Meshes for Elliptic Problems with Smooth Complex Coefficients
Year: 2015
Numerical Mathematics: Theory, Methods and Applications, Vol. 8 (2015), Iss. 3 : pp. 336–355
Abstract
In this paper, a local multilevel algorithm is investigated for solving linear systems arising from adaptive finite element approximations of second order elliptic problems with smooth complex coefficients. It is shown that the abstract theory for local multilevel algorithm can also be applied to elliptic problems whose dominant coefficient is complex valued. Assuming that the coarsest mesh size is sufficiently small, we prove that this algorithm with Gauss-Seidel smoother is convergent and optimal on the adaptively refined meshes generated by the newest vertex bisection algorithm. Numerical experiments are reported to confirm the theoretical analysis.
You do not have full access to this article.
Already a Subscriber? Sign in as an individual or via your institution
Journal Article Details
Publisher Name: Global Science Press
Language: English
DOI: https://doi.org/10.4208/nmtma.2015.m1323
Numerical Mathematics: Theory, Methods and Applications, Vol. 8 (2015), Iss. 3 : pp. 336–355
Published online: 2015-01
AMS Subject Headings:
Copyright: COPYRIGHT: © Global Science Press
Pages: 20