S-iteration scheme and polynomiography
From MaRDI portal
Publication:3455293
Recommendations
- Combinatorics of polynomials iterations
- A polynomial version of Sarnak's conjecture
- A new algorithm for an \(S\)-polynomial
- The iteration of quasipolynomial mappings
- Iteration of polynomial mappings on algebraic sets
- scientific article; zbMATH DE number 665401
- Polynomial semiconjugacies, decompositions of iterations, and invariant curves
- Counting solutions of polynomial systems via iterated fibrations
- On the factorization of iterated polynomials
Cited in
(13)- Newton-ellipsoid polynomiography
- Tricorns and multicorns of \(S\)-iteration scheme
- Polynomiography and chaos
- The Picard-Mann iteration with \(s\)-convexity in the generation of Mandelbrot and Julia sets
- New escape criteria for complex fractals generation in Jungck-CR orbit
- Procedural generation of aesthetic patterns from dynamics and iteration processes
- Fractal patterns from the dynamics of combined polynomial root finding methods
- Polynomiography based on the nonstandard Newton-like root finding methods
- An iteration process for a general class of contractive-like operators: convergence, stability and polynomiography
- Higher order methods of the basic family of iterations via \(S\)-iteration scheme with \(s\)-convexity
- Polynomiography via an iterative method corresponding to simpsons \(\frac 13\) rule
- Polynomiography for the polynomial infinity norm via Kalantari's formula and nonstandard iterations
- Bisheh-Niasar-Saadatmandi root finding method via the \(S\)-iteration with periodic parameters and its polynomiography
This page was built for publication: S-iteration scheme and polynomiography
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3455293)