Computing the least fixed point of positive polynomial systems
DOI10.1137/090749591zbMATH Open1213.65076OpenAlexW2133667894MaRDI QIDQ3068634FDOQ3068634
Authors: Javier Esparza, Stefan Kiefer, Michael Luttenberger 
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
Recommendations
- COMPUTING LEAST FIXED POINTS OF PROBABILISTIC SYSTEMS OF POLYNOMIALS
- Convergence thresholds of Newton's method for monotone polynomial equations
- Upper bounds for Newton's method on monotone polynomial systems, and P-time model checking of probabilistic one-counter automata
- Approximative Methods for Monotone Systems of Min-Max-Polynomial Equations
- ON NEWTON'S METHOD FOR SOLVING A SYSTEM OF NONLINEAR MATRIX EQUATIONS
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)
Cited In (16)
- Model Checking Temporal Properties of Recursive Probabilistic Programs
- A convex programming approach to solve posynomial systems
- On probabilistic parallel programs with process creation and synchronisation
- Polynomial time algorithms for branching Markov decision processes and probabilistic min(max) polynomial Bellman equations
- Upper bounds for Newton's method on monotone polynomial systems, and P-time model checking of probabilistic one-counter automata
- A polynomial time algorithm for computing extinction probabilities of multitype branching processes
- Computing the smallest fixed point of order-preserving nonexpansive mappings arising in positive stochastic games and static analysis of programs
- Convergence thresholds of Newton's method for monotone polynomial equations
- Runtime analysis of probabilistic programs with unbounded recursion
- Recursive Markov decision processes and recursive stochastic games
- Computing real witness points of positive dimensional polynomial systems
- COMPUTING LEAST FIXED POINTS OF PROBABILISTIC SYSTEMS OF POLYNOMIALS
- Multiplicative updates for polynomial root finding
- Certificates for probabilistic pushdown automata via optimistic value iteration
- Approximative Methods for Monotone Systems of Min-Max-Polynomial Equations
- Runtime analysis of probabilistic programs with unbounded recursion
Uses Software
This page was built for publication: Computing the least fixed point of positive polynomial systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3068634)
