Computational bounds on polynomial differential equations
type: Item
instance of: scholarly article
title: Computational bounds on polynomial differential equations
zbMATH Open document ID: 1183.65082
author: Jorge Buescu
author: Daniel Graça
author: Manuel Lameiras Campagnolo
published in: Applied Mathematics and Computation
publication date: 2009-11-13T00:00:00Z
full work available at URL: http://hdl.handle.net/10400.1/1012
Mathematics Subject Classification ID: 65L05
zbMATH DE Number: 5632586
zbMATH Keywords: Turing machines
zbMATH Keywords: computability
zbMATH Keywords: polynomial ordinary differential equations
zbMATH Keywords: continuous-time dynamical systems
zbMATH Keywords: initial-value problem
MaRDI profile type: Publication
OpenAlex ID: W1990692111
cites work: Q4067388
cites work: Q5787786
cites work: Mathematical Theory of the Differential Analyzer
cites work: Analog computers and recursive functions over the reals.
cites work: Q4837102
cites work: Computability with polynomial differential equations
cites work: Universal computation and other capabilities of hybrid and continuous dynamical systems
cites work: Iteration, inequalities, and differentiability in analog computers
cites work: Reachability in Linear Dynamical Systems
cites work: Q4002474
cites work: A Differentially Algebraic Elimination Theorem with Application to Analog Computability in the Calculus of Variations
cites work: Some recent developments on Shannon's General Purpose Analog Computer
cites work: Abstract Computability and Its Relation to the General Purpose Analog Computer (Some Connections Between Logic, Differential Equations and Analog Computers)
cites work: Q4485693
cites work: Q3994907
cites work: Computability, noncomputability and undecidability of maximal intervals of IVPs
cites work: Q2707531
cites work: Q4437079
cites work: On the Nature of the Spectrum of Singular Second Order Linear Differential Equations
cites work: Q4528895
cites work: Q3392273
cites work: Q4506483
cites work: A computable ordinary differential equation which possesses no computable solution
cites work: The wave equation with computable initial data such that its unique solution is not computable
cites work: The Wave Equation with Computable Initial Data Whose Unique Solution Is Nowhere Computable
cites work: IS WAVE PROPAGATION COMPUTABLE OR CAN WAVE COMPUTERS BEAT THE TURING MACHINE?
cites work: Q4038702
cites work: Reachability analysis of dynamical systems having piecewise-constant derivatives
cites work: What's decidable about hybrid automata?
cites work: Achilles and the tortoise climbing up the hyper-arithmetical hierarchy
cites work: A survey of computational complexity results in systems and control
cites work: Q5580482
cites work: Small universal Turing machines
cites work: Q5384983
DOI: 10.1016/J.AMC.2009.04.055
Recommended article: Computability with polynomial differential equations
Recommended article: Computational complexity of solving polynomial differential equations over unbounded domains
Recommended article: Rigorous Numerical Computation of Polynomial Differential Equations Over Unbounded Domains
Recommended article: Q4023645
Recommended article: Computation of all polynomial solutions of a class of nonlinear differential equations
Recommended article: Computing with polynomial ordinary differential equations
Recommended article: On the complexity of quadratization for polynomial differential equations
Recommended article: On numerical approximation of differential polynomials
Recommended article: Solving Analytic Differential Equations in Polynomial Time over Unbounded Domains
Recommended article: A new framework for polynomial approximation to differential equations
description: scientific article; zbMATH DE number 5632586