Answers are grounded in this paper and cite their sources.
This paper is concerned with the unique positive definite solution to a system of nonlinear matrix equations X-A^*Ȳ⁻¹A=Iₙ and Y-B^*X̄⁻¹B=Iₙ, where A, Bn× n are given matrices. Based on the special structure of the system of nonlinear matrix equations, the system can be equivalently reformulated as V-C^*V̄⁻¹C=I₂ₙ. Moreover, by means of Sherman-Moorison-Woodbury formula, we derive the relationship between the solutions of V-C^*V̄⁻¹C =I₂ₙ and the well studied standard nonlinear matrix equation Z+D^*Z⁻¹D=Q, where D, Q are uniquely determined by C. Then, we present a structure-preserving doubling algorithm and two modified structure-preserving doubling algorithms to compute the positive definite solution of the system. Furthermore, cyclic reduction algorithm and two modified cyclic reduction algorithms for the positive definite solution of the system are proposed. Finally, some numerical examples are presented to illustrate the efficiency of the theoretical results and the behavior of the considered algorithms.
No takes yet. Share an insight, caveat, or question.
Huang et al. (2019) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: