Computing the least fixed point of positive polynomial systems

SIAM Journal on Computing

Volumn 39, Issue 6, 2010, Pages 2282-2335

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

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

Convergence speed; Fixed point equations; Newton's method; Numerical analysis; Polynomial equations

Indexed keywords

CONVERGENCE SPEED; FIXED POINT EQUATION; NEWTON'S METHOD; NEWTON'S METHODS; POLYNOMIAL EQUATION;

BIOINFORMATICS; BIOLOGY; COMPUTATIONAL LINGUISTICS; CONTEXT FREE LANGUAGES; CONVERGENCE OF NUMERICAL METHODS; NATURAL LANGUAGE PROCESSING SYSTEMS; NUMERICAL ANALYSIS; POLYNOMIALS; PROGRAM INTERPRETERS; STOCHASTIC MODELS; STOCHASTIC SYSTEMS; SURFACE PLASMON RESONANCE;

NEWTON-RAPHSON METHOD;

EID: 77952268077     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/090749591     Document Type: Article

References (35)

1. E. ALLENDER, P. BüRGISSER, J. KjELDGAARD-PEDERSEN, AND P. B. MlLTERSEN, On the complexity of numerical analysis, SIAM J. Comput., 38 (2009), pp. 1987-2006.
2. K. ATHREYA AND P. Ney, Branching Processes, Springer-Verlag, New York, 1972.
3. A. BERMAN AND R. PLEMMONS, Nonnegative Matrices in the Mathematical Sciences,Academic Press, New York, 1979.
4. T. BRáZDIL, A. KǔCERA, AND O. STRAŽOVSKÝ, On the decidability of temporal properties of probabilistic pushdown automata, in Proceedings of the 22nd Symposium on Theoretical Aspects of Computer Science (STACS'2005), Lecture Notes in Comput. Sci. 3404, Springer- Verlag, Berlin, 2005, pp. 145-157.
5. D. W. DECKER AND C. T. KELLEY, Newton's method at singular points. I, SIAM J. Numer. Anal., 17 (1980), pp. 66-70.
6. R. DOWELL AND S. EDDY, Evaluation of several lightweight stochastic context-free grammars for RNA secondary structure prediction, BMC Bioinformatics, 5 (2004), article 71.
7. R. DURBIN, S. EDDY, A. KROGH, AND G. MICHISON, Biological Sequence Analysis: Probabilistic Models of Proteins and Nucleic Acids, Cambridge University Press, Cambridge, UK, 1998.
8. J. ESPARZA, A. GAISER, AND S. KIEFER, Computing least fixed points of probabilistic systems of polynomials, in Proceedings of the 27th International Symposium on Theoretical Aspects of Computer Science (STACS'2010), Schloss Dagstuhl-Leibniz-Zentrum für Informatik, Dagstuhl, Germany, 2010, pp. 359-370.
9. J. ESPARZA, S. KIEFER, AND M. LüTTENBERGER, Convergence thresholds of Newton's method for monotone polynomial equations, in Proceedings of the 27th International Symposium on Theoretical Aspects of Computer Science (STACS'2008), 2008, pp. 289-300.
10. J. ESPARZA, S. KIEFER, AND M. LüTTENBERGER, Computing the Least Fixed Point of Positive Polynomial Systems, Technical report, Technische Universität München, 2010; available online at http://arxiv.org/abs/ 1001.0340.
11. J. ESPARZA, A. KUČERA, AND R. MAYR, Model-checking probabilistic pushdown automata,in Proceedings of the 19th IEEE Symposium on Logic in Computer Science (LICS 2004), IEEE Computer Society Press, Los Alamitos, CA, 2004, pp. 12-21.
12. J. ESPARZA, A. KUČERA, AND R. MAYR, Quantitative analysis of probabilistic pushdown automata: Expectations and variances, in Proceedings of the 20th IEEE Symposium on Logic in Computer Science (LICS 2005), IEEE Computer Society Press, Los Alamitos, CA, 2005, pp. 117-126.
13. K. ETESSAMI AND M. YANNAKAKIS, Algorithmic verification of recursive probabilistic systems, in Proceedings of the 11th International Conference on Tools and Algorithms for Construction and Analysis of Systems (TACAS 2005), Lecture Notes in Comput. Sci. 3440, Springer-Verlag, Berlin, 2005, pp. 253-270.
14. K. ETESSAMI AND M. YANNAKAKIS, Checking LTL properties of recursive Markov chains,in Proceedings of the 2nd International Conference on Quantitative Evaluation of Systems (QEST'05), IEEE Computer Society Press, Washington, DC, 2005, pp. 155-165.
15. K. ETESSAMI AND M. YANNAKAKIS, Recursive Markov decision processes and recursive stochastic games, in Proceedings of the 32nd International Colloquium on Automata, Languages and Programming (ICALP 2005), Lecture Notes in Comput. Sci. 3580, Springer-Verlag, Berlin, 2005, pp. 891-903.
16. K. ETESSAMI AND M. YANNAKAKIS, Recursive Markov chains, stochastic grammars, and monotone systems of nonlinear equations, J. ACM, 56 (2009), pp. 1-66.
17. R. Fagin, A. Karlin, J. Kleinberg, P. Raghavan, S. Rajagopalan, R. Rubinfeld, M. Sudan, AND A. TOMKINS, Random walks with "back buttons" (extended abstract),in Proceedings of the 32nd Annual ACM Symposium on Theory of Computing (STOC 2000), ACM, New York, 2000, pp. 484-493.
18. R. Fagin, A. Karlin, J. Kleinberg, P. Raghavan, S. Rajagopalan, R. Rubinfeld, M. Sudan, AND A. TOMKINS, Random walks with "back buttons", Ann. Appl. Probab., 11 (2001), pp. 810-862.
19. S. GEMAN AND M. JOHNSON, Probabilistic Grammars and Their Applications, in International Encyclopedia of the Social & Behavioral Sciences, N. J. Smelser and P. B. Baltes, eds., Pergamon, Oxford, 2002, pp. 12075-12082.
20. A. GRIEWANK AND M. R. OSBORNE, Newton's method for singular problems when the dimension of the null space is > 1, SIAM J. Numer. Anal., 18 (1981), pp. 145-149.
21. T. HARRIS, The Theory of Branching Processes, Springer-Verlag, Berlin, 1963.
22. R. Horn AND C. JOHNSON, Topics in Matrix Analysis, Cambridge University Press, Cambridge, UK, 1991.
23. C. T. Kelley, Iterative Methods for Linear and Nonlinear Equations, SIAM, Philadelphia, 1995.
24. S. KIEFER, M. LUTTENBERGER, AND J. ESPARZA, On the convergence of Newton's method for monotone systems of polynomial equations, in Proceedings of the 39th Annual ACM Symposium on Theory of Computing (STOC 2007), ACM, New York, 2007, pp. 217-226.
25. B. KNUDSEN AND J. HEIN, Pfold: RNA secondary structure prediction using stochastic context- free grammars, Nucleic Acids Res., 31 (2003), pp. 3423-3428.
26. W. KUICH, Semirings and formal power series: Their relevance to formal languages and automata, in Handbook of Formal Languages, Vol.1, Springer-Verlag, Berlin, 1997, Chap. 9, pp. 609-677.
27. P. LANCASTER AND M. TlSMENETSKY, The Theory of Matrices, 2nd ed., Academic Press, New York, 1985.
28. C. MANNING AND H. SCHÜTZE, Foundations of Statistical Natural Language Processing,MIT Press, Cambridge, MA, 1999.
29. J. ORTEGA, Numerical Analysis: A Second Course, Academic Press, New York, 1972.
30. J. ORTEGA AND W. RHEINBOLDT, Iterative Solution of Nonlinear Equations in Several Variables, Academic Press, New York, 1970.
31. F. POTRA AND V. PTAK, Sharp error bounds for Newton's process, Numer. Math., 34 (1980), pp. 63-72.
32. G. W. REDDIEN, On Newton's method for singular problems, SIAM J. Numer. Anal., 15 (1978), pp. 993-996.
33. Y. SAKABIKARA, M. BROWN, R. HUGHEY, I. MIAN, K. SJOLANDER, R. UNDERWOOD, AND D. HAUSSLER, Stochastic context-free grammars for tRNA, Nucleic Acids Res., 22 (1994), pp. 5112-5120.
34. E. SÜLI AND D. MAYERS, An Introduction to Numerical Analysis, Cambridge University Press, Cambridge, UK, 2003.
35. H. WATSON AND F. GALTON, On the probability of the extinction of families, J. Anthropol. Inst. Great Britain and Ireland, 4 (1874), pp. 138-144.