Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
6420856 | Applied Mathematics and Computation | 2014 | 5 Pages |
Abstract
k-Tridiagonal matrices have attracted much attention in recent years, which are a generalization of tridiagonal matrices. In this note, a breakdown-free numerical algorithm of O(n) is presented for computing the determinants and the permanents of k-tridiagonal matrices. Even though the algorithm is not a symbolic algorithm, it never suffers from breakdown. Furthermore, it produces exact values when all entries of the k-tridiagonal matrices are given in integer. In addition, the algorithm can be simplified for a general symmetric Toeplitz case, and it generates the kth powers of Fibonacci, Pell, and Jacobsthal numbers for a certain symmetric Toeplitz case.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Applied Mathematics
Authors
Tomohiro Sogabe, Fatih Yılmaz,