Polynomiography based on the nonstandard Newton-like root finding methods
From MaRDI portal
Publication:305015
DOI10.1155/2015/797594zbMATH Open1386.65135OpenAlexW2056038242WikidataQ58933564 ScholiaQ58933564MaRDI QIDQ305015FDOQ305015
Authors: Krzysztof Gdawiec, Wiesław Kotarski, Agnieszka Lisowska 
Publication date: 26 August 2016
Published in: Abstract and Applied Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2015/797594
Recommendations
- Polynomiography for the polynomial infinity norm via Kalantari's formula and nonstandard iterations
- Newton's method with fractional derivatives and various iteration processes via visual analysis
- S-iteration scheme and polynomiography
- Polynomiography and chaos
- Polynomiography via an iterative method corresponding to simpsons \(\frac 13\) rule
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- New approximation schemes for general variational inequalities
- A Picard-Mann hybrid iterative process
- Fixed Points by a New Iteration Method
- Mean Value Methods in Iteration
- Weak and strong convergence criteria of Noor iterations for asymptotically nonexpansive mappings
- Iterative approximation of fixed points
- On the rate of convergence of Mann, Ishikawa, Noor and SP-iterations for continuous functions on an arbitrary interval
- Multipoint methods for solving nonlinear equations: a survey
- Polynomial root-finding and polynomiography
- Fixed point of a new three-step iteration algorithm under contractive-like operators over normed spaces
- Multipoint iterative methods for finding all the simple zeros in an interval
- Julia sets and Mandelbrot sets in Noor orbit
- Title not available (Why is that?)
- A new approach to superfractals
- On the quadratic mapping \(z\rightarrow z^{2}-\mu \) for complex \(\mu \) and \(z\): the fractal structure of its set, and scaling
Cited In (19)
- Newton-ellipsoid polynomiography
- Newton's method in practice: finding all roots of polynomials of degree one million efficiently
- Bisheh-Niasar-Saadatmandi root finding method via the \(S\)-iteration with periodic parameters and its polynomiography
- A study of accelerated Newton methods for multiple polynomial roots
- Fractal patterns from the dynamics of combined polynomial root finding methods
- Polynomiography for the polynomial infinity norm via Kalantari's formula and nonstandard iterations
- Control of dynamics of the modified Newton-Raphson algorithm
- Procedural generation of aesthetic patterns from dynamics and iteration processes
- New technique for the approximation of the zeros of nonlinear scientific models
- Polynomial root-finding and polynomiography
- Polynomiography and chaos
- Newton-like methods and polynomiographic visualization of modified Thakur processes
- Newton's method with fractional derivatives and various iteration processes via visual analysis
- Newton's method on Bring-Jerrard polynomials
- Polynomiography via an iterative method corresponding to simpsons \(\frac 13\) rule
- A combined method for polynomial roots using modified Newton-Raphson with minimum searching
- Higher order methods of the basic family of iterations via \(S\)-iteration scheme with \(s\)-convexity
- The local and semilocal convergence analysis of new Newton-like iteration methods
- Title not available (Why is that?)
This page was built for publication: Polynomiography based on the nonstandard Newton-like root finding methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q305015)
