Maëlle Nodet
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Maëlle Nodet has a total of 10 co-authors. Here are the top co-authors by number of shared publications:
- Clémentine Prieur
University of Grenoble Alpes, INRIA
5 shared publications - Alexandre Janon
LJK/MOISE Joseph Fourier University BP 53 38041 Grenoble Cedex France
3 shared publications - Alexandre Janon
UniversitéParis-Sud, Laboratoire de Mathématiques d’Orsay, Bâtiment 425, Université Paris-Sud, 91405 Orsay, France
2 shared publications Arthur Vidard
University Grenoble Alpes
2 shared publications- Christophe Prieur
Universit Grenoble Alpes, CNRS, Grenoble-INP, GIPSA-lab, Grenoble, France
2 shared publications - Arthur Vidard
Univ. Grenoble-Alpes, Inria, CNRS, Grenoble-INP, LJK, 38000 Grenoble, France
1 shared publication
Latest Publications
- 17 June 2017
- Published by Springer Nature
- p. 1123-1142
Variational Methods
- Open Access
Progressive assimilation of multiscale observations
The description of correlated observation error statistics is a challenge in data assimilation. Currently, the observation errors are assumed uncorrelated (the covariance matrix is diagonal) which is a severe approximation that leads to suboptimal results. It is possible to use multi-scale transformations to retain the diagonal matrix approximation while accounting for some correlation. However this approach can lead to some convergence problems due to scale interactions. In this paper we propose an online scale selection algorithm that improves the convergence properties in such case.
Open AccessProgressive assimilation of multiscale observations
The description of correlated observation error statistics is a challenge in data assimilation. Currently, the observation errors are assumed uncorrelated (the covariance matrix is diagonal) which is a severe approximation that leads to suboptimal results. It is possible to use multi-scale transformations to retain the diagonal matrix approximation while accounting for some correlation. However this approach can lead to some convergence problems due to scale interactions. In this paper we propose an online scale selection algorithm that improves the convergence properties in such case.
- 9 December 2015
- Published by Springer Nature in Mathematics of Control, Signals, and Systems
- Vol. 28 (1) , 1-27
Global sensitivity analysis for the boundary control of an open channel
- 9 December 2015
- Published by Springer Nature in Mathematics of Control, Signals, and Systems
- Vol. 28 (1) , 1-27
Global sensitivity analysis for the boundary control of an open channel
- Open Access
Global sensitivity analysis for the boundary control of an open channel
The goal of this paper is to solve the global sensitivity analysis for a particular control problem. More precisely, the boundary control problem of an open-water channel is considered, where the boundary conditions are defined by the position of a down stream overflow gate and an upper stream underflow gate. The dynamics of the water depth and of the water velocity are described by the Shallow Water equations, taking into account the bottom and friction slopes. Since some physical parameters are unknown, a stabilizing boundary control is first computed for their nominal values, and then a sensitivity anal-ysis is performed to measure the impact of the uncertainty in the parameters on a given to-be-controlled output. The unknown physical parameters are de-scribed by some probability distribution functions. Numerical simulations are performed to measure the first-order and total sensitivity indices.
Open AccessGlobal sensitivity analysis for the boundary control of an open channel
The goal of this paper is to solve the global sensitivity analysis for a particular control problem. More precisely, the boundary control problem of an open-water channel is considered, where the boundary conditions are defined by the position of a down stream overflow gate and an upper stream underflow gate. The dynamics of the water depth and of the water velocity are described by the Shallow Water equations, taking into account the bottom and friction slopes. Since some physical parameters are unknown, a stabilizing boundary control is first computed for their nominal values, and then a sensitivity anal-ysis is performed to measure the impact of the uncertainty in the parameters on a given to-be-controlled output. The unknown physical parameters are de-scribed by some probability distribution functions. Numerical simulations are performed to measure the first-order and total sensitivity indices.
- Open Access
- 11 January 2013
- Published by EDP Sciences in ESAIM: Mathematical Modelling and Numerical Analysis
- Vol. 47 (2) , 317-348
Certified reduced-basis solutions of viscous Burgers equation parametrized by initial and boundary values
We present a reduced basis offline/online procedure for viscous Burgers initial boundary value problem, enabling efficient approximate computation of the solutions of this equation for parametrized viscosity and initial and boundary value data. This procedure comes with a fast-evaluated rigorous error bound certifying the approximation procedure. Our numerical experiments show significant computational savings, as well as efficiency of the error bound.
- 11 January 2013
- Published by EDP Sciences in ESAIM: Mathematical Modelling and Numerical Analysis
- Vol. 47 (2) , 317-348
Open AccessCertified reduced-basis solutions of viscous Burgers equation parametrized by initial and boundary values
We present a reduced basis offline/online procedure for viscous Burgers initial boundary value problem, enabling efficient approximate computation of the solutions of this equation for parametrized viscosity and initial and boundary value data. This procedure comes with a fast-evaluated rigorous error bound certifying the approximation procedure. Our numerical experiments show significant computational savings, as well as efficiency of the error bound.
- Open Access
Certified reduced-basis solutions of viscous Burgers equation parametrized by initial and boundary values
We present a reduced basis offline/online procedure for viscous Burgers initial boundary value problem, enabling efficient approximate computation of the solutions of this equation for parametrized viscosity and initial and boundary value data. This procedure comes with a fast-evaluated rigorous error bound certifying the approximation procedure. Our numerical experiments show significant computational savings, as well as efficiency of the error bound.
Open AccessCertified reduced-basis solutions of viscous Burgers equation parametrized by initial and boundary values
We present a reduced basis offline/online procedure for viscous Burgers initial boundary value problem, enabling efficient approximate computation of the solutions of this equation for parametrized viscosity and initial and boundary value data. This procedure comes with a fast-evaluated rigorous error bound certifying the approximation procedure. Our numerical experiments show significant computational savings, as well as efficiency of the error bound.
- Open Access
Confidence intervals for sensitivity indices using reduced-basis metamodels
Global sensitivity analysis is often impracticable for complex and time demanding numerical models, as it requires a large number of runs. The reduced-basis approach provides a way to replace the original model by a much faster to run code. In this paper, we are interested in the information loss induced by the approximation on the estimation of sensitivity indices. We present a method to provide a robust error assessment, hence enabling significant time savings without sacrifice on precision and rigourousness. We illustrate our method with an experiment where computation time is divided by a factor of nearly 6. We also give directions on tuning some of the parameters used in our estimation algorithms.
Open AccessConfidence intervals for sensitivity indices using reduced-basis metamodels
Global sensitivity analysis is often impracticable for complex and time demanding numerical models, as it requires a large number of runs. The reduced-basis approach provides a way to replace the original model by a much faster to run code. In this paper, we are interested in the information loss induced by the approximation on the estimation of sensitivity indices. We present a method to provide a robust error assessment, hence enabling significant time savings without sacrifice on precision and rigourousness. We illustrate our method with an experiment where computation time is divided by a factor of nearly 6. We also give directions on tuning some of the parameters used in our estimation algorithms.
- Open Access
- 19 January 2011
- Published by EDP Sciences in ESAIM: Control, Optimisation and Calculus of Variations
- Vol. 18 (2) , 318-342
The Back and Forth Nudging algorithm for data assimilation problems : theoretical results on transport equations
In this paper, we consider the back and forth nudging algorithm that has been introduced for data assimilation purposes. It consists of iteratively and alternately solving forward and backward in time the model equation, with a feedback term to the observations. We consider the case of 1-dimensional transport equations, either viscous or inviscid, linear or not (Burgers’ equation). Our aim is to prove some theoretical results on the convergence, and convergence properties, of this algorithm. We show that for non viscous equations (both linear transport and Burgers), the convergence of the algorithm holds under observability conditions. Convergence can also be proven for viscous linear transport equations under some strong hypothesis, but not for viscous Burgers’ equation. Moreover, the convergence rate is always exponential in time. We also notice that the forward and backward system of equations is well posed when no nudging term is considered.
- 19 January 2011
- Published by EDP Sciences in ESAIM: Control, Optimisation and Calculus of Variations
- Vol. 18 (2) , 318-342
Open AccessThe Back and Forth Nudging algorithm for data assimilation problems : theoretical results on transport equations
In this paper, we consider the back and forth nudging algorithm that has been introduced for data assimilation purposes. It consists of iteratively and alternately solving forward and backward in time the model equation, with a feedback term to the observations. We consider the case of 1-dimensional transport equations, either viscous or inviscid, linear or not (Burgers’ equation). Our aim is to prove some theoretical results on the convergence, and convergence properties, of this algorithm. We show that for non viscous equations (both linear transport and Burgers), the convergence of the algorithm holds under observability conditions. Convergence can also be proven for viscous linear transport equations under some strong hypothesis, but not for viscous Burgers’ equation. Moreover, the convergence rate is always exponential in time. We also notice that the forward and backward system of equations is well posed when no nudging term is considered.
- Open Access
Experimental Study of the HUM Control Operator for Linear Waves
We consider the problem of the numerical approximation of the linear controllability of waves. All our experiments are done in a bounded domain \Omega of the plane, with Dirichlet boundary conditions and internal control. We use a Galerkin approximation of the optimal control operator of the continuous model, based on the spectral theory of the Laplace operator in \Omega. This allows us to obtain surprisingly good illustrations of the main theoretical results available on the controllability of waves, and to formulate some questions for the future analysis of optimal control theory of waves.
Open AccessExperimental Study of the HUM Control Operator for Linear Waves
We consider the problem of the numerical approximation of the linear controllability of waves. All our experiments are done in a bounded domain \Omega of the plane, with Dirichlet boundary conditions and internal control. We use a Galerkin approximation of the optimal control operator of the continuous model, based on the spectral theory of the Laplace operator in \Omega. This allows us to obtain surprisingly good illustrations of the main theoretical results available on the controllability of waves, and to formulate some questions for the future analysis of optimal control theory of waves.