Answers are grounded in this paper and cite their sources.
The matrix equation X+A^X⁻¹A=Q arises in Green's function calculations in nano research, where A is a real square matrix and Q is a real symmetric matrix dependent on a parameter and is usually indefinite. In practice one is mainly interested in those values of the parameter for which the matrix equation has no stabilizing solutions. The solution of interest in this case is a special weakly stabilizing complex symmetric solution X_*, which is the limit of the unique stabilizing solution Xη of the perturbed equation X+A^X⁻¹A=Q+iη I, as η→ 0⁺. It has been shown that a doubling algorithm can be used to compute Xη efficiently even for very small values of η, thus providing good approximations to X_*. It has been observed by nano scientists that a modified fixed-point method can sometimes be quite useful, particularly for computing Xη for many different values of the parameter. We provide a rigorous analysis of this modified fixed-point method and its variant and of their generalizations. We also show that the imaginary part XI of the matrix X_* is positive semidefinite and we determine the rank of XI in terms of the number of unimodular eigenvalues of the quadratic pencil λ² A^-λ Q+A. Finally we present a new structure-preserving algorithm that is applied directly on the equation X+A^X⁻¹A=Q. In doing so, we work with real arithmetic most of the time.
No takes yet. Share an insight, caveat, or question.
Guo et al. (2012) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: