AbstractWe propose an algorithm for isolating the real solutions of semi-algebraic systems, which has been implemented as a Maple-program realzero. The performance of realzeroin solving some examples from various applications is presented and the timings are reported
AbstractThis paper is concerned with exact real solving of well-constrained, bivariate polynomial sy...
AbstractIn this paper, the author presents a new method for iteratively finding a real solution of a...
Let the polynomials f1,..., fk∈ ℤ[X1,..., Xn] have degrees deg (fi) < d and absolute value of any co...
We propose an algorithm for isolating the real solutions of semi-algebraic systems, which has been i...
AbstractWe propose an algorithm for isolating the real solutions of semi-algebraic systems, which ha...
Solving polynomial systems is an active research area located between computer sciences and mathemat...
AbstractWe present an algorithm for finding an explicit description of solution sets of systems of s...
AbstractThe paper may be considered as a supplement to the book by M. Krein and M. Naimark. Problem:...
We discuss parametric polynomial systems, with algorithms for real root classification and triangula...
International audienceLet $R$ be a real closed field. We consider basic semi-algebraic sets defined ...
We propose a complete algorithm for real solution isolation for semialgebraic systems by using inter...
AbstractWe propose a complete algorithm for real solution isolation for semialgebraic systems by usi...
Very recent work introduces an asymptotically fast subdivision algorithm, denoted ANewDsc, for isola...
In this chapter we present the moment based approach for computing all real solutions of a given sys...
Finding the solutions of a polynomial system is a fundamental problem with numerous applications in ...
AbstractThis paper is concerned with exact real solving of well-constrained, bivariate polynomial sy...
AbstractIn this paper, the author presents a new method for iteratively finding a real solution of a...
Let the polynomials f1,..., fk∈ ℤ[X1,..., Xn] have degrees deg (fi) < d and absolute value of any co...
We propose an algorithm for isolating the real solutions of semi-algebraic systems, which has been i...
AbstractWe propose an algorithm for isolating the real solutions of semi-algebraic systems, which ha...
Solving polynomial systems is an active research area located between computer sciences and mathemat...
AbstractWe present an algorithm for finding an explicit description of solution sets of systems of s...
AbstractThe paper may be considered as a supplement to the book by M. Krein and M. Naimark. Problem:...
We discuss parametric polynomial systems, with algorithms for real root classification and triangula...
International audienceLet $R$ be a real closed field. We consider basic semi-algebraic sets defined ...
We propose a complete algorithm for real solution isolation for semialgebraic systems by using inter...
AbstractWe propose a complete algorithm for real solution isolation for semialgebraic systems by usi...
Very recent work introduces an asymptotically fast subdivision algorithm, denoted ANewDsc, for isola...
In this chapter we present the moment based approach for computing all real solutions of a given sys...
Finding the solutions of a polynomial system is a fundamental problem with numerous applications in ...
AbstractThis paper is concerned with exact real solving of well-constrained, bivariate polynomial sy...
AbstractIn this paper, the author presents a new method for iteratively finding a real solution of a...
Let the polynomials f1,..., fk∈ ℤ[X1,..., Xn] have degrees deg (fi) < d and absolute value of any co...
DOI
Add to ORKG