Abstract
The work presented in this paper focuses on parallel iterative method for solving block-tridiagonal linear systems. Being based on Galerkin theory predetermining W m = V m , and forming a suitable matrix V m , a parallel iterative method on distributed-memory multi-computer is established. Then Eq. (3.1)–(3.3) are provided for carrying out computation required by our parallel algorithm. Furthermore, convergence is proved when the coefficient matrix A is a symmetric positive definite matrix, and the sufficient condition is given. In the end, two illustrative examples implemented on HP rx2600 cluster show that our algorithm’s parallel acceleration rates and efficiency are higher.
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.
