相关论文: Newton-Mandelbrot set and Murase-Mandelbrot set

Mandelbrot set arose from the pioneering work of French mathematician Gaston Julia in the field of complex dynamics at the beginning of the 20th century. French-American mathematician Benoit Mandelbrot used computers to calculate iterations…

We extend the Newton's method and show the extended Newton's method leads to the binomial expansion of Newton's method that the convergences become the quadratic and linearly. In case of the quadratic convergence, we give the convergence…

Mandelbrot multiplicative cascades provide a construction of a dynamical system on a set of probability measures defined by inequalities on moments. To be more specific, beyond the first iteration, the trajectories take values in the set of…

We suggest an approach to constructing physical systems with dynamical characteristics of the complex analytic iterative maps. The idea follows from a simple notion that the complex quadratic map by a variable change may be transformed into…

We investigate with the help of Clifford algebraic methods the Mandelbrot set over arbitrary two-component number systems. The complex numbers are regarded as operator spinors in D\times spin(2) resp. spin(2). The thereby induced (pseudo)…

In this course, we propose an elementary and self-contained introduction to canonical Mandelbrot random cascades. The multiplicative construction is explained and the necessary and sufficient condition of non-degeneracy is proved. Then, we…

An iterative formula based on Newton Method alone is presented for the iterative solutions of equations that ensures convergence in cases where the traditional Newton Method may fail to converge to the desired root. In addition, the method…

Concise introduction to a relatively new subject of non-linear algebra: literal extension of text-book linear algebra to the case of non-linear equations and maps. This powerful science is based on the notions of discriminant…

Iterating Newton's method symbolically for the general quadratic yields a rational function, the numerator and denominator of which are polynomials with highly composite coefficients.

We consider p-divisible groups (also called Barsotti-Tate groups) in characteristic p, their deformations, and we draw some conclusions. For such a group we can define its Newton polygon (abbreviated NP). This is invariant under isogeny.…

A general class of Newton algorithms on Gra{\ss}mann and Lagrange-Gra{\ss}mann manifolds is introduced, that depends on an arbitrary pair of local coordinates. Local quadratic convergence of the algorithm is shown under a suitable condition…

We consider perturbations of the complex quadratic map $ z \to z^2 +c$ and corresponding changes in their quasi-Mandelbrot sets. Depending on particular perturbation, visual forms of quasi-Mandelbrot set changes either sharply (when the…

We study a variant of Newton's algorithm applied to under-determined systems of non-smooth equations. The notion of regularity employed in our work is based on Newton differentiability, which generalizes semi-smoothness. The classic notion…

A feasible model is introduced that manifests phenomena intrinsic to iterative complex analytic maps (such as the Mandelbrot set and Julia sets). The system is composed of two coupled alternately excited oscillators (or self-sustained…

In this paper, we generalize the Mandelbrot set using quaternions and spherical coordinates. In particular, we use pure quaternions to define a spherical product. This product, which is inspired by the product of complex numbers, add the…

The generation of fractals and study of the dynamics of polynomials is one of the emerging and interesting field of research nowadays. We introduce in this paper the dynamics of polynomials z^ n - z + c = 0 for n>=2 and applied Jungck…

We consider complex Mandelbrot multiplicative cascades on a random weigh\-ted tree. Under suitable assumptions, this yields a dynamics $\T$ on laws invariant by random weighted means (the so called fixed points of smoothing transformations)…

We consider the "Mandelbrot set" $M$ for pairs of complex linear maps, introduced by Barnsley and Harrington in 1985 and studied by Bousch, Bandt and others. It is defined as the set of parameters $\lambda$ in the unit disk such that the…

Finding roots of equations is at the heart of most computational science. A well-known and widely used iterative algorithm is the Newton's method. However, its convergence depends heavily on the initial guess, with poor choices often…

We describe an interesting interplay between symbolic dynamics, the structure of the Mandelbrot set, permutations of periodic points achieved by analytic continuation, and Galois groups of certain polynomials. Internal addresses are a…