The Shifting Technique for Computing the Extreme Solutions of X + A X-1 A = Q
Abstract
We propose a new way for speeding up the search of the maximal solution X+ of X + A X-1 A = Q. It is known that the speed of convergence of traditional approaches for solving this problem depends highly on the spectral radius ρ(X+-1A). If ρ(X+-1A) is close to one or equal to one, the iterations of traditional approaches converges very slowly or does not converge. Our goal is to come up with a shifting tactic to remove the singularities embedded in ρ(X+-1A). Finally, an example is used to demonstrate the capacity of our method.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.