 |
|
|
|
| HAL : hal-00139354, version 1 |
| DOI : 10.1145/384101.384108 |
| Fiche détaillée |  Récupérer au format |
|
|
| international symposium on Symbolic and algebraic computation 2001, France (2001) |
|
|
|
|
| PARDI ! |
|
|
| François Boulier 1, 2François Lemaire 1, 2 |
|
|
| (2001) |
|
|
|
| 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. |
|
|
|
|
|
|
|
|
|
|
|
| 1 : | Laboratoire d'Informatique Fondamentale de Lille (LIFL) |
|
|
|
CNRS : UMR8022 – INRIA – IRCICA – Université Lille 1 - Sciences et Technologies |
|
|
| 2 : | CALFOR (LIFL) |
|
|
|
Université Lille 1 - Sciences et Technologies – CNRS : UMR8022 |
|
|
| 3 : | Ontario Research Center for Computer Algebra (ORCCA) |
|
|
|
University Western Ontario |
|
|
|
|
|
|
|
|
|
| Domaine | : | Mathématiques/Algèbre commutative Mathématiques/Equations aux dérivées partielles Informatique/Calcul formel |
|
|
| differential algebra – PDE – characteristic set – change of ranking – gcd |
|
|
|
| Liste des fichiers attachés à ce document : | |||||
|
|||||
|
|
|
| hal-00139354, version 1 | |
| http://hal.archives-ouvertes.fr/hal-00139354 | |
| oai:hal.archives-ouvertes.fr:hal-00139354 | |
| Contributeur : François Boulier | |
| Soumis le : Vendredi 30 Mars 2007, 14:05:31 | |
| Dernière modification le : Vendredi 22 Janvier 2010, 14:10:09 | |
