The first system tested was the nonlinear system given by
Eqs. 2 and 3 (which had appeared in a homework
problem):
One test run returned the function
, which is
indeed a Lyapunov function in the domain. It is clearly positive
definite, and its derivative is
![]() |
![]() |
![]() |
|
![]() |
![]() |
There were a couple runs that produced functions that looked Lyapunov
from the graphs, and seemed have strictly less than zero
except at the origin, which would prove asymptotic stability. They
were somewhat more complex to analyse. Fig. 6 shows
the plots for one of these functions. (However, I suspect this
function has a small region where it fails to satisfy the Lyapunov
criteria near the origin.)
But not all of the tests returned a Lyapunov-looking function. One test produced a function that (seemed as if it) met the three Lyapunov criteria; however, it wasn't continuously differentiable (see Fig. 7). On some other runs, the system didn't converge, but reached the maximum number of generations while only satisfying the Lyapunov criteria on 80% or so of the domain. The two runs I made without the square function in the nonterminal set did this. This is the nature of genetic algorithms, because of their randomness: getting a good result often requires several runs.