A fast algorithm for computing the determinants of banded circulant matrices

DOI10.1016/j.amc.2013.12.048zbMath1364.65100OpenAlexW1985336777MaRDI QIDQ530029

Xie-Bin Chen

Publication date: 9 June 2017

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2013.12.048

zbMATH Keywords

computational complexityasymptotic behaviordeterminantcirculant matrixbanded matrix

Mathematics Subject Classification ID

Determinants, permanents, traces, other special matrix functions (15A15) Numerical computation of determinants (65F40)

Related Items

A note on a fast breakdown-free algorithm for computing the determinants and the permanents of \(k\)-tridiagonal matrices, On the extension of Sarrus' rule to \(n \times n\) (\(n > 3\)) matrices: development of new method for the computation of the determinant of \(4 \times 4\) matrix, More extensions of a determinant inequality of Hartfiel

Uses Software

• Mathematica

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the determinants and inverses of circulant matrices with Fibonacci and Lucas numbers
• A note on computing the inverse and the determinant of a pentadiagonal Toeplitz matrix
• Determinants and inverses of circulant matrices with Jacobsthal and Jacobsthal-Lucas numbers
• A fast numerical algorithm for the determinant of a pentadiagonal matrix
• Efficient Algorithms for the Evaluation of the Eigenvalues of (Block) Banded Toeplitz Matrices
• Complexity of Computations with Matrices and Polynomials
• Real-Valued, Low Rank, Circulant Approximation
• The Best Circulant Preconditioners for Hermitian Toeplitz Systems