A new algorithm for proving global asymptotic stability of rational difference equations
From MaRDI portal
Publication:4899080
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 which maps the dimensional real numbers to itself, we attempt to find an integer, , for which 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.
Recommendations
Cites work
- scientific article; zbMATH DE number 430502 (Why is no real title available?)
- Cylindrical Algebraic Decomposition I: The Basic Algorithm
- Dynamics of third-order rational difference equations with open problems and conjectures
- Global asymptotic stability in some discrete dynamical systems
- Testing positiveness of polynomials
Cited in
(2)
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)