Abstract
The method of Pade matrix iteration is commonly used for computing matrix sign function and invariant subspaces of a real or complex matrix. In this paper, a detailed rounding error analysis is given for two classical schemes of the Pad’e matrix iteration, using basic matrix floating point arithmetics. Error estimations of computing invariant subspaces by the Pade sign iteration are also provided. Numerical experiments are given to show the numerical behaviors of the Pade iterations and the corresponding subspace computation.
Sign-in/Register to access full text options 
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.
