Abstract
According to the parallel algorithms for solving tridiagonal linear systems, we studied the parallel algorithms for solving penta-diagonal linear systems. In the parallel solutions for tridiagonal linear systems—cyclic reduction method (CR), recursive doubling method (RD) and the partition method (PD), however, only the cyclic reduction algorithm can be used to solve the penta-diagonal linear systems. Compared with the serial algorithm of solving penta-diagonal linear systems—Gaussion elimination, cyclic reduction algorithm has obvious advantages. In this paper, we evaluated these methods by their execution time. According to the measured datas, the cyclic reduction algorithm has been implemented via multi-threads. The efficiency of Cyclic reduction algorithm is more efficient than the Gaussion algorithm by 23.74%.
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.
