We present an algorithm to characterize the set S = {x is an element of R-l : f(x) > 0} = f(-1)(]0, infinity[(m)) in the frame work of set inversion using interval analysis. The proposed algorithm improves on the algorithm of Jaulin et. al. The improvement exploits powerful Hansen's method for solving systems of nonlinear inequalities. We test and compare the performance of the proposed and existing algorithms in characterizing the domain for the robust stability. The results of the testing show that the proposed algorithm is computationally efficient and encloses the solution more sharply than the existing algorithm, requires less memory space and iterations
Linear systems represent the computational kernel of many models that describe problems arising in t...
International audienceThis paper deals with computational aspects of interval kalman filtering of di...
International audienceThis paper deals with a fault detection method taking model uncertainties desc...
We present an algorithm to characterize the set S = {x ∈ R-1 : f(x) > 0} = f(-1)(]0, ∞...
Abstract. In this paper, a new algorithm based on Set Inversion techniques and Modal Interval Analys...
International audienceIn recent years, many applications, as well as theoretical properties of inter...
International audienceThis paper deals with the set inversion problem X = f −1 (Y) in the case where...
International audienceThis paper deals with the set inversion problem X = f −1 (Y) in the case where...
International audienceIn the paper, we present a new interval-based set inversion algorithm which ta...
For systems of equations and/or inequalities under interval uncertainty, interval computations usual...
A reliable symbolic-numeric algorithm for solving nonlinear systems over the reals is designed. The ...
Main topic of this thesis is solving interval linear systems. At first, we describe the structure of...
Given a nonlinear discrete-time system, previous works exist that compute invariant sets as finite u...
Linear systems represent the computational kernel of many models that describe problems arising in t...
This thesis investigates whether interval methods can be employed in the construction of a novel con...
Linear systems represent the computational kernel of many models that describe problems arising in t...
International audienceThis paper deals with computational aspects of interval kalman filtering of di...
International audienceThis paper deals with a fault detection method taking model uncertainties desc...
We present an algorithm to characterize the set S = {x ∈ R-1 : f(x) > 0} = f(-1)(]0, ∞...
Abstract. In this paper, a new algorithm based on Set Inversion techniques and Modal Interval Analys...
International audienceIn recent years, many applications, as well as theoretical properties of inter...
International audienceThis paper deals with the set inversion problem X = f −1 (Y) in the case where...
International audienceThis paper deals with the set inversion problem X = f −1 (Y) in the case where...
International audienceIn the paper, we present a new interval-based set inversion algorithm which ta...
For systems of equations and/or inequalities under interval uncertainty, interval computations usual...
A reliable symbolic-numeric algorithm for solving nonlinear systems over the reals is designed. The ...
Main topic of this thesis is solving interval linear systems. At first, we describe the structure of...
Given a nonlinear discrete-time system, previous works exist that compute invariant sets as finite u...
Linear systems represent the computational kernel of many models that describe problems arising in t...
This thesis investigates whether interval methods can be employed in the construction of a novel con...
Linear systems represent the computational kernel of many models that describe problems arising in t...
International audienceThis paper deals with computational aspects of interval kalman filtering of di...
International audienceThis paper deals with a fault detection method taking model uncertainties desc...