Algorithms for Centrosymmetric and Skew-Centrosymmetric Matrics
iyad t. abu-jeib · Missouri Journal of Mathematical Sciences · 2006
We present a simple algorithm that reduces the time complexity of solving the linear system $Gx=b$, where $G$ is a 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.