On a two-term recurrence for the determinant of a general matrix
暂无分享,去创建一个
Recently, a two-term recurrence for computing the determinant of a tridiagonal matrix has been found by El-Mikkawy [M. El-Mikkawy, A note on a three-term recurrence for a tridiagonal matrix, Appl. Math. Comput. 139 (2003) 503-511]. Then, the result has been extended to a block-tridiagonal matrix by Salkuyeh [D.K. Salkuyeh, Comments on ''A note on a three-term recurrence for a tridiagonal matrix'', Appl. Math. Comput. 176 (2006) 442-444]. In this note, we show that the relation can be obtained for a general matrix and that as a by-product we obtain a generalization of the DETGTRI algorithm [M. El-Mikkawy, A fast algorithm for evaluating nth order tri-diagonal determinants, J. Comput. Appl. Math. 166 (2004) 581-584].
[1] Moawwad E. A. El-Mikkawy,et al. A fast algorithm for evaluating n th order tri-diagonal determinants , 2004 .
[2] Davod Khojasteh Salkuyeh. Comments on "A note on a three-term recurrence for a tridiagonal matrix" , 2006, Appl. Math. Comput..
[3] Moawwad E. A. El-Mikkawy. A note on a three-term recurrence for a tridiagonal matrix , 2003, Appl. Math. Comput..
[4] Fuzhen Zhang. The Schur complement and its applications , 2005 .