科研之友
微信
新浪微博
Facebook
分享链接
摘要
Let C-n be a (k + 1)-diagonal complex circulant matrix of order n(>= k + 1), and let det C-n be the determinant of C-n. An algorithm for computing det C-n is presented with the cost of O(klog(2)k . log(2)n + k(4)) multiplication, and an asymptotic formula for det C-n is obtained. Moreover, a result on symmetric circulant matrices with integer entries is also given. Using Mathematica in a personal computer, we give some numerical examples, which illustrate that the algorithm is very efficient and the asymptotic formula is accurate enough when the order n of the circulant matrix is sufficiently large.
- 出版日期2014-2-25
- 单位闽南师范大学
