The computation of the principal square roots of centrosymmetric H-matrices

In this paper two algorithms for computing the principal square root of a centrosymmetric H-matrix with positive diagonal entries are proposed. It is showed that our algorithms ensure significant savings in computational costs, as compared to the case of an arbitrary H-matrix A with positive diagonal entries.