In this paper we are concerned with the solution of degenerate variational inequalities. To solve this problem numerically, we propose a numerical scheme which is based on the relaxation scheme using non-standard time discretization. The approximate solution on each time level is obtained in the iterative way by solving the corresponding elliptic variational inequalities. The convergence of the method is proved.
To improve the performance of the L-BFGS method for large scale unconstrained optimization, repeating of some BFGS updates was proposed e.g. in [1]. Since this can be time consuming, the extra updates need to be selected carefully. We show that groups of these updates can be repeated infinitely many times under some conditions, without a noticeable increase of the computational time; the limit update is a block BFGS update [17]. It can be obtained by solving of some Lyapunov matrix equation whose...
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.
The paper deals with an initial problem of a parabolic variational inequality whichcontains a nonlinear elliptic form having a potential , which is twice -differentiable at arbitrary . This property of makes it possible to prove convergence of an approximate solution defined by a linearized scheme which is fully discretized - in space by the finite elements method and in time by a one-step finite-difference method. Strong convergence of the approximate solution is proved without any regularity...
In topology optimization problems, we are often forced to deal with large-scale numerical problems, so that the domain decomposition method occurs naturally. Consider a typical topology optimization problem, the minimum compliance problem of a linear isotropic elastic continuum structure, in which the constraints are the partial differential equations of linear elasticity. We subdivide the partial differential equations into two subproblems posed...
The well-known bottleneck of systems pharmacology, i. e., systems biology applied to pharmacology, refers to the model parameters determination from experimentally measured datasets. This paper represents the development of our earlier studies devoted to inverse (ill-posed) problems of model parameters identification. The key feature of this research is the introduction of control (or periodic forcing by an input signal being a drug intake) of the nonlinear model of drug-induced enzyme production...