Computing the Newtonian graph

DOI10.1006/JSCO.1997.0118MaRDI QIDQ1368688zbMATH OpenOpenAlexFDO

Authors Dexter Kozen, Kjartan Stefánsson

Publication date 20 April 1998

Published in Journal of Symbolic Computation (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Full work available at URL https://doi.org/10.1006/jsco.1997.0118

zbMATH Keywords

algebraic algorithmNewton's iterationNewton's root approximation methodNewton's vector fieldNewtonian graphShub's lemma

Mathematics Subject Classification ID

Topological dynamics (37B99) Numerical computation of solutions to single equations (65H05)

Recommendations

• Computer realization of the method of Newton diagrams
• Computing the Newton polygon of the implicit equation
• Computation and applications of the Newton polyhedrons
• Newton polygons and Newton algorithms
• The Newtonian Graph of a Complex Polynomial
• Newton's Method and the Wada Property: A Graphical Approach
• Generalized Newton's method based on graphical derivatives
• Newtonian graphs for families of complex polynomials
• scientific article; zbMATH DE number 3466442

Cited in

(7)

• Newtonian graphs for families of complex polynomials
• On the classification of plane graphs representing structurally stable rational Newton flows
• scientific article; zbMATH DE number 4031715 (Why is no real title available?)
• The Newtonian Graph of a Complex Polynomial
• Geometry of polynomials and root-finding via path-lifting
• On sectional Newtonian graphs.
• Graphical representations for the homogeneous bivariate Newton's method

This page was built for publication: Computing the Newtonian graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1368688)