In this paper we consider the problem of inverting an n × n circulant matrix with entries over Zm. We show that the algorithm for inverting circulants, based on the reduction to diagonal form by means of FFT, has some drawbacks when working We present three different algorithms which do not use this approach. Our algorithms require different degrees of knowledge of m and n, and their costs range - roughly - from n log n log log n to n log 2 n log log n log m operations over Zm. We also present an algorithm for the inversion of finitely generated bi-infinite Toeplitz matrices. The problems considered in this paper have applications to the theory of linear Cellular Automata.
CITATION STYLE
Bini, D., Del Corso, G. M., Manzini, G., & Margara, L. (1998). Inversion of circulant matrices over Zm. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1443 LNCS, pp. 719–730). Springer Verlag. https://doi.org/10.1007/bfb0055096
Mendeley helps you to discover research relevant for your work.