Convergence of Newton's method over commutative semirings

DOI10.1016/J.IC.2015.11.008zbMATH Open1333.68188OpenAlexW116818910MaRDI QIDQ899320FDOQ899320

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

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

zbMATH Keywords

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

Mathematics Subject Classification ID

Algebraic theory of languages and automata (68Q70)

Cites Work

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

Cited In (5)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Derivation Tree Analysis for Accelerated Fixed-Point Computation
• 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)