Since the inverse problem in Diffusive Optical Tomography (DOT) is nonlinear and severely ill-posed, only low resolution reconstructions are feasible when noise is added to the data nowadays. The purpose of this thesis is to improve image reconstruction in DOT of the main optical properties of tissues with some novel mathematical methods. We have used the Landweber (L) method, the Landweber-Kaczmarz (LK) method and its improved Loping-Landweber-Kaczmarz (L-LK) method combined with sparsity or with total variation regularizations for single and simultaneous image reconstructions of the absorption and scattering coefficients. The sparsity method assumes the existence of a sparse solution which has a simple description and is superposed onto a known background. The sparsity method is solved using a smooth gradient and a soft thresholding operator. Moreover, we have proposed an improved sparsity method. For the total variation reconstruction imaging, we have used the split Bregman method and the lagged diffusivity method. For the total variation method, we also have implemented a memory-efficient method to minimise the storage of large Hessian matrices. In addition, an individual and simultaneous contrast value reconstructions are presented using the level set (LS) method. Besides, the shape derivative of DOT based on the RTE is derived using shape sensitivity analysis, and some reconstructions for the absorption coefficient are presented using this shape derivative via the LS method.\\Whereas most of the approaches for solving the nonlinear problem of DOT make use of the diffusion approximation (DA) to the radiative transfer equation (RTE) to model the propagation of the light in tissue, the accuracy of the DA is not satisfactory in situations where the medium is not scattering dominant, in particular close to the light sources and to the boundary, as well as inside low-scattering or non-scattering regions. Therefore, we have solved the inverse problem in DOT by the more accurate time-dependant RTE in two dimensions.

La première préoccupation de cette thèse est le problème de deux fluides ou un fluide à deux phases, c’est-à-dire que nous nous sommes intéressés à la simulation d’écoulements impliquant deux ou plusieurs fluides visqueux incompressibles immiscibles de propriétés mécaniques et rhéologiques différentes. Dans ce contexte, nous avons considéré que l’interface mobile entre les deux fluides est représentée par la ligne de niveau zéro d’une fonction ligne de niveau et régie par l’équation d’advection, où le champ advectant est la solution des équations de Navier-Stokes. La plupart des méthodes de capture d’interface utilisent une grille cartésienne fixe au cours de la simulation. Contrairement à ces approches, la nôtre est fortement basée sur l’adaptation de maillage, notamment au voisinage de l’interface. Cette adaptation de maillage permet une représentation précise de l’interface, à l’aide de ses propriétés géométriques, avec un nombre de degrés de liberté minimal.La résolution d'un problème à deux fluides est résumée par les étapes suivantes:- Résoudre les équations de Navier-Stokes par la méthode de Lagrange-Galerkin d’ordre 1;- Traitement géométrique la tension de surface se basant sur la discrétisation explicite de l'interface dans le domaine de calcul;- Résoudre l'équation d’advection par la méthode des caractéristiques;- Les techniques de l'adaptation de maillage.On propose ici un schéma entre l’advection de l’interface, la résolution des équations de Navier-Stokes et l’adaptation de maillage. Certains résultats des exemples classiques pour les deux problèmes de monofluide et bifluide comme la cavité entrainée, la rémontée d’une bulle, la coalescence de deux bulles et les instabilités Rayleigh-Taylor sont étudiés en deux et trois dimensions.La deuxième partie de cette thèse est liée à l'optimisation des formes en mécanique des fluides. Nous construisons un schéma numérique en utilisant la méthode des lignes de niveau et l’adaptation de maillage dans le contexte des systèmes de Stokes. Le calcul de la sensibilité de la fonction objective est liée à la méthode de variation des limites d’Hadamard et les dérivées des formes sont calculées par la méthode de Céa. Un exemple numérique avec la fonction objective de la dissipation d'énergie est présenté pour évaluer l'efficacité et la fiabilité du schéma proposé. / The first concern of this thesis is the problem of two fluids flow or two-phase flow, i.e weare interested in the simulation of the evolution of an interface (or a free surface) between twoimmiscible viscous fluids or two phases of a fluid. We propose a general scheme for solving two fluids flow or two-phase flow which takes advantage of the flexibility of the level set method for capturing evolution of the interfaces, including topological changes. Unlike similar approaches that solve the flow problem and the transport equation related to the evolution of the interface on Cartesian grids, our approach relies on an adaptive unstructured mesh to carry out these computations and enjoys an exact and accurate description of the interface. The explicit representation of the manifold separating the two fluids will be extracted to compute approximately the surface tension as well as some algebraic quantities like the normal vector and the curvature at the interface.In a nutshell, the resolution of a two-fluid problem is summarized by the steps involves thefollowing ingredients:– solving incompressible Navier-Stokes equations by the first order Lagrange-Galerkin method;– geometrical treatment to evaluate the surface tension basing on the explicit discretisation of the interface;– solving the level set advection by method of characteristics; – the techniques of mesh adaptation.It is obvious that no numerical method is completely exact in solving the PDE problemat hand, hence, we need a discretized computational domain. However, the accuracy of numericalsolutions or the mass loss/gain can generally be improved with mesh refinement. The question thatarises is related to where and how to refine the mesh. At each time, our mesh adaptation producesthe adapted mesh based on the geometric properties of the interface and the physical properties ofthe fluid, simply speaking, only one adapted mesh at each time step to assume both the resolutionof Navier-Stokes and the advection equations. It answers to the need for an accurate representationof the interface and an accurate approximation of the velocity of fluids with a minimal number ofelements, then decreasing the amount of computational time. Some results of the classical examples for both problems of monofluid and bifluid flows as : lid-driven cavity, rising bubble, coalescence of two bubbles, and Rayleigh-Taylor instability are investigated in two and three dimensions.The second part of this thesis is related to shape optimization in fluid mechanics. We construct a numerical scheme using level set method and mesh adaptation in the context of Stokes systems. The computation of the sensitivity of objective function is related to the Hadamard’s boundary variation method and the shape derivatives is computed by Céa’s formal method. A numerical example with theobjective function of energy dissipation is presented to assess the efficiency and the reliability of theproposed scheme.

Cette thèse se développe sur deux fronts: nous nous concentrons sur les méthodes numériques des problèmes de contrôle optimal, en particulier sur le Principe de la Programmation Dynamique et sur le Model Predictive Control (MPC) et nous présentons des applications de techniques de contrôle en biologie. Dans la première partie, nous considérons l'approximation d'un problème de contrôle optimal avec horizon infini, qui combine une première étape, basée sur MPC permettant d'obtenir rapidement une bonne approximation de la trajectoire optimal, et une seconde étape, dans la quelle l¿équation de Bellman est résolue dans un voisinage de la trajectoire de référence. De cette façon, on peux réduire une grande partie de la taille du domaine dans lequel on résout l¿équation de Bellman et diminuer la complexité du calcul. Le deuxième sujet est le contrôle des méthodes Level Set: on considère un problème de contrôle optimal, dans lequel la dynamique est donnée par la propagation d'un graphe à une dimension, contrôlé par la vitesse normale. Un état finale est fixé, l'objectif étant de le rejoindre en minimisant une fonction coût appropriée. On utilise la programmation dynamique grâce à une réduction d'ordre de l'équation utilisant la Proper Orthogonal Decomposition. La deuxième partie est dédiée à l'application des méthodes de contrôle en biologie. On présente un modèle décrit par une équation aux dérivées partielles qui modélise l'évolution d'une population de cellules tumorales. On analyse les caractéristiques du modèle et on formule et résout numériquement un problème de contrôle optimal concernant ce modèle, où le contrôle représente la quantité du médicament administrée. / This thesis is divided in two parts: in the first part we focus on numerical methods for optimal control problems, in particular on the Dynamic Programming Principle and on Model Predictive Control (MPC), in the second part we present some applications of the control techniques in biology. In the first part of the thesis, we consider the approximation of an optimal control problem with an infinite horizon, which combines a first step based on MPC, to obtain a fast but rough approximation of the optimal trajectory and a second step where we solve the Bellman equation in a neighborhood of the reference trajectory. In this way, we can reduce the size of the domain in which the Bellman equation can be solved and so the computational complexity is reduced as well. The second topic of this thesis is the control of the Level Set methods: we consider an optimal control, in which the dynamics is given by the propagation of a one dimensional graph, which is controlled by the normal velocity. A final state is fixed and the aim is to reach the trajectory chosen as a target minimizing an appropriate cost functional. To apply the Dynamic Programming approach we firstly reduce the size of the system using the Proper Orthogonal Decomposition. The second part of the thesis is devoted to the application of control methods in biology. We present a model described by a partial differential equation that models the evolution of a population of tumor cells. We analyze the mathematical and biological features of the model. Then we formulate an optimal control problem for this model and we solve it numerically.

Optimal control (motion planning) of the free interface in classical two-phase Stefan problems is considered. The evolution of the free interface is modeled by a level set function. The first-order optimality system is derived on a formal basis. It provides gradient information based on the adjoint temperature and adjoint level set function. Suitable discretization schemes for the forward and adjoint systems are described. Numerical examples verify the correctness and flexibility of the proposed scheme.:1 Introduction 2 Model Equations 3 The Optimal Control Problem and Optimality Conditions 4 Discretization of the Forward and Adjoint Systems 5 Numerical Results 6 Discussion and Conclusion A Formal Derivation of the Optimality Conditions B Transport Theorems and Shape Calculus

Cette thèse est consacrée à la dérivation des modèles de fracture comme limite de modèles d'endommagement.L'étude est justifiée essentiellement à travers des simulations numériques.On s'intéresse à étudier un modèle d'endommagement initié par Allaire, Jouve et Vangoethem.Nous apportons des améliorations significatives à ce modèle justifiant la cohérence physique de cette approche.D'abord, on ajoute une contrainte sur l'épaisseur minimale de la zone endommagée, puis on ajoute la condition d'irréversibilité forte.Nous considérons en outre un modèle de fracture avec pénalisation de saut obtenu comme limite asymptotique d'un modèle d'endommagement.Nous justifions ce modèle par une étude numérique et asymptotique formelle unidimensionnelle.Ensuite, la généralisation dans le cas 2D est illustrée par des exemples numériques. / This thesis is devoted to the derivation of fracture models as limit damage models.The study is justified mainly through numerical simulations.We are interested in studying a damage model initiated by Allaire, Jouve and Vangoethem.We are making significant improvements to this model justifying the physical consistency of the approach.First, we add a constraint on the minimum thickness of the damaged area and then we add a condition of strong irreversibility.We see also a fracture model with jump penalization obtained as an asymptotic limit of a damage model.We justify this model by a one-dimensional formal asymptotic numerical study.Then, the generalization in the case 2D is illustrated by numerical examples.

No description available.

This project presents the development and implementation of a GPU-accelerated meshless two-phase incompressible fluid flow solver. The solver uses a variant of the Generalized Finite Difference Meshless Method presented by Gerace et al. [1]. The Level Set Method [2] is used for capturing the fluid interface. The Compute Unified Device Architecture (CUDA) language for general-purpose computing on the graphics-processing-unit is used to implement the GPU-accelerated portions of the solver. CUDA allows the programmer to take advantage of the massive parallelism offered by the GPU at a cost that is significantly lower than other parallel computing options. Through the combined use of GPU-acceleration and a radial-basis function (RBF) collocation meshless method, this project seeks to address the issue of speed in computational fluid dynamics. Traditional mesh-based methods require a large amount of user input in the generation and verification of a computational mesh, which is quite time consuming. The RBF meshless method seeks to rectify this issue through the use of a grid of data centers that need not meet stringent geometric requirements like those required by finite-volume and finite-element methods. Further, the use of the GPU to accelerate the method has been shown to provide a 16-fold increase in speed for the solver subroutines that have been accelerated.

No description available.

Underwater explosions (UNDEX) and a ship's vulnerability to them are problems of interest in early-stage ship design. A series of events occur sequentially in an UNDEX scenario in both the fluid and structural domains and these events happen over a wide range of time and spatial scales. Because of the complexity of the physics involved, it is a common practice to separate the description of UNDEX into early-time and late-time, and far-field and near-field. The research described in this dissertation is focused on the simulation of near-field and early-time UNDEX. It assembles a hybrid framework of algorithms to provide results while maintaining computational efficiency. These algorithms include Runge-Kutta, Discontinuous Galerkin, Level Set, Direct Ghost Fluid and Embedded Boundary methods. Computational fluid dynamics (CFD) solvers are developed using this framework of algorithms to demonstrate the computational methods and their ability to effectively and efficiently solve UNDEX problems. Contributions, made in the process of satisfying the objective of this research include: the derivation of eigenvectors of flux Jacobians and their application to the implementation of the slope limiter in the fluid discretization; the three-dimensional extension of Direct Ghost Fluid Method and its application to the multi-fluid treatment in UNDEX flows; the enforcement of an improved non-reflecting boundary condition and its application to UNDEX simulations; and an improvement to the projection-based embedded boundary method and its application to fluid-structure interaction simulations of UNDEX problems. / Doctor of Philosophy / Underwater explosions (UNDEX) and a ship's vulnerability to them are problems of interest in early-stage ship design. A series of events occur sequentially in an UNDEX scenario in both the fluid and structural domains and these events happen over a wide range of time and spatial scales. Because of the complexity of the physics involved, it is a common practice to separate the description of UNDEX into early-time and late-time, and far-field and near-field. The research described in this dissertation is focused on the simulation of near-field and early-time UNDEX. It assembles a hybrid framework of algorithms to provide results while maintaining computational efficiency. These algorithms include Runge-Kutta, Discontinuous Galerkin, Level Set, Direct Ghost Fluid and Embedded Boundary methods. Computational fluid dynamics (CFD) solvers are developed using this framework of algorithms to demonstrate these computational methods and their ability to effectively and efficiently solve UNDEX problems.

Cette thèse est divisée en trois chapitres. Le premier explique comment utiliser la méthode «level-set» de manière rigoureuse pour faire la simulation de feux de forêt en utilisant comme modèle physique pour la propagation le modèle de l'ellipse de Richards. Le second présente un nouveau schéma semi-implicite avec une preuve de convergence pour la solution d'une équation de type Hamilton-Jacobi anisotrope. L'avantage principal de cette méthode est qu'elle permet de réutiliser des solutions à des problèmes «proches» pour accélérer le calcul. Une autre application de ce schéma est l'homogénéisation. Le troisième chapitre montre comment utiliser les méthodes numériques des deux premiers chapitres pour étudier l'influence de variations à petites échelles dans la vitesse du vent sur la propagation d'un feu de forêt à l'aide de la théorie de l'homogénéisation. / This thesis is divided in three chapters. The first explains how to use the level-set method in a rigorous way in the context of forest fire simulation when the physical propagation model for firespread is Richards' ellipse model. The second chapter presents a new semi-implicit scheme with a proof of convergence for the numerical solution of an anisotropic Hamilton-Jacobi partial differential equation. The advantage of this scheme is it allows the use of approximative solutions as initial conditions which reduces the computation time. The third chapter shows how to use the tools introduced in the first two chapters to study the influence of small-scale variations on the wind speed on firespread using the theory of homogenization.