Convergence of Newton's Method over Commutative Semirings

3Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

Abstract

We give a lower bound on the speed at which Newton's method (as defined in [11]) converges over arbitrary ω-continuous commutative semirings. From this result, we deduce that Newton's method converges within a finite number of iterations over any semiring which is "collapsed at some kεN" (i.e. k=k+1 holds) in the sense of Bloom and Ésik [2]. We apply these results to (1) obtain a generalization of Parikh's theorem, (2) compute the provenance of Datalog queries, and (3) analyze weighted pushdown systems. We further show how to compute Newton's method over any ω-continuous semiring by constructing a grammar unfolding w.r.t. "tree dimension". We review several concepts equivalent to tree dimension and prove a new relation to pathwidth.

Cite

CITATION STYLE

APA

Luttenberger, M., & Schlund, M. (2016). Convergence of Newton’s Method over Commutative Semirings. Information and Computation, 246, 43–61. https://doi.org/10.1016/j.ic.2015.11.008

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free