Lyapunov Functions can Exactly Quantify Rate Performance of Nonlinear Differential Equations
Declan S. Jagt, Matthew M. Peet
TL;DR
This paper develops a unified framework for quantifying rate performance in nonlinear ODEs by introducing beta-stability, a normalized, time-invariant generalization of exponential, rational, and finite-time stability. It proves a necessary-and-sufficient Lyapunov characterization: beta-stability with rate $k$ on a forward-invariant set is equivalent to the existence of a Lyapunov function $V$ satisfying $M^{-1}\alpha(x)\le V(x)\le \alpha(x)$ and $\dot V(x)\le k\rho(V(x))$ (when differentiable), with two-measure extensions. The authors then translate these conditions into SOS programs for exponential, rational, and finite-time stability, enabling computation of tight lower bounds on rate performance and regions of performance; they also demonstrate a conservatism scaling rule in the rational case. Numerical experiments on Lorenz and van der Pol systems show that SOS-derived bounds closely track simulation and reveal regions where rate performance can be certified. Overall, the work provides a practical, computationally tractable approach to quantify and certify rate and gain performance in nonlinear dynamics.
Abstract
Pointwise-in-time stability notions for Ordinary Differential Equations (ODEs) provide quantitative metrics for system performance by establishing bounds on the rate of decay of the system state in terms of initial condition -- allowing stability to be quantified by e.g. the maximum provable decay rate. Such bounds may be obtained by finding suitable Lyapunov functions using, e.g. Sum-of-Squares (SOS) optimization. While Lyapunov tests have been proposed for numerous pointwise-in-time stability notions, including exponential, rational, and finite-time stability, it is unclear whether these characterizations are able to provide accurate bounds on system performance. In this paper, we start by proposing a generalized notion of rate performance -- with exponential, rational, and finite-time decay rates being special cases. Then, for any such notion and rate, we associate a Lyapunov condition which is shown to be necessary and sufficient for a system to achieve that rate. Finally, we show how the proposed conditions can be enforced using SOS programming in the case of exponential, rational, and finite-time stability. Numerical examples in each case demonstrate that the corresponding SOS test can achieve tight bounds on the rate performance with accurate inner bounds on the associated regions of performance.
