Iterative methods for the delay Lyapunov equation with T-Sylvester preconditioning
Elias Jarlebring, Federico Poloni

TL;DR
This paper introduces an iterative method with T-Sylvester preconditioning for efficiently solving the delay Lyapunov equation, enabling solutions for large-scale problems arising in time-delay systems.
Contribution
The paper presents a novel iterative algorithm using T-Sylvester preconditioning to solve the delay Lyapunov equation more efficiently than existing methods.
Findings
Effective preconditioner based on T-Sylvester equation
Able to solve problems with up to 10^6 unknowns
Demonstrated efficiency on delay systems from PDE discretization
Abstract
The delay Lyapunov equation is an important matrix boundary-value problem which arises as an analogue of the Lyapunov equation in the study of time-delay systems . We propose a new algorithm for the solution of the delay Lyapunov equation. Our method is based on the fact that the delay Lyapunov equation can be expressed as a linear system of equations, whose unknown is the value , i.e., the delay Lyapunov matrix at time . This linear matrix equation with unknowns is solved by adapting a preconditioned iterative method such as GMRES. The action of the matrix associated to this linear system can be computed by solving a coupled matrix initial-value problem. A preconditioner for the iterative method is proposed based on solving a T-Sylvester equation , for which there are…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
