Abstract
In this paper, we describe a way of obtaining a domain decomposition method for efficiently solving the linear system which arises from the discretization of symmetric elliptic problems using the finite difference approximation. The resulting linear system is solved iteratively by using the conjugate gradient method together with the capacitance matrix method. The algorithm is designed to be implemented on a parallel computer and to reach high parallelization rates together with nearly optimal speed-ups, i.e., close to the number of processors.
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.
