Analysis and computation of a least-squares method for consistent mesh tying

被引:8
|
作者
Day, David [1 ]
Bochev, Pavel [1 ]
机构
[1] Sandia Natl Labs, Albuquerque, NM 87185 USA
关键词
finite elements; mesh tying; least-squares; first-order elliptic systems;
D O I
10.1016/j.cam.2007.04.049
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
In the finite element method, a standard approach to mesh tying is to apply Lagrange multipliers. If the interface is curved, however, discretization generally leads to adjoining surfaces that do not coincide spatially. Straightforward Lagrange multiplier methods lead to discrete formulations failing a first-order patch test [T.A. Laursen, M.W Heinstein, Consistent mesh-tying methods for topologically distinct discretized surfaces in non-linear solid mechanics, Internat. J. Nhumer. Methods Eng. 57 (2003) 1197-1242]. This paper presents a theoretical and computational study of a least-squares method for mesh tying [P. Bochev, D.M. Day, A least-squares method for consistent mesh tying, Internal. J. Numer. Anal. Modeling 4 (2007) 342-352], applied to the partial differential equation del(2)phi + alpha phi = f. We prove optimal convergence rates for domains represented as overlapping subdomains and show that the least-squares method passes a patch test of the order of the finite element space by construction. To apply the method to subdomain configurations with gaps and overlaps we use interface perturbations to eliminate the gaps. Theoretical error estimates are illustrated by numerical experiments. (C) 2007 Elsevier B.V. All rights reserved.
引用
收藏
页码:21 / 33
页数:13
相关论文
共 50 条