Abstract
AbstractThe FETI-DP (Finite Element Tearing and Interconnecting - Dual Primal) method has recently successfully been applied to virtual element discretizations, adding more flexibility to the resolution of possibly complicated underlying domain geometries. However, for second-order partial differential equations with large discontinuities in the coefficient functions, in general, the convergence rate of domain decomposition methods is known to deteriorate if the coarse space is not properly adjusted. For finite element discretizations, this problem can be solved by using adaptive coarse spaces, which guarantee a robust method for arbitrary coefficient distributions, or by the computationally much cheaper frugal coarse space, which numerically proved to be robust for many realistic coefficient distributions. In this article, both, the adaptive and the frugal FETI-DP methods are applied to discretizations obtained by using virtual elements. As model problems, stationary diffusion and compressible linear elasticity in two spatial dimensions are considered. The performance of the methods is numerically tested, varying the quasi-uniformity of the underlying meshes, the polynomial degree, the scaling method, and considering regular and irregular domain decompositions. It is shown that adaptive and frugal FETI-DP for virtual elements behave similarly as in the finite element case.
Funder
Deutsche Forschungsgemeinschaft
Universität zu Köln
Publisher
Springer Science and Business Media LLC
Reference44 articles.
1. Ahmad, B., Alsaedi, A., Brezzi, F., Marini, L.D., Russo, A.: Equivalent projectors for virtual element methods. Comput. Math. Appl. 66, 376–391 (2013)
2. Antonietti, P.F., Beirão da Veiga, L., Mora, D., Verani, M.: A stream virtual element formulation of the Stokes problem on polygonal meshes. SIAM J. Numer. Anal. 52, 386–404 (2014)
3. Antonietti, P.F., Beirão da Veiga, L., Scacchi, S., Verani, M.: A C1 virtual element method for the Cahn–Hilliard equation with polygonal meshes. SIAM J. Numer. Anal. 54, 34–56 (2016)
4. Bauman, B., Sommariva, A, Vianello, M.: Polygauss, fast algebraic cubature over polygons. https://www.math.unipd.it/~alvise/software.html, www.math.unipd.it/~alvise/SOFTWARE_2019/POLYGONS_2019/POLYGONS2019.zip. Accessed 13 Mar 2021 (2019)
5. Bauman, B., Sommariva, A., Vianello, M.: Compressed algebraic cubature over polygons with applications to optical design. J. Comput. Appl. Math. 370, 112658 (2020)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献