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

DOI10.1007/BF02112428zbMATH Open0835.65077MaRDI QIDQ1190953FDOQ1190953

Authors: Dima Grigoriev 

Publication date: 27 September 1992

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

zbMATH Keywords

algorithmcomplexityreducibilityfieldirreducibility testingsystem of first order linear ordinary differential equations

Mathematics Subject Classification ID

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

Cites Work

• Siegel normality
• Liouvillian Solutions of n-th Order Homogeneous Linear Differential Equations
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (1)

• Complexity of quantifier elimination in the theory of ordinary differential equations

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

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