Computing the Least Fixed Point of Positive Polynomial Systems

DOI10.1137/090749591zbMath1213.65076OpenAlexW2133667894MaRDI QIDQ3068634

Stefan Kiefer, Michael Luttenberger, Javier Esparza

Publication date: 17 January 2011

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/090749591

zbMATH Keywords

Newton's methodpolynomial equationsconvergence speednumerical analysisfixed-point equations

Mathematics Subject Classification ID

Numerical computation of solutions to systems of equations (65H10) Specification and verification (program logics, model checking, etc.) (68Q60) Rate of convergence, degree of approximation (41A25)

Related Items (7)

Polynomial Time Algorithms for Branching Markov Decision Processes and Probabilistic Min(Max) Polynomial Bellman Equations ⋮ Model Checking Temporal Properties of Recursive Probabilistic Programs ⋮ A Polynomial Time Algorithm for Computing Extinction Probabilities of Multitype Branching Processes ⋮ On Probabilistic Parallel Programs with Process Creation and Synchronisation ⋮ Runtime Analysis of Probabilistic Programs with Unbounded Recursion ⋮ Recursive Markov Decision Processes and Recursive Stochastic Games ⋮ Runtime analysis of probabilistic programs with unbounded recursion

Uses Software

• KELLEY

This page was built for publication: Computing the Least Fixed Point of Positive Polynomial Systems