Optimality of multilevel preconditioners for local mesh refinement in three dimensions

被引:17
作者
Aksoylu, Burak [1 ]
Holst, Michael
机构
[1] Louisiana State Univ, Dept Math, Baton Rouge, LA 70803 USA
[2] Louisiana State Univ, Ctr Computat & Technol, Baton Rouge, LA 70803 USA
[3] Univ Calif San Diego, Dept Math, La Jolla, CA 92093 USA
关键词
finite element approximation theory; multilevel preconditioning; BPX; hierarchical bases; wavelets; three dimensions; local mesh refinement; red-green refinement;
D O I
10.1137/S0036142902406119
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
In this article, we establish optimality of the Bramble - Pasciak - Xu (BPX) norm equivalence and optimality of the wavelet modified ( or stabilized) hierarchical basis (WHB) preconditioner in the setting of local 3D mesh refinement. In the analysis of WHB methods, a critical first step is to establish the optimality of BPX norm equivalence for the refinement procedures under consideration. While the available optimality results for the BPX norm have been constructed primarily in the setting of uniformly refined meshes, a notable exception is the local 2D red-green result due to Dahmen and Kunoth. The purpose of this article is to extend this original 2D optimality result to the local 3D red-green refinement procedure introduced by Bornemann, Erdmann, and Kornhuber, and then to use this result to extend the WHB optimality results from the quasi-uniform setting to local 2D and 3D red-green refinement scenarios. The BPX extension is reduced to establishing that locally enriched finite element subspaces allow for the construction of a scaled basis which is formally Riesz stable. This construction turns out to rest not only on the shape regularity of the refined elements, but also critically on a number of geometrical properties we establish between neighboring simplices produced by the Bornemann - Erdmann - Kornhuber (BEK) refinement procedure. It is possible to show that the number of degrees of freedom used for smoothing is bounded by a constant times the number of degrees of freedom introduced at that level of refinement, indicating that a practical, implementable version of the resulting BPX preconditioner for the BEK refinement setting has provably optimal ( linear) computational complexity per iteration. An interesting implication of the optimality of the WHB preconditioner is the a priori H-1-stability of the L-2-projection. The existing a posteriori approaches in the literature dictate a reconstruction of the mesh if such conditions cannot be satisfied. The theoretical framework employed supports arbitrary spatial dimension d >= 1 and requires no coefficient smoothness assumptions beyond those required for well-posedness in H-1.
引用
收藏
页码:1005 / 1025
页数:21
相关论文
共 39 条
[1]   Multilevel solvers for unstructured surface meshes [J].
Aksoylu, B ;
Khodakovsky, A ;
Schröder, P .
SIAM JOURNAL ON SCIENTIFIC COMPUTING, 2005, 26 (04) :1146-1165
[2]   An odyssey into local refinement and multilevel preconditioning III: Implementation and numerical experiments [J].
Aksoylu, B ;
Bond, S ;
Holst, M .
SIAM JOURNAL ON SCIENTIFIC COMPUTING, 2003, 25 (02) :478-498
[3]  
AKSOYLU B, 2005, 0504 ICES U TEX AUST
[4]  
AKSOYLU B, 2001, THESIS U CALIFORNIA
[5]  
AKSOYLU B, 2005, 0503 ICES U TEX AUST
[6]  
AKSOYLU M, 2004, 0450 ICES U TEX AUST
[7]  
[Anonymous], CNA159 U TEX AUST
[8]  
Bank R. E., 1996, Acta Numerica, V5, P1, DOI 10.1017/S0962492900002610
[9]   THE HIERARCHICAL BASIS MULTIGRID METHOD [J].
BANK, RE ;
DUPONT, TF ;
YSERENTANT, H .
NUMERISCHE MATHEMATIK, 1988, 52 (04) :427-458
[10]   Tetrahedral grid refinement [J].
Bey, J .
COMPUTING, 1995, 55 (04) :355-378