拟五对角Toeplitz矩阵行列式的一种快速算法  

A Fast Algorithm for the Determinant of Quasi-penta-diagonal Toeplitz Matrices

作　　者：康丽[1] 陈跃辉[1] 万继青 

机构地区：[1]闽南师范大学数学与统计学院,福建漳州363000

出　　处：《长江大学学报（自科版）（上旬）》2015年第4期5-9,3,共5页JOURNAL OF YANGTZE UNIVERSITY (NATURAL SCIENCE EDITION) SCI ＆ ENG

基　　金：福建省自然科学基金项目(2012D139);闽南师范大学研究生科研立项项目(YJS201411)

摘　　要：采用置换矩阵行列和矩阵分块,提出了一个求拟五对角Toeplitz矩阵行列式的快速计算方法:先右乘于适当的置换矩阵,然后进行矩阵分块,再利用Schur定理计算。同时给出其算法的实现步骤设计,并对算法的运算量进行了分析。算法的运算量为(7n+93),比相关文献所给的算法运算量(15n+184)还少。数值算例计算表明,该算法有效可行且结果较为精确。In this paper,a fast algorithm for solving the determinant of quasi pentadiagonal Toeplitz is presented by the permutation of matrix rows and columns,the thought of dividing matrix into blocks is that it is postmultiplied first by the appropriate displacement matrix,then matrix is blocked,and then Schur theorem is used for calculation.At the same time,the design implementation steps of the algorithm are given,and the complexity of the algorithm is analyzed.The calculation result indicates that the algorithm is effective and feasible.

关 键 词：拟五对角Toeplitz矩阵 行列式 复杂度 

分 类 号：O241.6[理学—计算数学]