Efficient Calculations for Inverse of $k$-diagonal Circulant Matrices and Cyclic Banded Matrices
<|reference_start|>Efficient Calculations for Inverse of $k$-diagonal Circulant Matrices and Cyclic Banded Matrices: $k$-diagonal circulant matrices and cyclic banded matrices are widely used in numerical simulations and signal processing of circular linear systems. Algorithms that directly involve or specify linear or quadratic complexity for the inverses of these two types of matrices are rare. We find that the inverse of a $k$-diagonal circulant matrix can be uniquely determined by a recursive formula, which can be derived within $O(k^3 \log n+k^4)$. Similarly for the inverse of a cyclic banded matrix, its inverse can be uniquely determined by a series of recursive formulas, with the initial terms of these recursions computable within $O(k^3 n+k^5)$. The additional costs for solving the complete inverses of these two types of matrices are $kn$ and $kn^2$. Our calculations enable rapid representation with most processes defined by explicit formulas. Additionally, most algorithms for inverting $k$-diagonal circulant matrices rely on the Fast Fourier Transform, which is not applicable to finite fields, while our algorithms can be applied to computations in finite fields.<|reference_end|>
@article{wang2024efficient,
    title={Efficient Calculations for Inverse of $k$-diagonal Circulant Matrices
  and Cyclic Banded Matrices},
    author={Chen Wang, Hailong Yu and Chao Wang},
    journal={arXiv preprint arXiv:2403.05048},
    year={2024},
    archivePrefix={arXiv},
    eprint={2403.05048},
    primaryClass={cs.MS}
}