Polynomial Precise Interval Analysis Revisited
نویسندگان
چکیده
We consider a class of arithmetic equations over the complete lattice of integers (extended with−∞ and∞) and provide a polynomial time algorithm for computing least solutions. For systems of equations with addition and least upper bounds, this algorithm is a smooth generalization of the Bellman-Ford algorithm for computing the single source shortest path in presence of positive and negative edge weights. The method then is extended to deal with more general forms of operations as well as minima with constants. For the latter, a controlled widening is applied at loops where unbounded increase occurs. We apply this algorithm to construct a cubic time algorithm for the class of interval equations using least upper bounds, addition, intersection with constant intervals as well as multiplication.
منابع مشابه
Interval Methods Revisited
This paper presents a branch & cut algorithm to nd all isolated solutions of a system of polynomial constraints. Our ndings show that fairly straightforward reenements of interval methods inspired by AI constraint propagation techniques result in a multivariate root nding algorithm that is competitive with continuation methods on most benchmarks and which can solve a variety of systems that are...
متن کاملTenacity and some other Parameters of Interval Graphs can be computed in polynomial time
In general, computation of graph vulnerability parameters is NP-complete. In past, some algorithms were introduced to prove that computation of toughness, scattering number, integrity and weighted integrity parameters of interval graphs are polynomial. In this paper, two different vulnerability parameters of graphs, tenacity and rupture degree are defined. In general, computing the tenacity o...
متن کاملA Class of Polynomially Solvable Range Constraints for Interval Analysis without Widenings and Narrowings
In this paper, we study the problem of solving integer range constraints that arise in many static program analysis problems. In particular, we present the first polynomial time algorithm for a general class of integer range constraints. In contrast with abstract interpretation techniques based on widenings and narrowings, our algorithm computes, in polynomial time, the optimal solution of the ...
متن کاملA class of polynomially solvable range constraints for interval analysis without widenings
In this paper, we study the problem of solving integer range constraints that arise in many static program analysis problems. In particular, we present the first polynomial time algorithm for a general class of integer range constraints. In contrast with abstract interpretation techniques based on widenings and narrowings, our algorithm computes, in polynomial time, the optimal solution of the ...
متن کاملNumerical solution for the risk of transmission of some novel coronavirus (2019-nCov) models by the Newton-Taylor polynomial solutions
In this paper we consider two type of mathematical models for the novel coronavirus (2019-nCov), which are in the form of a nonlinear differential equations system. In the first model the contact rate, , and transition rate of symptomatic infected indeviduals to the quarantined infected class, , are constant. And in the second model these quantities are time dependent. These models are the...
متن کامل