Benner, PeterHeinkenschloß, MatthiasSaak, JensWeichelt, Heiko K.Max-Planck-Institut für Dynamik Komplexer Technischer Systeme2025-05-292015https://epflicht.bibliothek.uni-halle.de/handle/123456789/3945870916386urn:nbn:de:gbv:3:2-647252483903Abstract: This paper improves the inexact Kleinman-Newton method by incorporating a line search and by systematically integrating the low-rank structure resulting from ADI methods for the approximate solution of the Lyapunov equation that needs to be solved to compute the Kleinman-Newton step. A convergence result is presented that tailors the convergence proof for general inexact Newton methods to the structure of Riccati equations and avoids positive semi-deniteness ssumptions on the Lyapunov equation residual, which in general do not hold for ow-rank approaches. On a test example, the improved inexact Kleinman-Newton ethod is seven to twelve times faster than the exact Kleinman-Newton method ithout line search; the addition of the line search to the inexact Kleinman-Newton method alone can reduce computation time by up to a factor of two.1 Online-Ressource (28 Seiten = 0,45 MB)enghttp://rightsstatements.org/vocab/InC/1.0/510Book