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

DOI10.1007/BF02112428MaRDI QIDQ1190953zbMATH OpenFDO

Authors Dima Grigoriev

Publication date 27 September 1992

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

Full work available at URL https://doi.org/10.1007/BF02112428

zbMATH Keywords

algorithmcomplexityfieldirreducibility testingreducibilitysystem of first order linear ordinary differential equations

Mathematics Subject Classification ID

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

Review text

See the review in Zbl 0759.65026.

Cites work

• scientific article; zbMATH DE number 3145284 (Why is no real title available?)
• scientific article; zbMATH DE number 3893304 (Why is no real title available?)
• scientific article; zbMATH DE number 3893305 (Why is no real title available?)
• scientific article; zbMATH DE number 3346278 (Why is no real title available?)
• Liouvillian Solutions of n-th Order Homogeneous Linear Differential Equations
• Siegel normality

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)