Abstract evolution equations on variable domains : an approach by minimizing movements
A class of quasi-variational inequalities (QVI) of elliptic type is studied in reflexive Banach spaces. The concept of QVI was earlier introduced by A. Bensoussan and J.-L. Lions [2] and its general theory has been developed by many mathematicians, for instance, see [6, 7, 9, 13] and a monograph [1]. In this paper we give a generalization of the existence theorem established in [14]. In our treatment we employ the compactness method along with a concept of convergence of nonlinear multivalued operators...
∗ The work is partially supported by NSFR Grant No MM 409/94.We develop an abstract subdifferential calculus for lower semicontinuous functions and investigate functions similar to convex functions. As application we give sufficient conditions for the integrability of a lower semicontinuous function.
Recently, we established some generalizations of the theory of Lagrange multipliers arising from nonlinear programming in Banach spaces, which enable us to treat not only elliptic problems but also parabolic problems in the same generalized framework. The main objective of the present paper is to discuss a typical time-dependent double obstacle problem as a new application of the above mentioned generalization. Actually, we describe it as a usual parabolic variational inequality and then characterize...
Existence results for a class of one-dimensional abstract variational problems with volume constraints are established. The main assumptions on their energy are additivity, translation invariance and solvability of a transition problem. These general results yield existence results for nonconvex problems. A counterexample shows that a naive extension to higher dimensional situations in general fails.
Existence results for a class of one-dimensional abstract variational problems with volume constraints are established. The main assumptions on their energy are additivity, translation invariance and solvability of a transition problem. These general results yield existence results for nonconvex problems. A counterexample shows that a naive extension to higher dimensional situations in general fails.
The optimal experiment for estimating the parameters of a nonlinear regression model usually depends on the value of these parameters, hence the problem of designing experiments that are robust with respect to parameter uncertainty. Sequential designpermits to adapt the experiment to the value of the parameters, and can thus be considered as a robust design procedure. By designing theexperiments sequentially, one introduces a feedback of information, and thus dynamics, into the design procedure....
We examine shape optimization problems in the context of inexact sequential quadratic programming. Inexactness is a consequence of using adaptive finite element methods (AFEM) to approximate the state and adjoint equations (via the dual weighted residual method), update the boundary, and compute the geometric functional. We present a novel algorithm that equidistributes the errors due to shape optimization and discretization, thereby leading to coarse resolution in the early stages and fine resolution...
Long time simulations of transport equations raise computational challenges since they require both a large domain of calculation and sufficient accuracy. It is therefore advantageous, in terms of computational costs, to use a time varying adaptive mesh, with small cells in the region of interest and coarser cells where the solution is smooth. Biological models involving cell dynamics fall for instance within this framework and are often non conservative to account for cell division. In that case...
We investigate the control of dynamical networks for the case of nodes, that although different, can be make passive by feedback. The so-called V-stability characterization allows for a simple set of stabilization conditions even in the case of nonidentical nodes. This is due to the fact that under V-stability characterization the dynamical difference between node of a network reduces to their different passivity degrees, that is, a measure of the required feedback gain necessary to make the node...
The adjoint method, recently introduced by Evans, is used to study obstacle problems, weakly coupled systems, cell problems for weakly coupled systems of Hamilton − Jacobi equations, and weakly coupled systems of obstacle type. In particular, new results about the speed of convergence of some approximation procedures are derived.