ON NUMERICAL METHODS IN LOCALIZATION PROBLEMS
- 15 November 2024
- journal article
- Published by The Russian Academy of Sciences in Дифференциальные уравнения
- Vol. 60 (11) , 1553-1561
Abstract
When solving localization problem numerically, the main problem is to construct a universal cross section corresponding to a given localizing function. The paper proposes two methods for solving this problem, which use estimates of the first and second order derivatives. A comparative analysis of these methods with a method based on the use of all nodes of a regular grid was carried out. A comparative analysis shows that the proposed methods are superior both in terms of computational complexity and in the quality of the resulting approximation of the universal section.Keywords
This publication has 15 references indexed in Scilit:
- Hopf Bifurcation in a Predator–Prey System with InfectionDifferential Equations, 2023
- Construction of Lyapunov functions by the method of localization of invariant compact setsDifferential Equations, 2017
- Localization of simple and complex dynamics in nonlinear systemsDifferential Equations, 2015
- Localization of invariant compact sets in differential inclusionsDifferential Equations, 2015
- Compact invariant sets of the Bianchi VIII and Bianchi IX Hamiltonian systemsPhysics Letters A, 2011
- Maximal invariant compact sets of dynamical systemsDoklady Mathematics, 2011
- Localization of invariant compact sets of discrete systemsDoklady Mathematics, 2010
- Bounding a domain containing all compact invariant sets of the permanent-magnet motor systemCommunications in Nonlinear Science and Numerical Simulation, 2009
- Localization of invariant compact sets of nonautonomous systemsDifferential Equations, 2009
- Localization of Invariant Compact Sets of Dynamical SystemsDifferential Equations, 2005