A new method for solving algebraic systems of positive dimension
Discrete Applied Mathematics - Special volume on applied algebra, algebraic algorithms, and error-correcting codes
A generalized Euclidean algorithm for computing triangular representations of algebraic varieties
Journal of Symbolic Computation
Representation for the radical of a finitely generated differential ideal
ISSAC '95 Proceedings of the 1995 international symposium on Symbolic and algebraic computation
On the theories of triangular sets
Journal of Symbolic Computation - Special issue on polynomial elimination—algorithms and applications
Triangular sets for solving polynomial systems: a comparative implementation of four methods
Journal of Symbolic Computation - Special issue on polynomial elimination—algorithms and applications
The differential ideal [P]: M∞
Journal of Symbolic Computation - Special issue on differential algebra and differential equations
Factorization-free decomposition algorithms in differential algebra
Journal of Symbolic Computation - Special issue on symbolic computation in algebra, analysis and geometry
New structure theorem for subresultants
Journal of Symbolic Computation - Special issue on symbolic computation in algebra, analysis and geometry
Computing canonical representatives of regular differential ideals
ISSAC '00 Proceedings of the 2000 international symposium on Symbolic and algebraic computation
Polynomial Gcd Computations over Towers of Algebraic Extensions
AAECC-11 Proceedings of the 11th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
On computer-assisted classification of coupled integrable equations
Proceedings of the 2001 international symposium on Symbolic and algebraic computation
On computer-assisted classification of coupled integrable equations
Journal of Symbolic Computation - Computer algebra: Selected papers from ISSAC 2001
Computation of canonical forms for ternary cubics
Proceedings of the 2002 international symposium on Symbolic and algebraic computation
ISSAC '04 Proceedings of the 2004 international symposium on Symbolic and algebraic computation
Change of order for bivariate triangular sets
Proceedings of the 2006 international symposium on Symbolic and algebraic computation
Change of order for regular chains in positive dimension
Theoretical Computer Science
Notes on triangular sets and triangulation-decomposition algorithms II: differential systems
SNSC'01 Proceedings of the 2nd international conference on Symbolic and numerical scientific computation
Almost linear time operations with triangular sets
ACM Communications in Computer Algebra
Algorithms for the universal decomposition algebra
Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation
Modular Composition Modulo Triangular Sets and Applications
Computational Complexity
| Hi-index | 0.00 |
We propose a new algorithm for converting a characteristic set of a prime differential ideal from one ranking into another. This differential algebra algorithm computes characteristic sets by change of ranking (ordering) for prime ideals. It identifies the purely algebraic subproblems which arise during differential computations and solves them algebraically. There are two improvements w.r.t. other approaches: formerly unsolved problems could be carried out; it is conceptually simple. Different variants are implemented.