Convergence thresholds of Newton's method for monotone polynomial equations

Proceedings of the 25th International Symposium on Theoretical Aspects of Computer Science, STACS 2008

Volumn , Issue , 2008, Pages 289-300

  Esparza, Javier ^a   Kiefer, Stefan ^a   Luttenberger, Michael ^a  

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

Fixed point equations; Formal verification of software; Newton's method; Probabilistic pushdown systems

Indexed keywords

AUTOMATA THEORY; CONTEXT FREE GRAMMARS; NEWTON-RAPHSON METHOD; POLYNOMIALS; STOCHASTIC MODELS; STOCHASTIC SYSTEMS; VERIFICATION;

FIXED POINT EQUATION; MONOTONE POLYNOMIALS; NEWTON'S METHODS; NON-NEGATIVE SOLUTIONS; PROBABILISTIC PUSHDOWN SYSTEMS; STOCHASTIC CONTEXT FREE GRAMMAR; STRONGLY CONNECTED COMPONENT; VERIFICATION OF SOFTWARES;

ITERATIVE METHODS;

EID: 45749104075     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (21)

1. L. Blum, M. Shub, and S. Smale. On a theory of computation and complexity over the real numbers: NP-completeness, recursive functions and universal machines. Bulletin of the Amer. Math. Society, 21(1):1-46, 1989.
2. T. Brázdil, A. Kučera, and O. Stražovský. On the decidability of temporal properties of probabilistic pushdown automata. In Proceedings of STACS'2005, volume 3404 of LNCS, pages 145-157. Springer, 2005.
3. R.D. Dowell and S.R. Eddy. Evaluation of several lightweight stochastic context-free grammars for RNA secondary structure prediction. BMC Bioinformatics, 5(71), 2004.
4. R. Durbin, S.R. Eddy, A. Krogh, and G.J. Michison. Biological Sequence Analysis: Probabilistic Models of Proteins and Nucleic Acids. Cambridge University Press, 1998.
5. J. Esparza, S. Kiefer, and M. Luttenberger. Convergence thresholds of Newton's method for monotone polynomial equations. Technical report, Technische Universität München, 2007.
6. J. Esparza, A. Kučera, and R. Mayr. Model-checking probabilistic pushdown automata. In Proceedings of LICS 2004, pages 12-21, 2004.
7. J. Esparza, A. Kučera, and R. Mayr. Quantitative analysis of probabilistic pushdown automata: Expectations and variances. In Proceedings of LICS 2005, pages 117-126. IEEE Computer Society Press, 2005.
8. K. Etessami and M. Yannakakis. Algorithmic verification of recursive probabilistic systems. In Proceedings of TACAS 2005, LNCS 3440, pages 253-270. Springer, 2005.
9. K. Etessami and M. Yannakakis. Checking LTL properties of recursive Markov chains. In Proceedings of 2nd Int. Conf. on Quantitative Evaluation of Systems (QEST'05), 2005.
10. K. Etessami and M. Yannakakis. Recursive Markov chains, stochastic grammars, and monotone systems of nonlinear equations. In STACS, pages 340-352, 2005.
11. K. Etessami and M. Yannakakis. Recursive Markov decision processes and recursive stochastic games. In Proceedings of ICALP 2005, volume 3580 of LNCS, pages 891-903. Springer, 2005.
12. K. Etessami and M. Yannakakis. Recursive Markov chains, stochastic grammar's, and monotone systems of nonlinear equations, 2006. Draft journal submission, http://homepages.inf.ed.ac.uk/kousha/bib_index.html.
13. R. Fagin, A.R. Karlin, J. Kleinberg, P. Raghavan, S. Rajagopalan, R. Rubinfeld, M. Sudan, and A. Tomkins. Random walks with "back buttons" (extended abstract). In STOC, pages 484-493, 2000.
14. R. Fagin, A.R. Karlin, J. Kleinberg, P. Raghavan, S. Rajagopalan, R. Rubinfeld, M. Sudan, and A. Tomkins. Random walks with "back buttons". Annals of Applied Probability, 11(3):810-862, 2001.
15. S. Geman and M. Johnson. Probabilistic grammars and their applications, 2002.
16. S. Kiefer, M. Luttenberger, and J. Esparza. On the convergence of Newton's method for monotone systems of polynomial equations. In Proceedings of STOC, pages 217-226. ACM, 2007.
17. B. Knudsen and J. Hein. Pfold: RNA secondary structure prediction using stochastic context-free grammars. Nucleic Acids Research, 31(13):3423-3428, 2003.
18. W. Kuich. Handbook of Formal Languages, volume 1, chapter 9: Semirings and Formal Power Series: Their Relevance to Formal Languages and Automata, pages 609 - 677. Springer, 1997.
19. C. Manning and H. Schütze. Foundations of Statistical Natural Language Processing. MIT Press, 1999.
20. J.M. Ortega and W.C. Rheinboldt. Iterative solution of nonlinear equations in several variables. Academic Press, 1970.
21. Y. Sakabikara, M. Brown, R. Hughey, I.S. Mian, K. Sjolander, R.C. Underwood, and D. Haussler. Stochastic context-free grammars for tRNA. Nucleic Acids Research, 22:5112-5120, 1994.