Related papers: The attractor structure of logarithmic iterations …
We use simple equations in order to compare the basins of attraction on the complex plane, corresponding to a large collection of numerical methods, of several order. Two cases are considered, regarding the total number of the roots, which…
We study the attractor of Iterated Function Systems composed of infinitely many affine, homogeneous maps. In the special case of second generation IFS, defined herein, we conjecture that the attractor consists of a finite number of…
The algebraic structure of the attractors in a dynamical system determine much of its global dynamics. The collection of all attractors has a natural lattice structure, and this structure can be detected through attracting neighborhoods,…
Iterated loop algebras are by definition obtained by repeatedly applying the loop construction, familiar from the theory of affine Kac-Moody Lie algebras, to a given base algebra. Our interest in this iterated construction is motivated by…
We describe the basic lattice structures of attractors and repellers in dynamical systems. The structure of distributive lattices allows for an algebraic treatment of gradient-like dynamics in general dynamical systems, both invertible and…
We study some topological properties of attractors.
In this paper we present a systematic study of continuous local iterated function systems. We prove local iterated function systems admit compact attractors and, under a contractivity assumption, construct their code space and present an…
We present an iterative root finding method for harmonic mappings in the complex plane, which is a generalization of Newton's method for analytic functions. The complex formulation of the method allows an analysis in a complex variables…
For fractals on Riemannian manifolds, the theory of iterated function systems often does not apply well directly, as fractal sets are often defined by relations that are multivalued or non-contractive. To overcome this difficulty, we…
In various areas of applied numerics, the problem of calculating the logarithm of a matrix A emerges. Since series expansions of the logarithm usually do not converge well for matrices far away from the identity, the standard numerical…
This paper finds relationships between multiple logarithms with a dihedral group action on the arguments. I generalize the combinatorics developed in Gangl, Goncharov and Levin's R-deco polygon representation of multiple logarithms to find…
This paper studies geometric properties of the Iterated Matrix Multiplication polynomial and the hypersurface that it defines. We focus on geometric aspects that may be relevant for complexity theory such as the symmetry group of the…
We construct a converging geometric iterated function system on the moduli space of ordered triangles, for which the involved functions have geometric meanings and contain a non-contraction map under the natural metric.
We prove that a variation of mixed Hodge structure is embedded in a logarithmic variation of pure Hodge structure, and a generalized version of this result. These results suggest some simple construction of the category of mixed motives by…
We introduce a fixed point iteration process built on optimization of a linear function over a compact domain. We prove the process always converges to a fixed point and explore the set of fixed points in various convex sets. In particular,…
We construct an example of an iterated function system on the line, consisting of linear fractional transformations, such that two of the maps share a fixed points, but the dimension of the attractor equals the conformal dimension, so that…
We study the topological properties of attractors of Iterated Function Systems (I.F.S.) on the real line, consisting of affine maps of homogeneous contraction ratio. These maps define what we call a second generation I.F.S.: they are…
We present an algebraic characterization of the complexity classes Logspace and Nlogspace, using an algebra with a composition law based on unification. This new bridge between unification and complexity classes is rooted in proof theory…
The circular Sitnikov problem, where the two primary bodies are prolate or oblate spheroids, is numerically investigated. In particular, the basins of convergence on the complex plane are revealed by using a large collection of numerical…
We show that the points that converge to infinity under iteration of the exponential map form a connected subset of the complex plane.