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

Convergence Thresholds of Newton's Method for Monotone Polynomial Equations

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

DOI10.4230/LIPIcs.STACS.2008.1351zbMath1259.65225arXiv0802.2856MaRDI QIDQ4910727

Stefan Kiefer, Michael Luttenberger, Javier Esparza

Publication date: 19 March 2013

Full work available at URL: https://arxiv.org/abs/0802.2856


zbMATH Keywords

Newton's methodfixed-point equationsprobabilistic pushdown systemsformal verification of software


Mathematics Subject Classification ID

Numerical computation of solutions to systems of equations (65H10) Complexity and performance of numerical algorithms (65Y20) Numerical computation of roots of polynomial equations (65H04)


Related Items (5)

Stochastic Process Creation ⋮ Space-efficient scheduling of stochastically generated tasks ⋮ Newton’s Method for ω-Continuous Semirings ⋮ Runtime Analysis of Probabilistic Programs with Unbounded Recursion ⋮ Runtime analysis of probabilistic programs with unbounded recursion




This page was built for publication: Convergence Thresholds of Newton's Method for Monotone Polynomial Equations

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