A new algorithm for proving global asymptotic stability of rational difference equations. Global asymptotic stability (GAS) of rational difference equations is an area of research that has been well studied. In contrast to the many current methods for proving GAS, we propose an algorithmic approach. The algorithm we summarize here employs the idea of contractions. Given a particular rational difference equation, defined by a function Q:Bbb R^(k+1) to Bbb R^(k+1), we attempt to find a K value for which Q^K shrinks distances to the difference equation’s equilibrium point. We state some general results that our algorithm has been able to prove, and also mention the implementation of our algorithm using Maple.

Keywords for this software

Anything in here will be replaced on browsers that support the canvas element