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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.