𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the stability of gradient polynomial systems at infinity

✍ Scribed by Ha Huy Vui; Nguyen Hong Duc

Publisher
Elsevier Science
Year
2011
Tongue
English
Weight
214 KB
Volume
74
Category
Article
ISSN
0362-546X

No coin nor oath required. For personal study only.

✦ Synopsis

We first define the notion of the infimum at infinity of a polynomial function and the notion of stability at infinity near the fiber of the gradient descent system. Then we prove that the gradient descent system is stable at infinity near the fiber of the infimum value at infinity.

πŸ“œ SIMILAR VOLUMES

On the zeta-function of a polynomial at
On the zeta-function of a polynomial at infinity
✍ Sabir M. Gusein-Zade; Ignacio Luengo; Alejandro Melle-HernΓ‘ndez πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 French βš– 100 KB
A quintic polynomial differential system
A quintic polynomial differential system with eleven limit cycles at the infinity
✍ Qi Zhang; Yirong Liu πŸ“‚ Article πŸ“… 2007 πŸ› Elsevier Science 🌐 English βš– 225 KB

In this article, a recursion formula for computing the singular point quantities of the infinity in a class of quintic polynomial systems is given. The first eleven singular point quantities are computed with the computer algebra system Mathematica. The conditions for the infinity to be a center are

On the stability analysis of nonlinear s
On the stability analysis of nonlinear systems using polynomial Lyapunov functions
✍ Hajer Bouzaouache; Naceur Benhadj Braiek πŸ“‚ Article πŸ“… 2008 πŸ› Elsevier Science 🌐 English βš– 204 KB

In the stability study of nonlinear systems, not to found feasible solution for the LMI problem associated with a quadratic Lyapunov function shows that it doesn't exist positive definite quadratic Lyapunov function that proves stability of the system, but doesn't show that the system isn't stable.

Atypical values at infinity of a polynom
Atypical values at infinity of a polynomial function on the real plane: an erratum, and an algorithmic criterion
✍ M. Coste; M.J. de la Puente πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 150 KB

We correct a previously published theorem by proving a criterion to decide whether the ΓΏbration given by a real polynomial function f : R 2 β†’ R is locally trivial at inΓΏnity. The algorithmical nature of this criterion provides a test that can be applied to any real polynomial f.