Abstract
The nonlinear matrix equation was solved by Gao (2016) via standard fixed point method. In this paper, three more elegant iterative methods are proposed to find the approximate solution of the nonlinear matrix equation namely: Newton’s method; modified fixed point method and a combination of Newton’s method and fixed point method. The convergence of Newton’s method and modified fixed point method are derived. Comparative numerical experimental results indicate that the new developed algorithms have both less computational time and good convergence properties when compared to their respective standard algorithms.
 Keywords: Hermitian positive definite solution; nonlinear matrix equation; modified fixed point method; iterative method
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.
