Arrow Research search

Author name cluster

Daniel Silva Graça

Possible papers associated with this exact author name in Arrow. This page groups case-insensitive exact name matches and is not a full identity disambiguation profile.

2 papers
1 author row

Possible papers

2

MFCS Conference 2011 Conference Paper

Solving Analytic Differential Equations in Polynomial Time over Unbounded Domains

  • Olivier Bournez
  • Daniel Silva Graça
  • Amaury Pouly

Abstract In this paper we consider the computational complexity of solving initial-value problems defined with analytic ordinary differential equations (ODEs) over unbounded domains of ℝ n and ℂ n, under the Computable Analysis setting. We show that the solution can be computed in polynomial time over its maximal interval of definition, provided it satisfies a very generous bound on its growth, and that the function admits an analytic extension to the complex plane.

Details

MFCS Conference 2010 Conference Paper

Robust Computations with Dynamical Systems

  • Olivier Bournez
  • Daniel Silva Graça
  • Emmanuel Hainry

Abstract In this paper we discuss the computational power of Lipschitz dynamical systems which are robust to infinitesimal perturbations. Whereas the study in [1] was done only for not-so-natural systems from a classical mathematical point of view (discontinuous differential equation systems, discontinuous piecewise affine maps, or perturbed Turing machines), we prove that the results presented there can be generalized to Lipschitz and computable dynamical systems. In other words, we prove that the perturbed reachability problem (i. e. the reachability problem for systems which are subjected to infinitesimal perturbations) is co-recursively enumerable for this kind of systems. Using this result we show that if robustness to infinitesimal perturbations is also required, the reachability problem becomes decidable. This result can be interpreted in the following manner: undecidability of verification doesn’t hold for Lipschitz, computable and robust systems. We also show that the perturbed reachability problem is co-r. e. complete even for C ∞ -systems.

Details
v2026.09.13