Institution
Institut Élie Cartan de Lorraine
Facility•Vandœuvre-lès-Nancy, France•
About: Institut Élie Cartan de Lorraine is a facility organization based out in Vandœuvre-lès-Nancy, France. It is known for research contribution in the topics: Boundary value problem & Stochastic differential equation. The organization has 345 authors who have published 1084 publications receiving 15512 citations. The organization is also known as: Institut Élie-Cartan de Nancy.
Topics: Boundary value problem, Stochastic differential equation, Boundary (topology), Brownian motion, Nonlinear system
Papers published on a yearly basis
Papers
More filters
•
29 Nov 2013TL;DR: In this paper, a methode recursive d'estimation sequentielle is defined for estimating vecteurs of donnees of a large dimension arrivant en ligne and observations independant of a vecteur aleatoire.
Abstract: On suppose que des vecteurs de donnees de grande dimension arrivant en ligne sont des observations independantes d'un vecteur aleatoire. Dans le second chapitre, ce dernier, note Z, est partitionne en deux vecteurs R et S et les observations sont supposees identiquement distribuees. On definit alors une methode recursive d'estimation sequentielle des r premiers facteurs de l'ACP projetee de R par rapport a S. On etudie ensuite le cas particulier de l'analyse canonique, puis de l'analyse factorielle discriminante et enfin de l'analyse factorielle des correspondances. Dans chacun de ces cas, on definit plusieurs processus specifiques a l'analyse envisagee. Dans le troisieme chapitre, on suppose que l'esperance θn du vecteur aleatoire Zn dont sont issues les observations varie dans le temps. On note Zn_tilde = Zn − θn et on suppose que les vecteurs Zn_tilde forment un echantillon independant et identiquement distribue d'un vecteur aleatoire Z_tilde. On definit plusieurs processus d'approximation stochastique pour estimer des vecteurs directeurs des axes principaux d'une analyse en composantes principales (ACP) partielle de Z_tilde. On applique ensuite ce resultat au cas particulier de l'analyse canonique generalisee (ACG) partielle apres avoir defini un processus d'approximation stochastique de type Robbins-Monro de l'inverse d'une matrice de covariance. Dans le quatrieme chapitre, on considere le cas ou a la fois l'esperance et la matrice de covariance de Zn varient dans le temps. On donne finalement des resultats de simulation dans le chapitre 5.
2 citations
•
04 Nov 2009TL;DR: In this paper, a formule de trace is defined, which permits to calculate the troisieme moment des valeurs centrales of fonctions L de formes modulaires, and to study l'annulation of ces valeur centrales.
Abstract: L'etude des proprietes analytiques des fonctions L de formes modulaires est un theme profond de la theorie des nombres. Jusqu'a present, les proprietes ont essentiellement ete etablies dans le cas des formes de niveau premier ou sans facteur carre. L'objet de cette these est d'etablir les bases de l'analyse dans le cas arithmetiquement oppose des niveaux primaires, c'est-a-dire puissances d'un nombre premier. La famille de fonctions L consideree est alors celle obtenue en faisant varier la valuation du niveau. En particulier, on etablit une formule de trace qui permet de calculer le troisieme moment des valeurs centrales de fonctions L de formes modulaires et d'etudier l'annulation de ces valeurs centrales.
2 citations
••
TL;DR: In this article, the critical covered volume is defined as the proportion of space covered by a Boolean model when the intensity λ is critical for percolation in a homogeneous Poisson point process.
Abstract: Consider a Boolean model Σ in Rd. The centers are given by a homogeneous Poisson point process with intensity λ and the radii of distinct balls are i.i.d. with common distribution ν. The critical covered volume is the proportion of space covered by Σ when the intensity λ is critical for percolation. Previous numerical simulations and heuristic arguments suggest that the critical covered volume may be minimal when ν is a Dirac measure. In this paper, we prove that it is not the case in sufficiently high dimension.
2 citations
17 Jun 2015
TL;DR: In this paper, a fast numerical method was proposed to compute time optimal control for axi-symmetric micro-swimmers, based on explicit formulae of time optimal controls for the Brockett integrator which is a system approaching the dynamic of the swimmer.
Abstract: The aim of this work is to compute time optimal controls for micro-swimmers. The action of swimming is seen as a control problem. More precisely, given an initial position and a target position, can the swimmer move to the target by changing its shape. The motion of the swimmer in the fluid results from the fluid-structure interaction. For micro-swimmers, the fluid equations in consideration are the stationnary Stokes equations. The way of swimming can be described by the following steps: 1. the swimmer modifies its shape, 2. this modification creates a velocity field in the fluid, 3. the fluid velocity acts on the swimmer as a force, 4. the fluid force moves the swimmer. Of course things are not so distinct and the swimming is a highly coupled nonlinear control problem. In this note, we present some key results for a fast numerical method to compute time optimal controls for axi-symmetric micro-swimmers. This numerical method is based on explicit formulae of time optimal controls for the Brockett integrator which is a system approaching the dynamic of the swimmer.
2 citations
•
TL;DR: All orthogonal polynomials as vertex|matching-partition functions of suitably labelled paths are generated, and how to find their derivatives in some cases is indicated.
Abstract: A vertex|matching-partition (V |M) of a simple graph G is a spanning collection of vertices and independent edges of G. Let vertex v ∈ V have weight wv and edge e ∈ M have weight we. Then the weight of V |M is w(V |M) = ∏ v∈V wv · ∏ e∈M we. Define the vertex|matching-partition function of G as W(G) = ∑ V |M w(V |M). In this paper we study this function when G is a path and a cycle. We generate all orthogonal polynomials as vertex|matching-partition functions of suitably labelled paths, and indicate how to find their derivatives in some cases. Here Taylor’s Expansion is used and an application to associated polynomials is given. We also give a combinatorial interpretation of coefficients in the case of multiplicative and additive weights. Results are extended to the weighted cycle.
2 citations
Authors
Showing all 361 results
Name | H-index | Papers | Citations |
---|---|---|---|
Ivan Nourdin | 44 | 217 | 6139 |
Marius Tucsnak | 33 | 114 | 3907 |
Victor Nistor | 31 | 158 | 3352 |
Xavier Antoine | 30 | 125 | 2992 |
Jan Sokołowski | 30 | 203 | 6056 |
Nicolas Fournier | 29 | 106 | 3044 |
Gérald Tenenbaum | 29 | 173 | 5100 |
Lionel Rosier | 29 | 126 | 3956 |
Vicente Cortés | 27 | 118 | 2356 |
Gauthier Sallet | 27 | 70 | 2007 |
Antoine Henrot | 26 | 128 | 3268 |
Samy Tindel | 26 | 168 | 2656 |
Bruno Scherrer | 25 | 69 | 1447 |
Mario Sigalotti | 25 | 180 | 2082 |
Takéo Takahashi | 24 | 87 | 1673 |