Probabilistic algorithms for computing resolvent representations of regular differential ideals
type: Item
instance of: scholarly article
title: Probabilistic algorithms for computing resolvent representations of regular differential ideals
zbMATH Open document ID: 1192.12005
author: Thomas Cluzeau
author: Evelyne Hubert
published in: Applicable Algebra in Engineering, Communication and Computing
publication date: 2010-08-05T00:00:00Z
Mathematics Subject Classification ID: 12H05
Mathematics Subject Classification ID: 68W10
Mathematics Subject Classification ID: 68W30
Mathematics Subject Classification ID: 12-04
zbMATH DE Number: 5764085
zbMATH Keywords: differential algebra
zbMATH Keywords: differential primitive element
zbMATH Keywords: resolvent representation
zbMATH Keywords: probabilistic algorithms
zbMATH Keywords: differential elimination
zbMATH Keywords: change of ranking
describes a project that uses: ISOLATE
describes a project that uses: Kronecker
describes a project that uses: DIFFALG
MaRDI profile type: Publication
full work available at URL: s00200-008-0079-8
OpenAlex ID: W1998206344
cites work: Q4714011
cites work: On the theories of triangular sets
cites work: Q4234296
cites work: Q4227290
cites work: Computing representations for radicals of finitely generated differential ideals
cites work: Unmixed-dimensional decomposition of a finitely generated perfect differential ideal
cites work: Automated reasoning in differential geometry and mechanics using the characteristic set method. I: An improved version of Ritt-Wu's decomposition algorithm
cites work: Resolvent representation for regular differential ideals
cites work: Q5334359
cites work: Formal Solutions of Irregular Linear Differential Equations. Part II
cites work: On the complexity of the resolvent representation of some prime differential ideals
cites work: Resolvent systems of difference polynomial ideals
cites work: Modern computer algebra
cites work: Q4293510
cites work: A Gröbner free alternative for polynomial system solving
cites work: A bound for the Rosenfeld-Gröbner algorithm
cites work: Algebraic transformation of differential characteristic decompositions from one ranking to another
cites work: Definability and fast quantifier elimination in algebraically closed fields
cites work: Essential components of an algebraic differential equation
cites work: Factorization-free decomposition algorithms in differential algebra
cites work: Q4425661
cites work: Q4425662
cites work: Improvements to a triangulation-decomposition algorithm for ordinary differential systems in higher degree cases
cites work: A Simple Algorithm for Cyclic Vectors
cites work: Q5680222
cites work: Q5482450
cites work: Q5795628
cites work: Specializations in Differential Algebra
cites work: Solving zero-dimensional systems through the rational univariate representation
cites work: A bound for the order of characteristic set elements of an ordinary prime differential ideal and some applications
cites work: Fast Probabilistic Algorithms for Verification of Polynomial Identities
cites work: Some Basic Theorems in Differential Algebra (Characteristic p, Arbitrary)
cites work: Q4771357
cites work: Q3839545
cites work: Q3851616
DOI: 10.1007/S00200-008-0079-8
description: scientific article; zbMATH DE number 5764085