Complexity of factoring and calculating the GCD of linear ordinary differential operators

DOI10.1016/S0747-7171(08)80034-XzbMath0728.68067OpenAlexW2103078973MaRDI QIDQ805235

Dima Yu. Grigoriev

Publication date: 1990

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

Full work available at URL: https://doi.org/10.1016/s0747-7171(08)80034-x

zbMATH Keywords

factoringlinear differential operator with rational coefficients

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) General theory of ordinary differential operators (47E05) Linear ordinary differential equations and systems (34A30)

Related Items (24)

Loewy decomposition of linear differential equations ⋮ Deviation theorems for solutions of differential equations and applications to lower bounds on parallel complexity of sigmoids ⋮ Computing solutions of linear Mahler equations ⋮ Factoring linear partial differential operators in \(n\) variables ⋮ NC solving of a system of linear ordinary differential equations in several unknowns ⋮ Loewy and primary decompositions of \(\mathcal D\)-modules ⋮ Unipotent differential algebraic groups as parameterized differential Galois groups ⋮ Testing reducibility of linear differential operators: A group theoretic perspective ⋮ Minimization of differential equations and algebraic values of 𝐸-functions ⋮ Fraction-free algorithm for the computation of diagonal forms matrices over Ore domains using Gröbner bases ⋮ Satellite unknowns in irreducible differential systems ⋮ Solving and factoring boundary problems for linear ordinary differential equations in differential algebras ⋮ Decomposition of ordinary differential polynomials ⋮ A noncommutative algebraic operational calculus for boundary problems ⋮ The complete generating function for Gessel walks is algebraic ⋮ Division of differential operators, intertwine relations and Darboux transformations. ⋮ Irreducibility criteria for skew polynomials. ⋮ Algebraic properties of Airy operators of small order ⋮ Constructive arithmetics in Ore localizations of domains ⋮ An algebraic foundation for factoring linear boundary problems ⋮ Computing approximate greatest common right divisors of differential polynomials ⋮ Explicit degree bounds for right factors of linear differential operators ⋮ Calculating the Galois group of \(L_1(L_2(y))=0,\) \(L_1, L_2\) completely reducible operators ⋮ On the complexity of skew arithmetic

Cites Work

• Definability and fast quantifier elimination in algebraically closed fields
• Factoring polynomials with rational coefficients
• Lectures on transcendental numbers. Edited and completed by B. Diviš and W. J. LeVeque
• Polynomial-Time Reductions from Multivariate to Bi- and Univariate Integral Polynomial Factorization
• Liouvillian Solutions of n-th Order Homogeneous Linear Differential Equations
• Sylvester's Identity and Multistep Integer-Preserving Gaussian Elimination
• 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

This page was built for publication: Complexity of factoring and calculating the GCD of linear ordinary differential operators