Numerical algorithms for the determinants of opposite-bordered and singly-bordered tridiagonal matrices

Abstract

A recursive algorithm for the determinant evaluation of general opposite-bordered tridiagonal matrices has been proposed by Jia et al. (J Comput Appl Math 290:423–432, 2015). Since the algorithm is a symbolic algorithm, it never suffers from breakdown. However, it may be time-consuming when many symbolic names emerge during the symbolic computation. In this paper, without using symbolic computation, first we present a novel breakdown-free numerical algorithm for computing the determinant of an n-by-n opposite-bordered tridiagonal matrix, which does not require any extra memory storage for the implementation. Then, we present a cost-efficient algorithm for the determinants of opposite-bordered tridiagonal matrices based on the use of the combination of an elementary column operation and Sylvester’s determinant identity. Furthermore, we provide some numerical results with simulations in Matlab implementation in order to demonstrate the accuracy and efficiency of the proposed algorithms, and their competitiveness with other existing algorithms. The corresponding results in this paper can be readily obtained for computing the determinants of singly-bordered tridiagonal matrices.