| The Time Complexity of r-Circulant systems |
| Received:November 06, 1990 |
| Key Words:
|
| Fund Project: |
|
| Hits: 2225 |
| Download times: 1131 |
| Abstract: |
| We present some fast algorithms for calculating the total eigenvalues, the products, the inverses of n(= 2k)-order r-circulant matrix by reduced- order method. It is shown that the time complexity of these algorithms is O(nlog2 n). |
| Citation: |
| DOI:10.3770/j.issn:1000-341X.1992.04.024 |
| View Full Text View/Add Comment |
