In this paper is presented the problem of optimizing a functional over a Pareto control set associated with a convex multiobjective control problem in Hilbert spaces, namely parabolic system. This approach generalizes for this setting some results obtained in finite dimensions. Some examples are presented. General optimality results are obtained, and a special attention is paid to the linear-qu...

We propose a time-space discretization scheme for quasi-linear parabolic PDEs. The algorithm relies on the theory of fully coupled Forward-Backward SDEs, which provides an efficient probabilistic representation of this type of equations. The derivated algorithm holds for strong solutions defined on any interval of arbitrary length. As a bypass product, we obtain a discretization procedure for t...

We use the local orthogonal decomposition technique introduced in Målqvist and Peterseim (Math Comput 83(290):2583-2603, 2014) to derive a generalized finite element method for linear and semilinear parabolic equations with spatial multiscale coefficients. We consider nonsmooth initial data and a backward Euler scheme for the temporal discretization. Optimal order convergence rate, depending on...

The aim of this set of lectures is to present the theory of backward stochastic differential equations, in short BSDEs, and its connections with viscosity solutions of systems of semi– linear second order partial differential equations of parabolic and elliptic type, in short PDEs. Linear BSDEs have appeared long time ago, both as the equations for the adjoint process in stochastic control, as ...

The backward error analysis is of the great importance in the analysis of numerical stability of algorithms in finite precision arithmetic and backward errors are also often employed in stopping criteria of iterative methods for solving systems of linear algebraic equations. The backward error measures how far we must perturb the data of the linear system so that the computed approximation solv...

It is shown that for a parabolic problem with maximal Lp-regularity (for 1 < p < ∞), the time discretization by a linear multistep method or Runge–Kutta method has maximal `p-regularity uniformly in the stepsize if the method is A-stable (and satisfies minor additional conditions). In particular, the implicit Euler method, the Crank–Nicolson method, the second-order backward difference formula ...