On the convergence of Newton's method for monotone systems of polynomial equations

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2007, Pages 217-226

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

^a UNIVERSITY OF STUTTGART   (Germany)

Author keywords

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

Indexed keywords

CONVERGENCE OF NUMERICAL METHODS; NEWTON-RAPHSON METHOD; PROBABILISTIC LOGICS; RANDOM PROCESSES;

FIXED-POINT EQUATIONS; FORMAL VERIFICATION; MONOTONE SYSTEMS; PROBABILISTIC PUSHDOWN SYSTEMS;

POLYNOMIAL APPROXIMATION;

EID: 35448972095     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1250790.1250822     Document Type: Conference Paper

References (25)

1. 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.
2. D.W. Decker and CT. Kelley. Newton's method at singular points I. SIAM Journal on Numerical Analysis, 17(1):66-70, 1980.
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. On fixed point equations over commutative semirings. In Proceedings of STACS, LNCS 4397, pages 296-307, 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. Springer, 2005.
12. K. Etessami and M. Yannakakis. Recursive Markov chains, stochastic grammars, 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. A. Griewank and M.R. Osborne. Newton's method for singular problems when the dimension of the null space is > 1. SIAM Journal on Numerical Analysis, 18(1):145-149, 1981.
17. C.T. Kelley. Iterative Methods for Linear and Nonlinear Equations. SIAM, 1995.
18. B. Knudsen and J. Hein. Pfold: RNA secondary structure prediction using stochastic context-free grammars. Nucleic Acids Research, 31(13):3423-3428, 2003.
19. 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.
20. C. Manning and H. Schütze. Foundations of Statistical Natural Language Processing. MIT Press, 1999.
21. J.M. Ortega. Numerical Analysis: A Second Course. Academic Press, New York, 1972.
22. J.M. Ortega and W.C. Rheinboldt. Iterative solution of nonlinear equations in several variables. Academic Press, 1970.
23. F.A. Potra and V. Pták. Sharp error bounds for Newton's process. Numerische Mathematik, 34(1):63-72, 1980.
24. G.W. Reddien. On Newton's method for singular problems. SIAM Journal on Numerical Analysis, 15:993-996, 1978.
25. Y. Sakabikara, M. Brown, R. Hughey, I.S. Mian, K. Sjolander, R. C. Underwood, and D. Haussler. Stochastic context-free grammars for tR-NA. Nucleic-Acids Research, 22:5112-5120, 1994.