Add to ORKGThe aim of this paper is to study the roots of interval polynomials. The characterization of such roots is given and an algorithm is developed for computing the interval roots of quadratic polynomials with interval coefficients
In this thesis, we deal with the finding of an enclosure of the range of the real and interval polyn...
AbstractPolynomials with perturbed coefficients, which can be regarded as interval polynomials, are ...
this paper is twofold: firstly to demonstrate how Maple is capable of dealing with these two strateg...
AbstractIn this paper, we develop a rigorous algorithm for counting the real interval zeros of polyn...
Abstract. In a recent article, a complete discrimination system was given for a polynomial with symb...
AbstractThis paper presents new necessary and sufficient conditions for a family of interval polynom...
We present a new algorithm for refining a real interval containing a single real root: the new met...
We consider the problem of approximating all real roots of a square-free polyno-mial f with real coe...
AbstractSystems of algebraic equations with interval coefficients are very common in several areas o...
We present a new algorithm for refining a real interval containing a single real root: the new met...
In this paper, our main interest is to create/ construct a new useful and outstanding algorithm to o...
Systems of algebraic equations with interval coefficients are very common in several areas of engine...
This work addresses the problem of computing a certified ε-approximation of all real roots of a squa...
This work addresses the problem of computing a certified ε-approximation of all real roots of a squa...
In this paper we propose two algorithms based on branch and bound method and reduced interval tec...
In this thesis, we deal with the finding of an enclosure of the range of the real and interval polyn...
AbstractPolynomials with perturbed coefficients, which can be regarded as interval polynomials, are ...
this paper is twofold: firstly to demonstrate how Maple is capable of dealing with these two strateg...
AbstractIn this paper, we develop a rigorous algorithm for counting the real interval zeros of polyn...
Abstract. In a recent article, a complete discrimination system was given for a polynomial with symb...
AbstractThis paper presents new necessary and sufficient conditions for a family of interval polynom...
We present a new algorithm for refining a real interval containing a single real root: the new met...
We consider the problem of approximating all real roots of a square-free polyno-mial f with real coe...
AbstractSystems of algebraic equations with interval coefficients are very common in several areas o...
We present a new algorithm for refining a real interval containing a single real root: the new met...
In this paper, our main interest is to create/ construct a new useful and outstanding algorithm to o...
Systems of algebraic equations with interval coefficients are very common in several areas of engine...
This work addresses the problem of computing a certified ε-approximation of all real roots of a squa...
This work addresses the problem of computing a certified ε-approximation of all real roots of a squa...
In this paper we propose two algorithms based on branch and bound method and reduced interval tec...
In this thesis, we deal with the finding of an enclosure of the range of the real and interval polyn...
AbstractPolynomials with perturbed coefficients, which can be regarded as interval polynomials, are ...
this paper is twofold: firstly to demonstrate how Maple is capable of dealing with these two strateg...