Approximative Methods for Monotone Systems of Min-Max-Polynomial Equations

DOI10.1007/978-3-540-70575-8_57MaRDI QIDQ3521959zbMATH OpenOpenAlexFDO

Authors Javier Esparza, Thomas Martin Gawlitza, Stefan Kiefer, Helmut Seidl

Publication date 28 August 2008

Published in Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-70575-8_57

Mathematics Subject Classification ID

Numerical computation of solutions to systems of equations (65H10) Stochastic games, stochastic differential games (91A15)

Recommendations

• Convergence thresholds of Newton's method for monotone polynomial equations
• COMPUTING LEAST FIXED POINTS OF PROBABILISTIC SYSTEMS OF POLYNOMIALS
• Computing the least fixed point of positive polynomial systems
• Upper bounds for Newton's method on monotone polynomial systems, and P-time model checking of probabilistic one-counter automata
• Polynomial time algorithms for branching Markov decision processes and probabilistic min(max) polynomial Bellman equations

Cited in

(12)

• A polynomial approximation scheme for problem \(F2/r_ j/C_{\text{max}}\)
• Computing the smallest fixed point of order-preserving nonexpansive mappings arising in positive stochastic games and static analysis of programs
• Recursive Markov decision processes and recursive stochastic games
• Computing the least fixed point of positive polynomial systems
• Upper bounds for Newton's method on monotone polynomial systems, and P-time model checking of probabilistic one-counter automata
• Newton’s Method for ω-Continuous Semirings
• Tropical linear-fractional programming and parametric mean payoff games
• scientific article; zbMATH DE number 1754587 (Why is no real title available?)
• scientific article; zbMATH DE number 917856 (Why is no real title available?)
• Convergence thresholds of Newton's method for monotone polynomial equations
• Polynomial time algorithms for branching Markov decision processes and probabilistic min(max) polynomial Bellman equations
• Mathematical Foundations of Computer Science 2005

This page was built for publication: Approximative Methods for Monotone Systems of Min-Max-Polynomial Equations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3521959)