首页 | 本学科首页   官方微博 | 高级检索  
     


Finite element methods for the Stokes problem on complicated domains
Authors:Daniel Peterseim  Stefan A. Sauter
Affiliation:1. School of Mathematics and Statistics, University of Sydney, New South Wales 2006, Australian;2. Department of Bioengineering, Imperial College, London SW7 2AZ, Englandn;1. Institut für Informatik, Universität Kiel, 24098 Kiel, Germany;2. Mathematisches Seminar, Universität Kiel, 24098 Kiel, Germany;3. Department of Computer Science, Brock University, St. Catharines, ON, Canada;1. Mines ParisTech, PSL - Research University, Centre for Mathematical Morphology, 35 rue Saint-Honoré, FONTAINEBLEAU F-77300, France;2. Mines ParisTech, PSL - Research University, Centre for Materials, 63-65 Rue Henri Auguste Desbruères, CORBEIL-ESSONNES F-91100, France
Abstract:It is a standard assumption in the error analysis of finite element methods that the underlying finite element mesh has to resolve the physical domain of the modeled process. In case of complicated domains which appear in many applications such as ground water flows this requirement sometimes becomes a bottleneck. The resolution condition links the computational complexity to the number (and size) of geometric details although the accuracy requirements, possibly, are moderate and would allow a (locally) coarse mesh width. Therefore even the coarsest available discretization can lead to a huge number of unknowns. The composite mini element is a remedy to this dilemma because the degrees of freedom are not linked to the number of geometric details. The basic concept for the Stokes problem with uniform no-slip boundary conditions has been introduced and analyzed in [D. Peterseim, S. Sauter, The composite mini element – coarse mesh computation of Stokes flows on complicated domains, SINUM, 46(6) (2008) 3181–3206]. Here, we generalize the composite mini element to slip, leak and Neumann boundary conditions so that it becomes applicable to this much larger and more important problem class. The main results are (a) the algorithmic concept remains unchanged and the new boundary conditions can be implemented as a weighted quadrature rule, (b) the stability and convergence can be proved under very mild assumption on the domain geometries, (c) the analysis is far from trivial and requires the development of substantially new tools compared to the simple case of uniform no-slip boundary conditions.
Keywords:
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号