scientific article

Publication date: 4 December 2008

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Numerical computation of solutions to single equations (65H05) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to dynamical systems and ergodic theory (37-01) Real polynomials: location of zeros (26C10) Dynamics of complex polynomials, rational maps, entire and meromorphic functions; Fatou and Julia sets (37F10) Numerical computation of roots of polynomial equations (65H04) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to numerical analysis (65-01) Mathematics and visual arts (00A66)

Related Items (54)

Newton-like methods and polynomiographic visualization of modified Thakur processes ⋮ New escape criteria for complex fractals generation in Jungck-CR orbit ⋮ An iteration process for a general class of contractive-like operators: convergence, stability and polynomiography ⋮ A variant of Steffensen-King's type family with accelerated sixth-order convergence and high efficiency index: dynamic study and approach ⋮ Characterization of local optima of polynomial modulus over a disc ⋮ Polynomiography based on the nonstandard Newton-like root finding methods ⋮ The Weierstrass–Durand–Kerner root finder is not generally convergent ⋮ A note on determinantal representation of a Schröder-König-like simultaneous method for finding polynomial zeros ⋮ Dynamic study of Schröder's families of first and second kind ⋮ New optimal fourth-order iterative method based on linear combination technique ⋮ Efficient optimal eighth-order derivative-free methods for nonlinear equations ⋮ Fractal patterns from the dynamics of combined polynomial root finding methods ⋮ Computational geometry as a tool for studying root-finding methods ⋮ Nonlinear embeddings: applications to analysis, fractals and polynomial root finding ⋮ On generalized Halley-like methods for solving nonlinear equations ⋮ New technique for the approximation of the zeros of nonlinear scientific models ⋮ Computers in mathematical research: the study of three-point root-finding methods ⋮ Regions of convergence and dynamics of Schröder-like iteration formulae as applied to complex polynomial equations with multiple roots ⋮ Prescribed cycles of König's method for polynomials ⋮ On optimal fourth-order iterative methods free from second derivative and their dynamics ⋮ The link on extraneous non-repelling cycles of Schröder's methods of the first and second kind ⋮ A new optimal root-finding iterative algorithm: local and semilocal analysis with polynomiography ⋮ A note on a faster fixed point iterative method ⋮ Algorithms for quaternion polynomial root-finding ⋮ Control of dynamics of the modified Newton-Raphson algorithm ⋮ A note on the modified super-Halley method ⋮ New class of eighth-order iterative zero-finders and their basins of attraction ⋮ Polynomial and rational approximations and the link between Schröder's processes of the first and second kind ⋮ Applications of higher-order optimal Newton secant iterative methods in ocean acidification and investigation of long-run implications of \(CO_{2}\) emissions on alkalinity of seawater ⋮ Newton's method with fractional derivatives and various iteration processes via visual analysis ⋮ Higher-order root-finding algorithms and their basins of attraction ⋮ Symbolic computation and computer graphics as tools for developing and studying new root-finding methods ⋮ Computer visualization and dynamic study of new families of root-solvers ⋮ Polynomiography for the polynomial infinity norm via Kalantari's formula and nonstandard iterations ⋮ On the Kung-Traub conjecture for iterative methods for solving quadratic equations ⋮ Symmetries of the Julia sets of König's methods for polynomials ⋮ Multipoint methods for solving nonlinear equations: a survey ⋮ Higher order methods for nonlinear equations and their basins of attraction ⋮ Characterization and enumeration of good punctured polynomials over finite fields ⋮ Bisheh-Niasar-Saadatmandi root finding method via the \(S\)-iteration with periodic parameters and its polynomiography ⋮ Polynomial root-finding methods whose basins of attraction approximate Voronoi diagram ⋮ Unnamed Item ⋮ Computer methodologies for comparison of computational efficiency of simultaneous methods for finding polynomial zeros ⋮ Finite pairs of prescribed cycles of König's and Steffensen's methods for entire functions ⋮ On an application of symbolic computation and computer graphics to root-finders: the case of multiple roots of unknown multiplicity ⋮ Newton–Ellipsoid polynomiography ⋮ Higher order methods of the basic family of iterations via \(S\)-iteration scheme with \(s\)-convexity ⋮ Unnamed Item ⋮ Comparing two techniques for developing higher order two-point iterative methods for solving quadratic equations ⋮ Estimating convergence regions of Schröder's iteration formula: how the Julia set shrinks to the Voronoi boundary ⋮ Multipoint iterative methods for finding all the simple zeros in an interval ⋮ How many real attractive fixed points can a polynomial have? ⋮ Computer tools for the construction and analysis of some efficient root-finding simultaneous methods ⋮ An optimal thirty-second-order iterative method for solving nonlinear equations and a conjecture

This page was built for publication: