Numerically stable improved Chebyshev-Halley type schemes for matrix sign function

A general family of iterative methods including a free parameter is derived and proved to be convergent for computing matrix sign function under some restrictions on the parameter. Several special cases including global convergence behavior are dealt with. It is analytically shown that they are asymptotically stable. A variety of numerical experiments for matrices with different sizes is considered to show the effectiveness of the proposed members of the family.