Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have