Newton–Ellipsoid polynomiography

DOI10.1080/17513472.2019.1600959zbMath1428.00028OpenAlexW2955785783MaRDI QIDQ5210609

Bahman Kalantari, Eric Hans Lee

Publication date: 21 January 2020

Published in: Journal of Mathematics and the Arts (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/17513472.2019.1600959

zbMATH Keywords

polynomialsNewton methodpolynomiographyellipsoid methodmathematical art

Mathematics Subject Classification ID

Numerical computation of solutions to single equations (65H05) Dynamical systems over complex numbers (37F99) Mathematics and visual arts (00A66)

Related Items (2)

Numerical algorithms for finding zeros of nonlinear equations and their dynamical aspects ⋮ Higher-order root-finding algorithms and their basins of attraction

Cites Work

• Polynomiography based on the nonstandard Newton-like root finding methods
• Polynomial root-finding methods whose basins of attraction approximate Voronoi diagram
• Fractal patterns from the dynamics of combined polynomial root finding methods
• S-iteration scheme and polynomiography
• Feature Article—The Ellipsoid Method: A Survey
• Solving a Polynomial Equation: Some History and Recent Progress
• An infinite family of bounds on zeros of analytic functions and relationship to Smale’s bound
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Newton–Ellipsoid polynomiography