Fast computation of discrete invariants associated to a differential rational mapping
type: Item
instance of: scholarly article
title: Fast computation of discrete invariants associated to a differential rational mapping
zbMATH Open document ID: 1075.12005
DOI: 10.1016/S0747-7171(03)00091-9
published in: Journal of Symbolic Computation
publication date: 2004-08-20T00:00:00Z
review text: Let \(k\) be a numerical field of characteristic zero. The authors exhibit new algorithms connected with a problem of numerical integration of systems of first order algebraic differential equations over \(k\) of the form (1) \(f(x, \dot{x}) =0\), where \(f:k^{2n}\rightarrow k^{n}\) is a rational mapping, when a Jacobian determinant of the system is zero. In such cases the application of the implicit function theorem is impossible and local passage from a system (1) to its explicit form (2) \(\dot{x}=g(x)\) needs the additional discrete information (differentiation index, differential Hilbert function, algebraic parametric set). In order to obtain this information, one may consider a system (3) \(f(x, \dot{x}) =y\) (generic perturbation of (1)) and fulfill the process of completion, with the help of algorithms which have exponential complexity. In this paper the authors offer an alternative approach based on the use of differentially algebraic technics [see \textit{E. R. Kolchin}, Differential algebra and algebraic group, New York: Academic Press (1973; Zbl 0264.12102), Chs. 3-4] and numeric-symbolic algorithms [see \textit{G. Reid, C. Smith, J. Verschelde}, ''Geometric completion of differential systems using numeric-symbolic continuation'', SIGSAM Bull. 36, No. 2, 1--17 (2002; Zbl 1054.65090)] which have polynomial complexity. Reviewer's remark: The results of the paper are obtained assuming that the components of the map \(f\) are differentially algebraically independent over \(k\) (i.e. do not satisfy any differential equation over \(k\)). However it is not clear as far as realization of this condition for rational functions is easily checked.
Mathematics Subject Classification ID: 12H05
Mathematics Subject Classification ID: 68W30
Mathematics Subject Classification ID: 13P10
zbMATH DE Number: 2093526
zbMATH Keywords: probalistic algorithm
zbMATH Keywords: straight-line program
zbMATH Keywords: discrete invariants
author: Guillermo Matera
author: Alexandre Sedoglavic
reviewed by: Mykola Grygorenko
describes a project that uses: ObservabilityTest
MaRDI profile type: Publication
cites work: Q3692867
cites work: The complexity of partial derivatives
cites work: Q4314299
cites work: Q4227290
cites work: Q3993493
cites work: Completeness and reduction in algebraic complexity theory
cites work: Q4331740
cites work: The index of general nonlinear DAEs
cites work: The hardness of polynomial equation solving
cites work: Resolvent representation for regular differential ideals
cites work: Matrix multiplication via arithmetic progressions
cites work: Q4317713
cites work: On a new differential geometric setting in nonlinear control
cites work: An efficient algebraic algorithm for the geometric completion to involution
cites work: Q3835021
cites work: Factorization-free decomposition algorithms in differential algebra
cites work: Kähler differentials and differential algebra
cites work: Kahler Differentials and Differential Algebra in Arbitrary Characteristic
cites work: Q5680222
cites work: Q3714169
cites work: Triviality and dimension of a system of algebraic differential equations
cites work: Q4660702
cites work: Q3739243
cites work: Q3347289
cites work: Q4352783
cites work: Differential Elimination–Completion Algorithms for DAE and PDAE
cites work: Geometric completion of differential systems using numeric-symbolic continuation
cites work: Associative differential operations
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: A probabilistic algorithm to test local algebraic observability in polynomial time
cites work: The complexity of computing the permanent
cites work: Reducibility by algebraic projections
cites work: Feasible arithmetic computations: Valiant's hypothesis
cites work: Modern computer algebra
cites work: Q3851616
cites work: Q4274348
Recommended article: Solving linear ordinary differential systems in hyperexponential extensions
Recommended article: On rational solutions of systems of linear differential equations
Recommended article: Integrals of \(\nu\)-graded systems of ordinary differential equations
Recommended article: Q4382887
Recommended article: Q4237409
Recommended article: Q4237404
Recommended article: Q3783452
Recommended article: Finding First Integrals Using Normal Forms Modulo Differential Regular Chains
Recommended article: Numerical solution of the Cauchy problem for a system of differential-algebraic equations using implicit Runge-Kutta methods with a variable integration step
Recommended article: The best argument for the parametric continuation of solutions of differential-algebraic equations
description: scientific article; zbMATH DE number 2093526