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

On the convergence of Newton's method

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

DOI10.1016/0885-064X(89)90010-1zbMath0675.65038MaRDI QIDQ1122312

Joel Friedman

Publication date: 1989

Published in: Journal of Complexity (Search for Journal in Brave)


zbMATH Keywords

Newton's methodzeros of a functionworst-case density


Mathematics Subject Classification ID

Numerical computation of solutions to single equations (65H05)


Related Items (3)

How to be sure of finding a root of a complex polynomial using Newton's method ⋮ Partial fraction decomposition in \(\mathbb{C}(z)\) and simultaneous Newton iteration for factorization in \(\mathbb{C}^{[z}\)] ⋮ The Turing closure of an Archimedean field



Cites Work

  • On the efficiency of algorithms of analysis




This page was built for publication: On the convergence of Newton's method

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1122312&oldid=13166267"
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 02:51.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki