SearcharxivSearch

arXiv subjects

Martin Lazar

Publications and source records attributed to Martin Lazar.

11 recordsLinked to original sources

Overcoming slow Kolmogorov width decay in parametric optimal control via neural network surrogates

In this paper we deal with parametric, linear-quadratic optimal control problems in which the solution can be uniquely characterized by the optimal final time adjoint state. As a motivating example, we establish theoretical results showing that for distributed control of the heat equation, the manifold of final time adjoints over the parameter space exhibits a slow decay of its Kolmogorov width if this was already the case for the parameter-dependent target states. Traditional linear reduced-order models would thus require a large reduced space in order to guarantee a sufficient accuracy, making them inefficient in this application. To overcome the limitation of linear models, we discuss a nonlinear surrogate based on U-Nets that maps parametric fields to approximate final time adjoints. We show that a suitable a posteriori error estimator remains applicable to the U-Net approximation and can be used to certify the surrogate results. Through two extensive numerical experiments, we show the potential of the U-Net surrogate and compare it with several linear and nonlinear methods from the literature. The results show that the U-Net consistently achieves the highest accuracy among the methods considered while requiring significantly fewer training samples.

math.OC

Averaged observations and turnpike phenomenon for parameter-dependent systems

Our main contribution in this article is the achievement of the turnpike property in its integral and exponential forms for parameter-dependent systems with averaged observations in the cost functional. Namely, under suitable assumptions with respect to the matrices that defined the dynamics and the cost functional, we prove that the optimal control and state for the evolutionary problem converge in average to the optimal pair of an associated stationary problem. Moreover, we characterize the closeness between these two optimal solutions, proving that over a large time interval, they are exponentially close.

math.OC

Be greedy and learn: efficient and certified algorithms for parametrized optimal control problems

We consider parametrized linear-quadratic optimal control problems and provide their online-efficient solutions by combining greedy reduced basis methods and machine learning algorithms. To this end, we first extend the greedy control algorithm, which builds a reduced basis for the manifold of optimal final time adjoint states, to the setting where the objective functional consists of a penalty term measuring the deviation from a desired state and a term describing the control energy. Afterwards, we apply machine learning surrogates to accelerate the online evaluation of the reduced model. The error estimates proven for the greedy procedure are further transferred to the machine learning models and thus allow for efficient a posteriori error certification. We discuss the computational costs of all considered methods in detail and show by means of two numerical examples the tremendous potential of the proposed methodology.

math.OC

Greedy search of optimal approximate solutions

In this paper we develop a procedure to deal with a family of parameter-dependent ill-posed problems, for which the exact solution in general does not exist. The original problems are relaxed by considering corresponding approximate ones, whose optimal solutions are well dfined, where the optimality is determined by the minimal norm requirement. The procedure is based upon greedy algorithms that preserve, at least asymptotically, Kolmogorov approximation rates. In order to provide a-priori estimates for the algorithm, a Tychonff-type regularization is applied, which adds an additional parameter to the model. The theory is developed in an abstract theoretical framework that allows its application to different kinds of problems. We present a specific example that considers a family of ill-posed elliptic problems. The required general assumptions in this case translate to rather natural uniform lower and upper bounds on coefficients of the considered operators.

math.AP

Optimal control of parabolic equations -- a spectral calculus based approach

In this paper we consider a constrained parabolic optimal control problem. The cost functional is quadratic and it combines the distance of the trajectory of the system from the desired evolution profile together with the cost of a control. The constraint is given by a term measuring the distance between the final state and the desired state towards which the solution should be steered. The control enters the system through the initial condition. We present a geometric analysis of this problem and provide a closed-form expression for the solution. This approach allows us to present the sensitivity analysis of this problem based on the resolvent estimates for the generator of the system. The numerical implementation is performed by exploring efficient rational Krylov approximation techniques that allow us to approximate a complex function of an operator by a series of linear problems. Our method does not depend on the actual choice of discretization. The main approximation task is to construct an efficient rational approximation of a generalized exponential function. It is well known that this class of functions allows exponentially convergent rational approximations, which, combined with the sensitivity analysis of the closed form solution, allows us to present a robust numerical method. Several case studies are presented to illustrate our results.

math.OC

Greedy controllability of finite dimensional linear systems

We analyse the problem of controllability for parameter-dependent linear finite-dimensional systems. The goal is to identify the most distinguished realisations of those parameters so to better describe or approximate the whole range of controls. We adapt recent results on greedy and weak greedy algorithms for parameter depending PDEs or, more generally, abstract equations in Banach spaces. Our results lead to optimal approximation procedures that, in particular, perform better than simply sampling the parameter-space to compute the controls for each of the parameter values. We apply these results for the approximate control of finite-difference approximations of the heat and the wave equation. The numerical experiments confirm the efficiency of the methods and show that the number of weak-greedy samplings that are required is particularly low when dealing with heat-like equations, because of the intrinsic dissipativity that the model introduces for high frequencies.

math.OC

Exploring limit behaviour of non-quadratic terms via H-measures. Application to small amplitude homogenisation

A method is developed for analysing asymptotic behaviour of terms involving an arbitrary integer order powers of L p functions by means of H-measures. It is applied to the small amplitude homogenisation problem for a stationary diffusion equation, in which coefficients are assumed to be analytic perturbations of a constant, enabling formulæ for higher order correction terms in a general, non-periodic setting. Explicit expressions in terms of Fourier coefficients are obtained under periodicity assumption. The method enables its generalisation and application to the corresponding non-stationary equation, as well as to some other small amplitude homogenisation problems.

math.AP

Localisation principle for one-scale H-measures

Microlocal defect functionals (H-measures, H-distributions, semiclassical measures, etc.) are objects which determine, in some sense, the lack of strong compactness for weakly convergent ${\rm L}^p$ sequences. Recently, Luc Tartar introduced one-scale H-measures, a generalisation of H-measures with a characteristic length, which also comprehend the notion of semiclassical measures. We present a self-contained introduction to one-scale H-measures, carrying out some alternative proofs, and strengthening some results, comparing these objects to known microlocal defect functionals. Furthermore, we improve and generalise Tartar's localisation principle for these objects from which we are able to derive the known localisation principles for both H-measures and semiclassical measures. Moreover, we develop a variant of compactness by compensation suitable for equations with a characteristic length.

math.AP

Stability of Observations of Partial Differential Equations under Uncertain Perturbations

We analyse stability of observability estimates for solutions to wave and Scr\" odinger equations subjected to additive perturbations. The paper generalises the recent averaged observability/control result by allowing for systems consisting of operators of different types. The method also applies to the simultaneous observability problem by which one tries to estimate the energy of each component of a system under consideration. The analysis relies on microlocal defect tools; in particular on standard H-measures, when the main dynamic of the system is governed by the wave operator, while parabolic H-measures are explored in the case of the Schr\" odinger operator.

math.AP

On the velocity averaging for equations with optimal heterogeneous rough coefficients

Assume that $(u_n)$ is a sequence of solutions to heterogeneous equations with rough coefficients and fractional derivatives, weakly converging to zero in ${\rm L}^p(\R^{d+m})$, with $p>1$. We prove that the sequence of averaged quantities $(\int ρ(\my) u_n(\mx,\my) d\my)$ is strongly precompact in $\Ljl\Rd$ for any $ρ\in \Cc{\R^m}$, provided that restrictive non-degeneracy conditions are satisfied. These are fulfilled for elliptic, parabolic, fractional convection-diffusion equations, as well as for parabolic equations with a fractional time derivative. The main tool that we are using is an adapted version of H-distributions. As a consequence of the introduced methods, we obtain an optimal velocity averaging result in the $\LL p$, $p\geq 2$, framework under the standard non-degeneracy conditions, as well as a connection between the H-measures and the H-distributions.

math.AP

Velocity averaging -- a general framework

We prove that the sequence of averaged quantities $\int_{\R^m}u_n(\mx,\msnop)$ $ρ(\msnop)d\msnop$, is strongly precompact in $\Ldl\Rd$, where $ρ\in \Ldc{\R^m}$, and $u_n\in \Ld{\R^m; \pL s\Rd}$, $s\geq 2$, are weak solutions to differential operator equations with variable coefficients. In particular, this includes differential operators of hyperbolic, parabolic or ultraparabolic type, but also fractional differential operators. If $s>2$ then the coefficients can be discontinuous with respect to the space variable $\mx\in \R^d$, otherwise, the coefficients are continuous functions. In order to obtain the result we prove a representation theorem for an extension of the $H$-measures.

math.AP