pith. sign in

arxiv: 1601.02817 · v3 · pith:TTCYUFG4new · submitted 2016-01-12 · 🧮 math.OC

Greedy controllability of finite dimensional linear systems

classification 🧮 math.OC
keywords greedyresultsapproximatebettercontrollabilitycontrolsequationslinear
0
0 comments X
read the original abstract

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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.