Low Rank ADI Solution of Sylvester Equation via Exact Shifts

[40] D. Salkuyeh, F. Toutounian, New approaches for solving large Sylvesterequations, Appl. Math. Comput. 173 (1) (2006) 9–18.[41] V. Sima, Algorithms for Linear-Quadratic Optimization, vol. 200 of Pure andApplied Mathematics, Marcel Dekker, Inc., New York, NY, 1996.[42] , A new iterative method for solving large-scale Lyapunov matrix equations,SIAM J. Sci. Comput. 29 (2007) 1268–1288.[43] D. Sorensen, A. Antoulas, The Sylvester equation and approximate balancedreduction, Linear Algebra Appl. 351/352 (2002) 671–700.[44] G. Strang, Linear Algebra and Its Applications, third ed., Harcourt BraceJovanovich, Philadelphia, PA, 1988.[45] G. W. Stewart, Ji-guang Sun, Matrix Perturbation Theory, Academic Press,Harcourt Brace Jovanovich, 1990.[46] N. Truhar, The perturbation bound for the solution of the Lyapunov equation,Mathematical Communication 12 (1) (2007) 83–94.[47] N. Truhar, R.-C. Li, On ADI Method for Sylvester Equations, Technical Report2008-02, department of Mathematics, University of Texas at Arlington, Arlington,TX. USA.[48] N. Truhar and K. Veselić, Bounds on the trace of solution to the Lyapunovequation with a general stable matrix, Systems Control Lett. 56 (2007) 493–503.[49] E. L. Wachspress, Iterative solution of the Lyapunov matrix equation, Appl.Math. Lett. 1 (1988) 87–90.29