Convergence of Newton's method over commutative semirings

DOI10.1016/J.IC.2015.11.008MaRDI QIDQ899320zbMATH OpenOpenAlexFDO

Authors Michael Luttenberger, Maximilian Schlund

Publication date 28 December 2015

Published in Information and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ic.2015.11.008

zbMATH Keywords

Newton's methodsemiringsalgebraic language theoryHorton-Strahler numberpolynomial fixed-point equations

Mathematics Subject Classification ID

Algebraic theory of languages and automata (68Q70)

Recommendations

• Convergence of Newton’s Method over Commutative Semirings
• Putting Newton into practice: a solver for polynomial equations over semirings
• An Extension of Newton’s Method to ω-Continuous Semirings
• Newton’s Method for ω-Continuous Semirings
• Newtonian program analysis

Cites work

• scientific article; zbMATH DE number 4205991 (Why is no real title available?)
• scientific article; zbMATH DE number 1286205 (Why is no real title available?)
• scientific article; zbMATH DE number 941396 (Why is no real title available?)
• scientific article; zbMATH DE number 1916666 (Why is no real title available?)
• A Generic Approach to the Static Analysis of Concurrent Programs with Procedures
• A lattice-theoretical fixpoint theorem and its applications
• A simple linear-time algorithm for finding path-decompositions of small width
• Algorithms for combinatorial structures: well-founded systems and Newton iterations
• An Extension of Newton’s Method to ω-Continuous Semirings
• Automated Deduction – CADE-20
• Axiomatizing rational power series over natural numbers
• Commutative Regular Equations and Parikh's Theorem
• Derivation-bounded languages
• Equational elements in additive algebras
• FPsolve: a generic solver for fixpoint equations over semirings
• Handbook of weighted automata
• Inclusion relations among families of context-free languages
• Newtonian program analysis
• On Etol Systems with Finite Tree-Rank
• On Fixed Point Equations over Commutative Semirings
• On programming of arithmetic operations
• PATHWIDTH AND LAYERED DRAWINGS OF TREES
• Parikh's theorem: a simple and direct automaton construction
• Quickly excluding a forest
• Recursive Markov chains, stochastic grammars, and monotone systems of nonlinear equations
• The average number of registers needed to evaluate a binary tree optimally
• The number of registers required for evaluating arithmetic expressions
• Weighted pushdown systems and their application to interprocedural dataflow analysis

Cited in

(6)

• scientific article; zbMATH DE number 7439739 (Why is no real title available?)
• Convergence thresholds of Newton's method for monotone polynomial equations
• Derivation Tree Analysis for Accelerated Fixed-Point Computation
• Solving non-linear Horn clauses using a linear Horn clause solver
• Convergence of Newton’s Method over Commutative Semirings
• Rational index of languages with bounded dimension of parse trees

This page was built for publication: Convergence of Newton's method over commutative semirings

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