A quadrature framework for solving Lyapunov and Sylvester equations.

This paper introduces a novel framework for the solution of (large-scale) Lyapunov and Sylvester equations derived from numerical integration methods. Suitable systems of ordinary differential equations are introduced. Low rank approximations of their solutions are produced by Runge-Kutta methods. Appropriate Runge-Kutta methods are identified following the idea of geometric numerical integration to preserve a geometric property, namely a low rank residual. For both types of equations we prove the equivalence of one particular instance of the resulting algorithm to the well known ADI iteration. [ABSTRACT FROM AUTHOR]