Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Computing the Newtonian graph

From MaRDI portal
Publication:1368688
Jump to:navigation, search

DOI10.1006/jsco.1997.0118zbMath0885.65055OpenAlexW1972455525MaRDI QIDQ1368688

Dexter Kozen, Kjartan Stefánsson

Publication date: 20 April 1998

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

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


zbMATH Keywords

Newton's iterationalgebraic algorithmNewton'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)


Related Items (2)

Geometry of polynomials and root-finding via path-lifting ⋮ On sectional Newtonian graphs




This page was built for publication: Computing the Newtonian graph

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1368688&oldid=13509975"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 14:58.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki