Abstract
For the computation of a matrix sign function, a family of iterative methods is proposed. for some cases of the accelerator parameters, this method is proven to converge globally with higher rates of convergence. Its stability is discussed analytically as well. to illustrate the efficiency of the proposed methods from the family, several tests of various matrix sizes are considered to worked out.
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.
