Search
Search results for: RIGOROUS NUMERICS
-
Rigorous numerics for critical orbits in the quadratic family
PublicationWe develop algorithms and techniques to compute rigorous bounds for finite pieces of orbits of the critical points, for intervals of parameter values, in the quadratic family of one-dimensional maps fa(x)=a−x2. We illustrate the effectiveness of our approach by constructing a dynamically defined partition P of the parameter interval Ω=[1.4,2] into almost 4 million subintervals, for each of which we compute to high precision the...
-
The Conley Index and Rigorous Numerics for Attracting Periodic Orbits
Publication -
Stochastic intervals for the family of quadratic maps
Open Research DataNumerical analysis of chaotic dynamics is a challenging task. The one-parameter families of logistic maps and closely related quadratic maps f_a(x)=a-x^2 are well-known examples of such dynamical systems. Determining parameter values that yield stochastic-like dynamics is especially difficult, because although this set has positive Lebesgue measure,...
-
Topological-numerical analysis of a two-dimensional discrete neuron model
PublicationWe conduct computer-assisted analysis of a two-dimensional model of a neuron introduced by Chialvo in 1995 [Chaos, Solitons Fractals 5, 461–479]. We apply the method of rigorous analysis of global dynamics based on a set-oriented topological approach, introduced by Arai et al. in 2009 [SIAM J. Appl. Dyn. Syst. 8, 757–789] and improved and expanded afterward. Additionally, we introduce a new algorithm to analyze the return times...
-
Paweł Pilarczyk dr hab.
People -
A space-efficient algorithm for computing the minimum cycle mean in a directed graph
PublicationAn algorithm is introduced for computing the minimum cycle mean in a strongly connected directed graph with n vertices and m arcs that requires O(n) working space. This is a considerable improvement for sparse graphs in comparison to the classical algorithms that require O(n^2) working space. The time complexity of the algorithm is still O(nm). An implementation in C++ is made publicly available at http://www.pawelpilarczyk.com/cymealg/.
-
An absorbing set for the Chialvo map
PublicationThe classical Chialvo model, introduced in 1995, is one of the most important models that describe single neuron dynamics. In order to conduct effective numerical analysis of this model, it is necessary to obtain a rigorous estimate for the maximal bounded invariant set. We discuss this problem, and we correct and improve the results obtained by Courbage and Nekorkin (2010). In particular, we provide an explicit formula for an...