Polynomiography based on the nonstandard Newton-like root finding methods
From MaRDI portal
(Redirected from Publication:305015)
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
- scientific article; zbMATH DE number 5154873 (Why is no real title available?)
- scientific article; zbMATH DE number 194082 (Why is no real title available?)
- scientific article; zbMATH DE number 5053484 (Why is no real title available?)
- A Picard-Mann hybrid iterative process
- A new approach to superfractals
- Fixed Points by a New Iteration Method
- Fixed point of a new three-step iteration algorithm under contractive-like operators over normed spaces
- Iterative approximation of fixed points
- Julia sets and Mandelbrot sets in Noor orbit
- Mean Value Methods in Iteration
- Multipoint iterative methods for finding all the simple zeros in an interval
- Multipoint methods for solving nonlinear equations: a survey
- New approximation schemes for general variational inequalities
- On the quadratic mapping \(z\rightarrow z^{2}-\mu \) for complex \(\mu \) and \(z\): the fractal structure of its set, and scaling
- On the rate of convergence of Mann, Ishikawa, Noor and SP-iterations for continuous functions on an arbitrary interval
- Polynomial root-finding and polynomiography
- Weak and strong convergence criteria of Noor iterations for asymptotically nonexpansive mappings
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's method on Bring-Jerrard polynomials
- Newton's method with fractional derivatives and various iteration processes via visual analysis
- Newton-like methods and polynomiographic visualization of modified Thakur processes
- 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
- scientific article; zbMATH DE number 6450758 (Why is no real title available?)
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)
