A new algorithm for proving global asymptotic stability of rational difference equations

From MaRDI portal
Publication:4899080

DOI10.1080/10236198.2011.599804zbMATH Open1266.39016arXiv1106.0932OpenAlexW2030012858MaRDI QIDQ4899080FDOQ4899080

Emilie Hogan, Doron Zeilberger

Publication date: 4 January 2013

Published in: Journal of Difference Equations and Applications (Search for Journal in Brave)

Abstract: Global asymptotic stability of rational difference equations is an area of research that has been well studied. In contrast to the many current methods for proving global asymptotic stability, 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 which maps the k+1 dimensional real numbers to itself, we attempt to find an integer, K, for which QK 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.


Full work available at URL: https://arxiv.org/abs/1106.0932





Cites Work


Cited In (2)

Uses Software






This page was built for publication: A new algorithm for proving global asymptotic stability of rational difference equations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4899080)