Abstract
In this paper we consider the problem of inverting an n×n RSFMLR circulant matrix with entries over Zm. We present two different algorithms. Our algorithms require different degrees of knowledge of m and n, and their costs range, from n log n loglog n to n log2 n loglog n log m operations over Zm. Moreover, for each algorithm we give the cost in terms of bit operations. Finally, the extended algorithms is used to solve the problem of inverting RSFMLR circulant matrices over Zm.
Export citation and abstract BibTeX RIS
Content from this work may be used under the terms of the Creative Commons Attribution 3.0 licence. Any further distribution of this work must maintain attribution to the author(s) and the title of the work, journal citation and DOI.