Event detection for ODES and nonrecursive hierarchies
From MaRDI portal
Publication:6183616
DOI10.1007/3-540-58131-6_59zbMath1529.68120MaRDI QIDQ6183616
Publication date: 29 January 2024
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Undecidability and degrees of sets of sentences (03D35) Numerical methods for initial value problems involving ordinary differential equations (65L05) Turing machines and related notions (03D10) Computation over the reals, computable analysis (03D78) Hierarchies of computability and definability (03D55)
Cites Work
- Instability in Discrete Algorithms and Exact Reversibility
- On the computational complexity of ordinary differential equations
- A computable ordinary differential equation which possesses no computable solution
- Reliable solution of special event location problems for ODEs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Event detection for ODES and nonrecursive hierarchies