ATTENTION: The software behind KU ScholarWorks is being upgraded to a new version. Starting July 15th, users will not be able to log in to the system, add items, nor make any changes until the new version is in place at the end of July. Searching for articles and opening files will continue to work while the system is being updated.
If you have any questions, please contact Marianne Reed at mreed@ku.edu .
Balancing domain decomposition by constraints algorithms for incompressible Stokes equations with nonconforming finite element discretizations
dc.contributor.advisor | Tu, Xuemin | |
dc.contributor.author | Wang, Bin | |
dc.date.accessioned | 2018-10-24T22:12:11Z | |
dc.date.available | 2018-10-24T22:12:11Z | |
dc.date.issued | 2017-12-31 | |
dc.date.submitted | 2017 | |
dc.identifier.other | http://dissertations.umi.com/ku:15598 | |
dc.identifier.uri | http://hdl.handle.net/1808/27005 | |
dc.description.abstract | Hybridizable Discontinuous Galerkin (HDG) is an important family of methods, which combine the advantages of both Discontinuous Galerkin in terms of flexibility and standard finite elements in terms of accuracy and efficiency. The impact of this method is partly evidenced by the prolificacy of research work in this area. Weak Galerkin (WG) is a relatively newly proposed method by introducing weak functions and generalizing the differential operator for them. This method has also drawn remarkable interests from both numerical practitioners and analysts recently. HDG and WG are different but closely related. BDDC algorithms are developed for numerical solution of elliptic problems with both methods. We prove that the optimal condition number estimate for BDDC operators with standard finite element methods can be extended to the counterparts arising from the HDG and WG methods, which are nonconforming finite element methods. Numerical experiments are conducted to verify the theoretical analysis. Further, we propose BDDC algorithms for the saddle point system arising from the Stokes equations using both HDG and WG methods. By design of the preconditioner, the iterations are restricted to a benign subspace, which makes the BDDC operator effectively positive definite thus solvable by the conjugate gradient method. We prove that the algorithm is scalable in the number of subdomains with convergence rate only dependent on subdomain problem size. The condition number bound for the BDDC preconditioned Stokes system is the same as the optimal bound for the elliptic case. Numerical results confirm the theoretical analysis. | |
dc.format.extent | 155 pages | |
dc.language.iso | en | |
dc.publisher | University of Kansas | |
dc.rights | Copyright held by the author. | |
dc.subject | Mathematics | |
dc.subject | BDDC | |
dc.subject | domain decomposition | |
dc.subject | hybridizable discontinuous Galerkin | |
dc.subject | saddle point problems | |
dc.subject | Stokes | |
dc.subject | weak Galerkin | |
dc.title | Balancing domain decomposition by constraints algorithms for incompressible Stokes equations with nonconforming finite element discretizations | |
dc.type | Dissertation | |
dc.contributor.cmtemember | Huang, Weizhang | |
dc.contributor.cmtemember | Van Vleck, Erik | |
dc.contributor.cmtemember | Xu, Hongguo | |
dc.contributor.cmtemember | Wang, Z.J. | |
dc.thesis.degreeDiscipline | Mathematics | |
dc.thesis.degreeLevel | Ph.D. | |
dc.identifier.orcid | ||
dc.rights.accessrights | openAccess |
Files in this item
This item appears in the following Collection(s)
-
Dissertations [4889]
-
Mathematics Dissertations and Theses [179]