Compensated Splitting For Generalized Lyapunov Equations
For researchers solving generalized Lyapunov equations, this method improves convergence properties over the standard approach, though it is an incremental improvement on an existing numerical method.
The paper proposes a compensated splitting scheme for generalized Lyapunov equations that reduces the spectral radius of the fixed-point iteration operator, enabling convergence where standard fixed-point iteration diverges or accelerating convergence when it converges. Numerical results demonstrate superiority.
The generalized Lyapunov equation has a natural splitting that leads to the standard fixed-point iteration (sFPI) for its numerical solution. sFPI is convergent, for an arbitrarily given initial guess, if and only if the spectral radius of the associated linear operator is smaller than $1$. This means that sFPI may diverge if the spectral radius is $1$ or bigger. In this paper, we propose a compensated splitting scheme that aims to reduce the spectral radius so that the resulting compensated fixed-point iteration (cFPI) has a better convergence property, namely, cFPI may still converge even if sFPI does not or cFPI converges faster than sFPI does when the latter is also convergent. Numerical results are presented to demonstrate the superiority of cFPI to sFPI.