S-iteration scheme and polynomiography
From MaRDI portal
Publication:3455293
DOI10.22436/JNSA.008.05.14zbMATH Open1327.30011OpenAlexW2186949102MaRDI QIDQ3455293FDOQ3455293
Authors: Shin Min Kang, Hamed H. Alsulami, A. Rafiq, Abdul Aziz Shahid 
Publication date: 4 December 2015
Published in: The Journal of Nonlinear Sciences and Applications (Search for Journal in Brave)
Full work available at URL: http://www.tjnsa.com/includes/files/articles/Vol8_Iss5_617--627_S-iteration_scheme_and_polynomiogra.pdf
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 (7)
- New escape criteria for complex fractals generation in Jungck-CR orbit
- Bisheh-Niasar-Saadatmandi root finding method via the \(S\)-iteration with periodic parameters and its polynomiography
- Fractal patterns from the dynamics of combined polynomial root finding methods
- Procedural generation of aesthetic patterns from dynamics and iteration processes
- The Picard-Mann iteration with \(s\)-convexity in the generation of Mandelbrot and Julia sets
- Newton–Ellipsoid polynomiography
- Higher order methods of the basic family of iterations via \(S\)-iteration scheme with \(s\)-convexity
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)
