Fast computation of discrete invariants associated to a differential rational mapping

DOI10.1016/S0747-7171(03)00091-9zbMath1075.12005MaRDI QIDQ1878484

Guillermo Matera, Alexandre Sedoglavic

Publication date: 20 August 2004

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

zbMATH Keywords

discrete invariants; straight-line program; probalistic algorithm

Mathematics Subject Classification ID

68W30: Symbolic computation and algebraic computation

13P10: Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases)

12H05: Differential algebra

Related Items

A geometric index reduction method for implicit systems of differential algebraic equations, A linear algebra approach to the differentiation index of generic DAE systems, On the complexity of the resolvent representation of some prime differential ideals

Uses Software

• ObservabilityTest

Cites Work

• The complexity of computing the permanent
• Matrix multiplication via arithmetic progressions
• Feasible arithmetic computations: Valiant's hypothesis
• Reducibility by algebraic projections
• The complexity of partial derivatives
• On a new differential geometric setting in nonlinear control
• Triviality and dimension of a system of algebraic differential equations
• The hardness of polynomial equation solving
• Resolvent representation for regular differential ideals
• Completeness and reduction in algebraic complexity theory
• Factorization-free decomposition algorithms in differential algebra
• An efficient algebraic algorithm for the geometric completion to involution
• The index of general nonlinear DAEs
• A bound for the order of characteristic set elements of an ordinary prime differential ideal and some applications
• Kähler differentials and differential algebra
• Associative differential operations
• Fast Probabilistic Algorithms for Verification of Polynomial Identities
• Kahler Differentials and Differential Algebra in Arbitrary Characteristic
• Differential Elimination–Completion Algorithms for DAE and PDAE
• Geometric completion of differential systems using numeric-symbolic continuation
• A probabilistic algorithm to test local algebraic observability in polynomial time
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item