2000 character limit reached
A Parallel iterative Algorithm for primal-dual weak Galerkin Schemes
Published 1 Jul 2024 in math.NA and cs.NA | (2407.00907v1)
Abstract: This paper presents and analyzes a parallelizable iterative procedure based on domain decomposition for primal-dual weak Galerkin (PDWG) finite element methods applied to the Poisson equation. The existence and uniqueness of the PDWG solution are established. Optimal order of error estimates are derived in both a discrete norm and the $L2$ norm. The convergence analysis is conducted for domain decompositions into individual elements associated with the PDWG methods, which can be extended to larger subdomains without any difficulty.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.