Abstract
In this article, two kinds of expandable parallel finite element methods, based on two-grid discretizations, are given to solve the linear elliptic problems. Compared with the classical local and parallel finite element methods, there are two attractive features of the methods shown in this article: 1) a partition of unity is used to generate a series of local and independent subproblems to guarantee the final approximation globally continuous; 2) the computational domain of each local subproblem is contained in a ball with radius of O(H) (H is the coarse mesh parameter), which means methods in this article are more suitable for parallel computing in a large parallel computer system. Some a priori error estimation are obtained and optimal error bounds in both H1-normal and L2-normal are derived. Finally, numerical results are reported to test and verify the feasibility and validity of our methods.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
