Computing the Newtonian graph
In his study of Newton's root approximation method, \textit{S. Smale} [Bull. Am. Math. Sco., New Ser. 13, 87-121 (1985; Zbl 0592.65032)] defined the Newtonian graph of a complex univariate polynomial \(f\). The vertices of this graph are the roots of \(f\) and \(f'\) and the edges are the degenerate curves of flow of the Newtonian vector field \(N_f(z)= -f(z)/f'(z)\). The embedded edges of this graph form the boundaries of the basins of the roots with respect, to Newton's vector field. The paper is concerned with an algebraic algorithm based on cell decomposition to compute the graph. The answer to the question whether two points belong to the same basin is related to the question whether one crosses the boundary of a basin during Newton's iteration. \{Remark: A lemma which is cited as being due to Shub (1988) was actually published in [Numer. Math. 29, 123-132 (1977; Zbl 0363.65033)] by the reviewer\}.
- 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
- 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)