Colloque avec actes et comité de lecture. internationale.International audienceWe generalize Wu-Ritt's algorithm for the computation of characteristic sets by means of one-step pseudo-reduction instead of pseudo-division. This generalization results in a new algorithm which, with optimal selection of reductors and heuristic generation of S-polynomials, may speed up the computation considerably and produce simpler output for large problems. Examples and experiments are provided to show the performance of our new algorithm
ABSTRACT. This paper examines the computation of polynomial greatest common divisors by various gene...
This is the first paper of a series of three papers under the same title. It presents an improved ve...
We design a fast algorithm that computes, for a given linear differential operator with coefficients...
The notion of characteristic sets, which are a special kind of triangular sets, is introduced by J. ...
AbstractWe describe an algorithm for converting a characteristic set of a prime differential ideal f...
AbstractWe propose an algorithm for transforming a characteristic decomposition of a radical differe...
We propose an algorithm for transforming a characteristic decomposition of a radical differential id...
AbstractEfficient characteristic set methods for computing zeros of polynomial equation systems in a...
International audienceWe describe an algorithm for converting a characteristic set of a prime differ...
We prove several basic properties for difference ascending chains includ-ing a necessary and suffici...
AbstractWe prove several basic properties for difference ascending chains, including a necessary and...
Abstract. We prove several basic properties for difference ascending chains including a unique repre...
This article deals with the computation of the characteristic polynomial of dense matrices over smal...
International audienceWe generalize the analog of Buchberger's first criterion, stated by Boulier et...
International audienceFor any polynomial ideal I, let the minimal triangular set contained in the re...
ABSTRACT. This paper examines the computation of polynomial greatest common divisors by various gene...
This is the first paper of a series of three papers under the same title. It presents an improved ve...
We design a fast algorithm that computes, for a given linear differential operator with coefficients...
The notion of characteristic sets, which are a special kind of triangular sets, is introduced by J. ...
AbstractWe describe an algorithm for converting a characteristic set of a prime differential ideal f...
AbstractWe propose an algorithm for transforming a characteristic decomposition of a radical differe...
We propose an algorithm for transforming a characteristic decomposition of a radical differential id...
AbstractEfficient characteristic set methods for computing zeros of polynomial equation systems in a...
International audienceWe describe an algorithm for converting a characteristic set of a prime differ...
We prove several basic properties for difference ascending chains includ-ing a necessary and suffici...
AbstractWe prove several basic properties for difference ascending chains, including a necessary and...
Abstract. We prove several basic properties for difference ascending chains including a unique repre...
This article deals with the computation of the characteristic polynomial of dense matrices over smal...
International audienceWe generalize the analog of Buchberger's first criterion, stated by Boulier et...
International audienceFor any polynomial ideal I, let the minimal triangular set contained in the re...
ABSTRACT. This paper examines the computation of polynomial greatest common divisors by various gene...
This is the first paper of a series of three papers under the same title. It presents an improved ve...
We design a fast algorithm that computes, for a given linear differential operator with coefficients...