Jiteng Jia, Tomohiro Sogabe, Sumei Li
In the current paper, we present a generalized symbolic Thomas algorithm, that never suffers from breakdown, for solving the opposite-bordered tridiagonal (OBT) linear systems. The algorithm uses a fill-in matrix factorization and can solve an OBT linear system in O(n)O(n) operations. Meanwhile, an efficient method of evaluating the determinant of an opposite-bordered tridiagonal matrix is derived. The computational costs of the proposed algorithms are also discussed. Moreover, three numerical examples are provided in order to demonstrate the performance and effectiveness of our algorithms and their competitiveness with some already existing algorithms. All of the experiments are performed on a computer with the aid of programs written in Matlab.
© 2008-2024 Fundación Dialnet · Todos los derechos reservados