We present a simple algorithm that reduces the time complexity of solving the linear system $Gx=b$, where $G$ is
a nonsingular centrosymmetric/skew-centrosymmetric matrix.
We also reduce the time complexity of solving some complex linear systems. We propose efficient methods for
multiplying centrosymmetric/skew-centrosymmetric matrices.
Authors
Iyad T. Abu-Jeib
Pages From
46
Pages To
53
Journal Name
Missouri J. Math. Sci.
Volume
18
Issue
1
Keywords
Skew-centrosymmetric, centrosymmetric, Toeplitz, linear systems, Hermitian persymmetric.
Abstract