Greedy controllability of finite dimensional linear systems
From MaRDI portal
Publication:340699
DOI10.1016/J.AUTOMATICA.2016.08.010zbMATH Open1348.93051arXiv1601.02817OpenAlexW2234752102MaRDI QIDQ340699FDOQ340699
Publication date: 14 November 2016
Published in: Automatica (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/1601.02817
Controllability (93B05) Control/observation systems governed by partial differential equations (93C20) Control/observation systems in abstract spaces (93C25)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Sharp Sufficient Conditions for the Observation, Control, and Stabilization of Waves from the Boundary
- Propagation, Observation, and Control of Waves Approximated by Finite Difference Methods
- Convergence Rates for Greedy Algorithms in Reduced Basis Methods
- A certified reduced basis method for parametrized elliptic optimal control problems
- \textit{A priori} convergence of the greedy algorithm for the parametrized reduced basis method
- Mathematical control theory: an introduction
- Averaged control
- Averaged control and observation of parameter-depending wave equations
- Greedy algorithms for reduced bases in Banach spaces
- Controllability and Observability in Banach Space with Bounded Operators
- Kolmogorov widths under holomorphic mappings
- OPTIMAL DESIGN OF LOW-CONTRAST TWO-PHASE STRUCTURES FOR THE WAVE EQUATION
- Approximation of high-dimensional parametric PDEs
- Reduced basis a posteriori error bounds for parametrized linear-quadratic elliptic optimal control problems
Cited In (12)
- Robust averaged control of vibrations for the Bernoulli-Euler beam equation
- Greedy algorithm for parameter dependent operator Lyapunov equations
- Turnpike in optimal control of PDEs, ResNets, and beyond
- Probability-of-failure-based optimization for random PDEs through concentration-of-measure inequalities
- Global controllability for quasilinear nonnegative definite system of ODEs and SDEs
- Lipschitz dependence of the coefficients on the resolvent and greedy approximation for scalar elliptic problems
- Solving fully randomized first-order linear control systems: application to study the dynamics of a damped oscillator with parametric noise under stochastic control
- The Vlasov-Fokker-Planck equation with high dimensional parametric forcing term
- Full probabilistic solution of a finite dimensional linear control system with random initial and final conditions
- Be greedy and learn: efficient and certified algorithms for parametrized optimal control problems
- Control of partial differential equations via physics-informed neural networks
- Greedy optimal control for elliptic problems and its application to turnpike problems
This page was built for publication: Greedy controllability of finite dimensional linear systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q340699)
