A novel algorithm and its parallelization for solving nearly penta-diagonal linear systems

作者：Jia Ji Teng^*; Sogabe Tomohiro

来源：International Journal of Computer Mathematics, 2013, 90(2): 435-444.

DOI：10.1080/00207160.2012.725845

• nearly penta-diagonal matrices
• parallel algorithm
• linear systems
• Crout LU decomposition
• computer algebra systems
• 15A09
• 15A23
• 65F30
• 33F10

In the current paper, a new serial algorithm for solving nearly penta-diagonal linear systems is presented. The computational cost of the algorithm is less than or almost equal to those of recent successful algorithms [J. Jia, Q. Kong, and T. Sogabe, A fast numerical algorithm for solving nearly penta-diagonal linear systems, Int. J. Comput. Math. 89 (2012), pp. 851860; X.G. Lv and J. Le, A note on solving nearly penta-diagonal linear systems, Appl. Math. Comput. 204 (2008), pp. 707712; S.N. Neossi Nguetchue and S. Abelman, A computational algorithm for solving nearly penta-diagonal linear systems, Appl. Math. Comput. 203 (2008), pp. 629634]. Moreover, it is suitable for developing its parallel algorithms. One of the parallel algorithms is given and is shown to be promising. The implementation of the algorithms using Computer Algebra Systems such as MATLAB and MAPLE is straightforward. Two numerical examples are given in order to illustrate the validity and efficiency of our algorithms.

• 出版日期2013-2-1
• 单位西安交通大学