Continuous-time orbit problems are decidable in polynomial-time

DOI10.1016/J.IPL.2014.08.004MaRDI QIDQ458374zbMATH OpenOpenAlexFDO

Authors Taolue Chen, Nengkun Yu, Tingting Han

Publication date 7 October 2014

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://eprints.mdx.ac.uk/16749/1/ipl15.pdf

zbMATH Keywords

differential equationcomputational complexitydynamical systemslinear algebracontinuous-time orbit problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Stability theory for smooth dynamical systems (37C75)

Cites work

• scientific article; zbMATH DE number 435565 (Why is no real title available?)
• scientific article; zbMATH DE number 47603 (Why is no real title available?)
• COMPUTING JORDAN NORMAL FORMS EXACTLY FOR COMMUTING MATRICES IN POLYNOMIAL TIME
• Polynomial-time algorithm for the orbit problem
• Positivity problems for low-order linear recurrence sequences
• Reachability in Linear Dynamical Systems
• The Orbit Problem Is in the GapL Hierarchy
• The continuous Skolem-Pisot problem
• The orbit problem in higher dimensions

Cited in

(1)

• On the decidability of reachability in continuous time linear time-invariant systems

This page was built for publication: Continuous-time orbit problems are decidable in polynomial-time

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