Approximation numérique d'une inéquation quasi variationnelle liée à des problèmes de gestion de stock
We give results for the approximation of a laminate with varying volume fractions for multi-well energy minimization problems modeling martensitic crystals that can undergo either an orthorhombic to monoclinic or a cubic to tetragonal transformation. We construct energy minimizing sequences of deformations which satisfy the corresponding boundary condition, and we establish a series of error bounds in terms of the elastic energy for the approximation of the limiting macroscopic deformation and...
A two-dimensional Stefan problem is usually introduced as a model of solidification, melting or sublimation phenomena. The two-phase Stefan problem has been studied as a direct problem, where the free boundary separating the two regions is eliminated using a variational inequality (Baiocchi, 1977; Baiocchi et al., 1973; Rodrigues, 1980; Saguez, 1980; Srunk and Friedman, 1994), the enthalpy function (Ciavaldini, 1972; Lions, 1969; Nochetto et al., 1991; Saguez, 1980), or a control problem (El Bagdouri,...
In this paper we study an approximation scheme for a class of control problems involving an ordinary control v, an impulsive control u and its derivative . Adopting a space-time reparametrization of the problem which adds one variable to the state space we overcome some difficulties connected to the presence of . We construct an approximation scheme for that augmented system, prove that it converges to the value function of the augmented problem and establish an error estimates in L∞ for this approximation....
This article deals with the numerical computation of the Cheeger constant and the approximation of the maximal Cheeger set of a given subset of . This problem is motivated by landslide modelling as well as by the continuous maximal flow problem. Using the fact that the maximal Cheeger set can be approximated by solving a rather simple projection problem, we propose a numerical strategy to compute maximal Cheeger sets and Cheeger constants.
This article deals with the numerical computation of the Cheeger constant and the approximation of the maximal Cheeger set of a given subset of . This problem is motivated by landslide modelling as well as by the continuous maximal flow problem. Using the fact that the maximal Cheeger set can be approximated by solving a rather simple projection problem, we propose a numerical strategy to compute maximal Cheeger sets and Cheeger constants.
We construct a guided continuous selection for lsc multifunctions with decomposable values in L¹[0,T]. We then apply it to obtain a new result on the uniform approximation of relaxed solutions for lsc differential inclusions.
We propose and analyze numerical schemes for viscosity solutions of time-dependent Hamilton-Jacobi equations on the Heisenberg group. The main idea is to construct a grid compatible with the noncommutative group geometry. Under suitable assumptions on the data, the Hamiltonian and the parameters for the discrete first order scheme, we prove that the error between the viscosity solution computed at the grid nodes and the solution of the discrete problem behaves like where h is the mesh step. Such...
This paper provides a convergent numerical approximation of the Pareto optimal set for finite-horizon multiobjective optimal control problems in which the objective space is not necessarily convex. Our approach is based on Viability Theory. We first introduce a set-valued return function V and show that the epigraph of V equals the viability kernel of a certain related augmented dynamical system. We then introduce an approximate set-valued return function with finite set-values as the solution of...
We establish some error estimates for the approximation of an optimal stopping problem along the paths of the Black–Scholes model. This approximation is based on a tree method. Moreover, we give a global approximation result for the related obstacle problem.
We establish some error estimates for the approximation of an optimal stopping problem along the paths of the Black–Scholes model. This approximation is based on a tree method. Moreover, we give a global approximation result for the related obstacle problem.