Displaying similar documents to “Un algorithme d'identification de frontières soumises à des conditions aux limites de Signorini”

Correcteurs proportionnels-intégraux généralisés

Michel Fliess, Richard Marquez, Emmanuel Delaleau, Hebertt Sira–Ramírez (2010)

ESAIM: Control, Optimisation and Calculus of Variations

Similarity:

For constant linear systems we are introducing and , which permit to bypass the derivative term in the classic PID controllers and more generally the usual asymptotic observers. Our approach, which is mainly of algebraic flavour, is based on the module-theoretic framework for linear systems and on operational calculus in Mikusiński's setting. Several examples are discussed.

Une méthode nodale appliquée à un problème de diffusion à coefficients généralisés

Abdelkader Laazizi, Nagib Guessous (2010)

ESAIM: Mathematical Modelling and Numerical Analysis

Similarity:

In this paper, we consider second order neutrons diffusion problem with coefficients in (Ω). Nodal method of the lowest order is applied to approximate the problem's solution. The approximation uses special basis functions [1] in which the coefficients appear. The rate of convergence obtained is in (Ω), with a free rectangular triangulation.

Analyse de récession et résultats de stabilité d'une convergence variationnelle, application à la théorie de la dualité en programmation mathématique

Driss Mentagui (2010)

ESAIM: Control, Optimisation and Calculus of Variations

Similarity:

Let be a Banach space and its continuous dual. (resp. ) denotes the set of nonempty convex closed subsets of (resp. ω*-closed subsets of ) endowed with the topology of uniform convergence of distance functions on bounded sets. This topology reduces to the Hausdorff metric topology on the closed and bounded convex sets [16] and in general has a Hausdorff-like presentation [11]. Moreover, this topology is well suited for estimations and constructive approximations [6-9]. We prove...

Transfert de Charge dans un Réseau de Processeurs Totalement Connectés

Maryse Béguin (2010)

RAIRO - Operations Research

Similarity:

In this paper, a model of the load transfer on a fully connected net is presented. Each processor can accept at most tasks. A load difference of two tasks between two processors is a prohibited situation and when it may appear, an immediat and instantaneous transfer is decided. The performances of the system are evaluated by the following indices: the reject probability, the throughput, the mean response time, the stationary probability distribution for a processor to host tasks. The...

Une heuristique d'optimisation globale basée sur la -transformation

Alexandre Dolgui, Valery Sysoev (2010)

RAIRO - Operations Research

Similarity:

In this paper, we study a heuristic algorithm for global optimization, which is based on the -transformation. We illustrate its behavior first, on a set of continuous non-convex objective functions – we search the global optimum of each function. Then, we give an example from combinatorial optimization. It concerns the optimization of scheduling rules parameters of a manufacturing system. Computational results are presented, they look encouraging.

Stabilisation frontière de problèmes de Ventcel

Amar Heminna (2010)

ESAIM: Control, Optimisation and Calculus of Variations

Similarity:

The problem of boundary stabilization for the isotropic linear elastodynamic system and the wave equation with Ventcel's conditions are considered (see [12]). The boundary observability and the exact controllability were etablished in [11]. We prove here the enegy decay to zero for the elastodynamic system with stationary Ventcel's conditions by introducing a nonlinear boundary feedback. We also give a boundary feedback leading to arbitrarily large energy decay rates for the elastodynamic...

Les problèmes d'ordonnancement de type flow-shop hybride : état de l'art

A. Vignier, J.-C. Billaut, C. Proust (2010)

RAIRO - Operations Research

Similarity:

A special class of scheduling problems is studied in this paper, named Hybrid Flowshop, jobs have to be performed in a shop and each of them has the same routing (so this is a flowshop). A job consists in different operations. A set of machines are able to perform each operation and this set is called a stage. So when a job consists in two operations, there are two stages in the shop. After introducing the scheduling generalities, we define our preocupations and we propose a notation in...