Fast computation of discrete invariants associated to a differential rational mapping

DOI10.1016/S0747-7171(03)00091-9zbMATH Open1075.12005MaRDI QIDQ1878484FDOQ1878484

Authors: Guillermo Matera, Alexandre Sedoglavic 

Publication date: 20 August 2004

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

Recommendations

• Solving linear ordinary differential systems in hyperexponential extensions
• On rational solutions of systems of linear differential equations
• Integrals of \(\nu\)-graded systems of ordinary differential equations
• scientific article; zbMATH DE number 1131988
• scientific article; zbMATH DE number 1273674
• scientific article; zbMATH DE number 1273670
• scientific article; zbMATH DE number 4046992
• Finding first integrals using normal forms modulo differential regular chains
• Numerical solution of the Cauchy problem for a system of differential-algebraic equations using implicit Runge-Kutta methods with a variable integration step
• The best argument for the parametric continuation of solutions of differential-algebraic equations

zbMATH Keywords

straight-line programdiscrete invariantsprobalistic algorithm

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Differential algebra (12H05)

Cites Work

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

Cited In (7)

• A geometric index reduction method for implicit systems of differential algebraic equations
• Title not available (Why is that?)
• Jacobi's bound: Jacobi's results translated in Kőnig's, Egerváry's and Ritt's mathematical languages
• A linear algebra approach to the differentiation index of generic DAE systems
• A computation of invariants of a rational self-map
• Fast commutative matrix algorithms
• On the complexity of the resolvent representation of some prime differential ideals

Uses Software

• ObservabilityTest

This page was built for publication: Fast computation of discrete invariants associated to a differential rational mapping

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1878484)