Computing differential characteristic sets by change of ordering
We describe an algorithm for converting a characteristic set of a prime differential ideal from one ranking into another. This algorithm was implemented in many different languages and has been applied within various software and projects. It permitted to solve formerly unsolved problems.
Gespeichert in:
Veröffentlicht in: | Journal of symbolic computation 2010, Vol.45 (1), p.124-149 |
---|---|
Hauptverfasser: | , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | We describe an algorithm for converting a characteristic set of a prime differential ideal from one ranking into another. This algorithm was implemented in many different languages and has been applied within various software and projects. It permitted to solve formerly unsolved problems. |
---|---|
ISSN: | 0747-7171 1095-855X |
DOI: | 10.1016/j.jsc.2009.09.004 |