Improvements to a triangulation-decomposition algorithm for ordinary differential systems in higher degree cases

DOI10.1145/1005285.1005314zbMath1134.12303OpenAlexW2130850151MaRDI QIDQ4657323

Evelyne Hubert

Publication date: 14 March 2005

Published in: Proceedings of the 2004 international symposium on Symbolic and algebraic computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1005285.1005314

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Differential algebra (12H05)

Related Items (4)

Algorithm for computing differential char sets efficiently ⋮ A bound for the Rosenfeld-Gröbner algorithm ⋮ A bound for orders in differential Nullstellensatz ⋮ Probabilistic algorithms for computing resolvent representations of regular differential ideals

This page was built for publication: Improvements to a triangulation-decomposition algorithm for ordinary differential systems in higher degree cases