Uniform convergence of multigrid V-cycle on adaptively refined finite element meshes for second order elliptic problems

In this paper we prove the uniform convergence of the standard multigrid V-cycle algorithm with the Gauss-Seidel relaxation performed only on the new nodes and their 'immediate' neighbors for discrete elliptic problems on the adaptively refined finite element meshes using the newest vertex...

Full description

Saved in:

Bibliographic Details
Published in:	Science in China. Series A, Mathematics, physics, astronomy Vol. 49; no. 10; pp. 1405 - 1429
Main Authors:	Wu, Haijun, Chen, Zhiming
Format:	Journal Article
Language:	English
Published:	Department of Mathematics, Nanjing University, Nanjing 210093, China%Institute of Computational Mathematics, Chinese Academy of Sciences, Beijing 100080, China 01.10.2006
Subjects:	Scott-Zhang interpolation adaptive finite element meshes local relaxation Multigrid V-cycle algorithm
ISSN:	1006-9283, 1862-2763
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Description
Summary:	In this paper we prove the uniform convergence of the standard multigrid V-cycle algorithm with the Gauss-Seidel relaxation performed only on the new nodes and their 'immediate' neighbors for discrete elliptic problems on the adaptively refined finite element meshes using the newest vertex bisection algorithm. The proof depends on sharp estimates on the relationship of local mesh sizes and a new stability estimate for the space decomposition based on the Scott-Zhang interpolation operator. Extensive numerical results are reported, which confirm the theoretical analysis.
Bibliography:	ObjectType-Article-2 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 23
ISSN:	1006-9283 1862-2763
DOI:	10.1007/s11425-006-2005-5