Abstract
Investigating the fractal behavior of iteration methods on special polynomials can help to find iterative methods with global convergence for finding special matrix functions. By employing such a methodology, we propose a new solver for the sign of an invertible square matrix. The presented method achieves the fourth rate of convergence by using as few matrix products as possible. Its attraction basin shows larger convergence radii, in contrast to its Padé-type methods of the same order. Computational tests are performed to check the efficacy of the proposed solver.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: 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.
