Complexity of testing irreducibility of a system of linear ordinary differential equations

DOI10.1007/BF02112428zbMath0835.65077MaRDI QIDQ1190953

Dima Yu. Grigoriev

Publication date: 27 September 1992

Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)

zbMATH Keywords

complexityalgorithmreducibilityfieldirreducibility testingsystem of first order linear ordinary differential equations

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Linear ordinary differential equations and systems (34A30) Numerical solutions to equations with linear operators (65J10) Complexity and performance of numerical algorithms (65Y20)

Cites Work

• Siegel normality
• Liouvillian Solutions of n-th Order Homogeneous Linear Differential Equations
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Complexity of testing irreducibility of a system of linear ordinary differential equations