Numerical methods for large-scale Lyapunov equations with symmetric banded data
This work provides new solution methods for a specific, underexplored class of Lyapunov equations, which is an incremental contribution for researchers in numerical linear algebra.
The paper introduces two efficient numerical methods for solving large-scale Lyapunov equations with symmetric banded data, addressing both well-conditioned and ill-conditioned cases, and demonstrates memory and computational savings through numerical experiments.
The numerical solution of large-scale Lyapunov matrix equations with symmetric banded data has so far received little attention in the rich literature on Lyapunov equations. We aim to contribute to this open problem by introducing two efficient solution methods, which respectively address the cases of well conditioned and ill conditioned coefficient matrices. The proposed approaches conveniently exploit the possibly hidden structure of the solution matrix so as to deliver memory and computation saving approximate solutions. Numerical experiments are reported to illustrate the potential of the described methods.