Probabilistic algorithms for computing resolvent representations of regular differential ideals
DOI10.1007/S00200-008-0079-8zbMATH Open1192.12005OpenAlexW1998206344MaRDI QIDQ985372FDOQ985372
Evelyne Hubert, Thomas Cluzeau
Publication date: 5 August 2010
Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00200-008-0079-8
Recommendations
- On the complexity of the resolvent representation of some prime differential ideals
- Resolvent representation for regular differential ideals
- scientific article; zbMATH DE number 1254247
- Computing canonical representatives of regular differential ideals
- Computing representations for radicals of finitely generated differential ideals
differential algebraprobabilistic algorithmsdifferential eliminationchange of rankingdifferential primitive elementresolvent representation
Symbolic computation and algebraic computation (68W30) Parallel algorithms in computer science (68W10) Differential algebra (12H05) Software, source code, etc. for problems pertaining to field theory (12-04)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Fast Probabilistic Algorithms for Verification of Polynomial Identities
- Title not available (Why is that?)
- Solving zero-dimensional systems through the rational univariate representation
- Title not available (Why is that?)
- Title not available (Why is that?)
- A Gröbner free alternative for polynomial system solving
- On the theories of triangular sets
- Modern computer algebra
- Definability and fast quantifier elimination in algebraically closed fields
- Title not available (Why is that?)
- Computing representations for radicals of finitely generated differential ideals
- Factorization-free decomposition algorithms in differential algebra
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Resolvent representation for regular differential ideals
- Title not available (Why is that?)
- A bound for the order of characteristic set elements of an ordinary prime differential ideal and some applications
- On the complexity of the resolvent representation of some prime differential ideals
- A bound for the Rosenfeld-Gröbner algorithm
- A Simple Algorithm for Cyclic Vectors
- Unmixed-dimensional decomposition of a finitely generated perfect differential ideal
- Title not available (Why is that?)
- Specializations in Differential Algebra
- Formal Solutions of Irregular Linear Differential Equations. Part II
- Essential components of an algebraic differential equation
- Algebraic transformation of differential characteristic decompositions from one ranking to another
- Resolvent systems of difference polynomial ideals
- Automated reasoning in differential geometry and mechanics using the characteristic set method. I: An improved version of Ritt-Wu's decomposition algorithm
- Some Basic Theorems in Differential Algebra (Characteristic p, Arbitrary)
- Improvements to a triangulation-decomposition algorithm for ordinary differential systems in higher degree cases
- Title not available (Why is that?)
Cited In (5)
- A primitive element theorem for fields with commuting derivations and automorphisms
- A new algorithm for computing regular representations for radicals of parametric differential ideals
- A geometric index reduction method for implicit systems of differential algebraic equations
- Resolvent representation for regular differential ideals
- On the complexity of the resolvent representation of some prime differential ideals
Uses Software
This page was built for publication: Probabilistic algorithms for computing resolvent representations of regular differential ideals
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q985372)
