A common problem to all applications of linear finite dynamical systems is analyzing the dynamics without enumerating every possible state transition. Of particular interest is the long term dynamical behaviour, and if every element eventually converges on fixed points. In this paper, we study the number of iterations needed for a system to settle on a fixed set of elements. As our main result, we present two upper bounds on iterations needed, and each one may be readily applied to a fixed point system test. The bounds are based on submodule properties of iterated images and reduced systems modulo a prime
We adopt an operator-theoretic perspective to study convergence of linear fixed-point iterations and...
Abstract. We show that a continuous map or a continuous flow on Rn with a certain recurrence relatio...
In this paper, we establish sublinear and linear convergence of fixed point iterations generated by ...
A common problem to all applications of linear finite dynamical systems is analyzing the dynamics wi...
We investigate the convergence towards periodic orbits in discrete dynamical systems. We examine the...
We investigate the convergence towards periodic orbits in discrete dynamical systems. We examine the...
The infinite population simple genetic algorithm is a discrete dynamical system model of a genetic a...
In this paper we present some of my favorite problems, all the time open, in the fixed point theory....
AbstractWe continue the study of the convergence of dynamic iteration methods by applying them to li...
We study computational complexity of counting the fixed point configurations (FPs) in certain discre...
In the context of abstract interpretation for languages without higher-order features we study the n...
We adopt an operator-theoretic perspective to study convergence of linear fixed-point iterations and...
We treat mathematical problems for iteration dynamical systems of discrete Laplacians on the plane l...
Considering iterative sequences that arise when the approximate solution to a numerical problem is u...
Dottorato di Ricerca in Matematica ed Informatica. Ciclo XXXIn this thesis we introduce iterative me...
We adopt an operator-theoretic perspective to study convergence of linear fixed-point iterations and...
Abstract. We show that a continuous map or a continuous flow on Rn with a certain recurrence relatio...
In this paper, we establish sublinear and linear convergence of fixed point iterations generated by ...
A common problem to all applications of linear finite dynamical systems is analyzing the dynamics wi...
We investigate the convergence towards periodic orbits in discrete dynamical systems. We examine the...
We investigate the convergence towards periodic orbits in discrete dynamical systems. We examine the...
The infinite population simple genetic algorithm is a discrete dynamical system model of a genetic a...
In this paper we present some of my favorite problems, all the time open, in the fixed point theory....
AbstractWe continue the study of the convergence of dynamic iteration methods by applying them to li...
We study computational complexity of counting the fixed point configurations (FPs) in certain discre...
In the context of abstract interpretation for languages without higher-order features we study the n...
We adopt an operator-theoretic perspective to study convergence of linear fixed-point iterations and...
We treat mathematical problems for iteration dynamical systems of discrete Laplacians on the plane l...
Considering iterative sequences that arise when the approximate solution to a numerical problem is u...
Dottorato di Ricerca in Matematica ed Informatica. Ciclo XXXIn this thesis we introduce iterative me...
We adopt an operator-theoretic perspective to study convergence of linear fixed-point iterations and...
Abstract. We show that a continuous map or a continuous flow on Rn with a certain recurrence relatio...
In this paper, we establish sublinear and linear convergence of fixed point iterations generated by ...