A BDDC algorithm for the Stokes problem with weak Galerkin discretizations. (15th July 2018)

• Record Type: Journal Article
• Authors: Tu, Xuemin; Wang, Bin
• Is Part Of: Computers & mathematics with applications. Volume 76:issue 2(2018)
• Page Start: 377
• Page End: 392
• Publication Date: 2018-07-15
• Subjects: Discontinuous Galerkin -- Weak Galerkin -- Domain decomposition -- BDDC -- Stokes -- Saddle point problems; Electronic data processing -- Periodicals; Mathematics -- Data processing -- Periodicals; 510.28541
• DOI: 10.1016/j.camwa.2018.04.024
• Languages: English
• ISSNs: 0898-1221

Abstract

Abstract: The BDDC (balancing domain decomposition by constraints) methods have been applied successfully to solve the large sparse linear algebraic systems arising from conforming finite element discretizations of second order elliptic and Stokes problems. In this paper, the Stokes equations are discretized using the weak Galerkin method, a newly developed nonconforming finite element method. A BDDC algorithm is designed to solve the linear system such obtained. Edge/face velocity interface average and mean subdomain pressure are selected for the coarse problem. The condition number bounds of the BDDC preconditioned operator are analyzed, and the same rate of convergence is obtained as for conforming finite element methods. Numerical experiments are conducted to verify the theoretical results.