Results 241 to 250 of about 453,330 (285)
Some of the next articles are maybe not open access.
Iteration of Quasiconformal Maps
Qualitative Theory of Dynamical SystemszbMATH Open Web Interface contents unavailable due to conflicting licenses.
Zhang, Xu, Wang, Yukai, Chen, Guanrong
openaire +2 more sources
Tilings Described by Iterated Maps
International Journal of Bifurcation and Chaos, 2003We construct auto-similar tilings of the plane with the same expansion coefficient [Formula: see text], a complex Perron number, from free group endomorphisms characterized by a class of matrices with the same complex Perron eigenvalue λ. We define a relation between the interior and the board of the tiles and obtain some results about topological ...
Rocha, J. Leonel, Sousa Ramos, J.
openaire +1 more source
Iteration of Quasiregular Mappings
Computational Methods and Function Theory, 2010zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Proceedings of 1995 IEEE International Symposium on Information Theory, 2002
The authors consider codes of the following type. Let S (the signal set) be a subset of n-dimensional Euclidean space R/sup n/. Let f:S/spl rarr/S be a continuous mapping. The code C(S,f) consists of those bi-infinite sequences x=...x/sub -l/,x/sub 0/,x/sub 1/,x/sub 2/,.../spl isin/S/sup /spl Zscr// that satisfy x/sub t/=f(x/sub t-1/) for all t/spl ...
H. Andersson, H.-A. Loeliger
openaire +1 more source
The authors consider codes of the following type. Let S (the signal set) be a subset of n-dimensional Euclidean space R/sup n/. Let f:S/spl rarr/S be a continuous mapping. The code C(S,f) consists of those bi-infinite sequences x=...x/sub -l/,x/sub 0/,x/sub 1/,x/sub 2/,.../spl isin/S/sup /spl Zscr// that satisfy x/sub t/=f(x/sub t-1/) for all t/spl ...
H. Andersson, H.-A. Loeliger
openaire +1 more source
2000
Abstract Dynamical systems described by iterated map functions are used to explore the period-doubling route to chaos, Lyapunov exponents, and Feigenbaum numbers. A simple derivation of the numerical value of the Feigenbaum number α is provided.
openaire +1 more source
Abstract Dynamical systems described by iterated map functions are used to explore the period-doubling route to chaos, Lyapunov exponents, and Feigenbaum numbers. A simple derivation of the numerical value of the Feigenbaum number α is provided.
openaire +1 more source
On Iterated Positive Schwarzian Derivative Maps
International Journal of Bifurcation and Chaos, 2003We study the behavior of a unimodal map in two parameters, one of the parameters varies the sign of the Schwarzian derivative the second the value of the maximum. We characterize the behavior of the different dynamics in the parameter space.
Oliveira, Henrique, Sousa Ramos, J.
openaire +1 more source
Iterated maps for annealed Boolean networks
Physical Review E, 2006Boolean networks are used to study the large-scale properties of nonlinear systems and are mainly applied to model genetic regulatory networks. A statistical method called the annealed approximation is commonly used to examine the dynamical properties of randomly generated Boolean networks that are created with selected statistical features.
Juha, Kesseli +2 more
openaire +2 more sources
2000
The local study of iterated holomorphic mappings, in a neighborhood of a fixed point, was quite well developed in the late 19th century. (Compare §§8–10, and see Alexander.) However, except for one very simple case studied by Schroder and Cayley (see Problem 7-a), nothing was known about the global behavior of iterated holomorphic maps until 1906, when
openaire +1 more source
The local study of iterated holomorphic mappings, in a neighborhood of a fixed point, was quite well developed in the late 19th century. (Compare §§8–10, and see Alexander.) However, except for one very simple case studied by Schroder and Cayley (see Problem 7-a), nothing was known about the global behavior of iterated holomorphic maps until 1906, when
openaire +1 more source
On Convergence of Iterated Random Maps
SIAM Journal on Control and Optimization, 1994Numerical optimization or root finding algorithms often face major problems including unacceptably slow convergence or failure to converge at all. Adding noise in a controlled fashion to those algorithms can yield solutions to problems untractable by the classical deterministic methods. This paper develops general conditions for almost sure convergence
Liukkonen, John R., Levine, Arnold
openaire +2 more sources
2001
To introduce simple complex iterative maps. To introduce Julia sets, the Mandelbrot set, and Newton fractals. To carry out some analysis on these sets.
openaire +1 more source
To introduce simple complex iterative maps. To introduce Julia sets, the Mandelbrot set, and Newton fractals. To carry out some analysis on these sets.
openaire +1 more source