Results 251 to 260 of about 22,491,817 (299)
Long-Time Stability of a Stably Stratified Rest State in the Inviscid 2D Boussinesq Equation. [PDF]
Jurja C, Widmayer K.
europepmc +1 more source
A transdiagnostic conflict-square algorithm: a four-node computational framework for psychotherapy and functional diagnosis. [PDF]
Niederlohmann E.
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Chaos in Iterated Function Systems
International Journal of Bifurcation and Chaos, 2020In the present paper, we study chaos in iterated function systems (IFS), namely dynamical systems with several generators. We introduce weak Li–Yorke chaos, chaos in branch, and weak topological chaos to perceive the role of branches to create chaos in an IFS. Moreover, we define another type of chaos, [Formula: see text]-chaos, on an IFS.
Maliheh Mohtashamipour +1 more
openaire +2 more sources
Recurrent Iterated Function Systems
Constructive Approximation, 1989Recurrent iterated function systems generalize iterated function systems as introduced by the first author and \textit{S. Demko} [Proc. R. Soc. Lond., Ser. A 399, 243-275 (1985; Zbl 0588.28002)] in that a Markov chain (typically with some zeros in the transition probability matrix) is used to drive a system of maps \(w_ j:\) \(K\to K\), \(j=1,2,...,N\),
Michael F Barnsley
exaly +2 more sources
Fractals, 2010
In 1969, Kannan1 gave the definition of a new mapping which had presented a condition which is more lenient than contraction condition. The purpose of this note is to introduce K-Iterated Function System using Kannan mapping which will cover a larger range of mappings. We also prove the Collage theorem for the K-Iterated Function System.
Sahu, D. R. +2 more
openaire +2 more sources
In 1969, Kannan1 gave the definition of a new mapping which had presented a condition which is more lenient than contraction condition. The purpose of this note is to introduce K-Iterated Function System using Kannan mapping which will cover a larger range of mappings. We also prove the Collage theorem for the K-Iterated Function System.
Sahu, D. R. +2 more
openaire +2 more sources
Iterated Function Systems, Iterated Multifunction Systems, and Applications
2008In the first part of the paper we recall the theory of iterated function systems and iterated multifunction systems. In the second part we show some applications in economics, statistics and finance.
C. Colapinto, D. La Torre
openaire +2 more sources
Iterated function systems and dynamical systems
Chaos: An Interdisciplinary Journal of Nonlinear Science, 1995We study the relationship between measures invariant for a piecewise expanding transformation τ of a compact metric space endowed with a underlying measure and measures invariant for an iterated function system Tτ, generated by inverse branches of τ. The main result says that the τ-invariant absolutely continuous measure μ is also Tτ invariant if and ...
Góra, Paweł, Boyarsky, Abraham
openaire +2 more sources
Refinable functions, functionals, and iterated function systems
Applied Mathematics and Computation, 2016zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Francesco Calabrò +3 more
openaire +2 more sources
Infinite Iterated Function Systems
Mathematische Nachrichten, 1994AbstractWe examine iterated function systems consisting of a countably infinite number of contracting mappings (IIFS). We state results analogous to the well‐known case of finitely many mappings (IFS). Moreover, we show that IIFS can be approximated by appropriately chosen IFS both in terms of Hausdorff distance and of Hausdorff dimension.
openaire +2 more sources

