Nicolas Delanoue
University of Angers
Theoretical Computer Science | 2006
Nicolas Delanoue; Luc Jaulin; Bertrand Cottenceau
In this paper, we give a numerical algorithm able to prove whether a set S described by nonlinear inequalities is path-connected or not. To our knowledge, no other algorithm (numerical or symbolic) is able to deal with this type of problem. The proposed approach uses interval arithmetic to build a graph which has exactly the same number of connected components as S. Examples illustrate the principle of the approach.
Reliable Computing | 2007
Sébastien Lagrange; Nicolas Delanoue; Luc Jaulin
This paper presents a new numerical algorithm based on interval analysis able to verify that a continuously differentiable function is injective. The efficiency of the method is demonstrated by illustrative examples. These examples have been treated by a C++ solver which is made available.
Reliable Computing | 2007
Nicolas Delanoue; Luc Jaulin; Bertrand Cottenceau
This paper provides an effective method to create an abstract simplicial complex homotopy equivalent to a given set
Journal of Computational and Applied Mathematics | 2014
Nicolas Delanoue; Sébastien Lagrange
parallel computing | 2004
Nicolas Delanoue; Luc Jaulin; Bertrand Cottenceau
\mathbb{S}
Archive | 2019
Philippe Lucidarme; Nicolas Delanoue; Franck Mercier; Yannick Aoustin; Christine Chevallereau; Philippe Wenger
Robotics and Autonomous Systems | 2018
Mohamed Mustafa; Alexandru Stancu; Nicolas Delanoue; Eduard Codres
described by non-linear inequalities (polynomial or not). To our knowledge, no other numerical algorithm is able to deal with this type of problem. The proposed approach divides
Computational Optimization and Applications | 2016
Nicolas Delanoue; Mehdi Lhommeau; Philippe Lucidarme
Automatica | 2008
Sébastien Lagrange; Nicolas Delanoue; Luc Jaulin
\mathbb{S}
Communications in Nonlinear Science and Numerical Simulation | 2015
Nicolas Delanoue; Luc Jaulin; Bertrand Cottenceau
