A novel algorithm for solving quasi penta-diagonal linear systems

作者：Jia Ji Teng^*; Sogabe Tomohiro

来源：Journal of Mathematical Chemistry, 2013, 51(3): 881-889.

DOI：10.1007/s10910-012-0122-7

• Quasi penta-diagonal matrices
• LU factorization
• Linear systems
• Inverse
• Computer Algebra Systems (CASs)

In this paper, a novel numerical algorithm for solving quasi penta-diagonal linear systems is presented. The computational costs of the algorithm is less than those of three successful algorithms given by El-Mikkawy and Rahmo (Comput Math Appl 59:1386-1396, 2010), by Lv and Le (Appl Math Comput 204:707-712, 2008), and by Jia et al. (Int J Comput Math 89:851-860, 2012). In addition, a new recursive method for inverting the quasi penta-diagonal matrices is also discussed. The implementation of the algorithm using Computer Algebra Systems (CASs) such as MATLAB and MAPLE is straightforward. Two numerical examples are given in order to demonstrate the performance and efficiency of our algorithm.

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