In this research, an efficient variant of mid-point iterative method is given for computing the sign of a square complex matrix having no pure imaginary eigenvalues. It is proven that… Click to show full abstract
In this research, an efficient variant of mid-point iterative method is given for computing the sign of a square complex matrix having no pure imaginary eigenvalues. It is proven that the method is new and has global convergence with high order of convergence seven. To justify the effectiveness of the new scheme, several comparisons for matrices of different sizes are worked out to show that the new method is efficient.
               
Click one of the above tabs to view related content.