A novel algorithm for solving quasi penta-diagonal linear systems

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...

Full description

Saved in:
Bibliographic Details
Published in:Journal of mathematical chemistry 2013-03, Vol.51 (3), p.881-889
Main Authors: Jia, Ji-Teng, Sogabe, Tomohiro
Format: Article
Language:English
Subjects:
Chemistry
Chemistry and Materials Science
Math. Applications in Chemistry
Original Paper
Physical Chemistry
Theoretical and Computational Chemistry
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:0259-9791
1572-8897
DOI:10.1007/s10910-012-0122-7