Anmerkungen zu einem Mehrgitterverfahren für lineare Komplementaritätsprobleme.
Application des sentinelles à l'identification des pollutions dans une rivière
Application of relaxation scheme to degenerate variational inequalities
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.
Application of Rothe's method to evolution integrodifferential equations.
Application of the infinitely many times repeated BNS update and conjugate directions to limited-memory optimization methods
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...
Applications of Fixed-Point Methods to Discrete Variational and Quasi-Variational Inequalities.
Approximate solution of stochastic programming problems with recourse
Approximation and regularization of arbitrary functions in Hilbert spaces by the Lasry-Lions method
Approximation and/or construction of curves by minimization methods with or without constraints
Approximation numérique des équations Hamilton-Jacobi-Bellman
Approximation numérique d'une inéquation quasi variationnelle liée à des problèmes de gestion de stock
Approximation of maximal Cheeger sets by projection
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.
Approximation of maximal Cheeger sets by projection
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.
Approximation of Optimal Distributed Control Problems Governed by Variational Inequalities.
Approximations of parabolic variational inequalities
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...
Approximations to Stochastic Programs with Complete Fixed Recourse.
Area of contraction of Newton's method applied to a penalty technique for obstacle problems
Asymptotische Fehlerschranken für Rayleigh-Ritz-Approximationen selbstadjungierter Eigenwertaufgaben.
Automatic differentiation and its program realization
Automatic differentiation is an effective method for evaluating derivatives of function, which is defined by a formula or a program. Program for evaluating of value of function is by automatic differentiation modified to program, which also evaluates values of derivatives. Computed values are exact up to computer precision and their evaluation is very quick. In this article, we describe a program realization of automatic differentiation. This implementation is prepared in the system UFO, but its...
Bemerkungen zum Verfahren der koordinatenweisen Suche
In der vorliegenden Arbeit wird das Verfahren der koordinatenweisen Suche mit Hilfe der Intervallarithmetik realisiert. Dadurch ist es möglich, bei speziellen nichtlinearen Optimierungsproblemen alle auftretenden Fehlerarten zu erfaßen, einschliesslich eingangsbedingter Fehler. Vor- und Nachteile werden erläutert sowie Testbeispiele angegeben.