Abstract: We consider the discriminant set of a real polynomial, i.e. the set of all the points of coefficient space at which the polynomial has multiple zeroes. The constructive algorithm of computation of polynomial representation of the discriminant set is provided. The structure of the discriminant set is linked with the problems of natural numbers partitions. Different algorithms of computation of subdiscriminants of the polynomial are discussed as well. The main algorithms, described in the preprint, are organized as a library for the computer algebra system Maple.Note: Research direction:Mathematical modelling in actual problems of science and technic
AbstractWe consider the task of partitioning the zeros of a real or complex polynomial into clusters...
Computing the real roots of a polynomial is a fundamental problem of computational algebra. We descr...
Article dans revue scientifique avec comité de lecture.We review the different techniques known for ...
Abstract: We consider a certain generalization of discriminant of a real polynomial, defin...
International audienceClassifying the Perspective-Three-Point problem (abbreviated by P3P in the seq...
Abstract: We consider the resonance set of a real polynomial, i.e. the set of all the poin...
Consider a parametric system of n polynomial equations and r polynomial inequations in n unknowns an...
AbstractAn explicit criterion for the determination of the numbers and multiplicities of the real/im...
AbstractAn improved algorithm, together with its implementation, is presented for the automatic comp...
International audienceThe pseudozero set of a system P of polynomials in n variables is the subset o...
AbstractIn this paper, algorithms to enumerate and isolate complex polynomial roots are developed, a...
International audienceThe problem of describing the solutions of a polynomial system appears in many...
Solving polynomial systems is an active research area located betweencomputer sciences and mathemati...
This paper is concerned with the study of the measure of an univariate polynomial. We present a coll...
The pseudozero set of a system f of polynomials in n complex variables is the subset of Cn which is ...
AbstractWe consider the task of partitioning the zeros of a real or complex polynomial into clusters...
Computing the real roots of a polynomial is a fundamental problem of computational algebra. We descr...
Article dans revue scientifique avec comité de lecture.We review the different techniques known for ...
Abstract: We consider a certain generalization of discriminant of a real polynomial, defin...
International audienceClassifying the Perspective-Three-Point problem (abbreviated by P3P in the seq...
Abstract: We consider the resonance set of a real polynomial, i.e. the set of all the poin...
Consider a parametric system of n polynomial equations and r polynomial inequations in n unknowns an...
AbstractAn explicit criterion for the determination of the numbers and multiplicities of the real/im...
AbstractAn improved algorithm, together with its implementation, is presented for the automatic comp...
International audienceThe pseudozero set of a system P of polynomials in n variables is the subset o...
AbstractIn this paper, algorithms to enumerate and isolate complex polynomial roots are developed, a...
International audienceThe problem of describing the solutions of a polynomial system appears in many...
Solving polynomial systems is an active research area located betweencomputer sciences and mathemati...
This paper is concerned with the study of the measure of an univariate polynomial. We present a coll...
The pseudozero set of a system f of polynomials in n complex variables is the subset of Cn which is ...
AbstractWe consider the task of partitioning the zeros of a real or complex polynomial into clusters...
Computing the real roots of a polynomial is a fundamental problem of computational algebra. We descr...
Article dans revue scientifique avec comité de lecture.We review the different techniques known for ...