Abstract
The main purpose of this paper is the study of numerical methods for the maximal solution of the matrix equation $X+A^*X^{-1}A = Q$, where $Q$ is Hermitian positive definite. We construct a smooth curve parameterized by $t\ge 1$ of symplectic pairs with a special structure, in which the curve passes through all iteration points generated by the known numerical methods, including the fixed-point iteration, the structure-preserving doubling algorithm (SDA), and Newton's method provided that $A^*Q^{-1}A=AQ^{-1}A^*$. In the theoretical section, we give a necessary and sufficient condition for the existence of this structure-preserving curve for each parameter $t\ge1$. We also study the monotonicity and boundedness properties of this curve. In the application section, we use this curve to measure the convergence rates of those numerical methods. Numerical results illustrating these solutions are also presented.
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.