arXiv Analytics

Sign in

arXiv:2406.13612 [math.OC]AbstractReferencesReviewsResources

On Computation of Approximate Solutions to Large-Scale Backstepping Kernel Equations via Continuum Approximation

Jukka-Pekka Humaloja, Nikolaos Bekiaris-Liberis

Published 2024-06-19Version 1

We provide two methods for computation of continuum backstepping kernels that arise in control of continua (ensembles) of linear hyperbolic PDEs and which can approximate backstepping kernels arising in control of a large-scale, PDE system counterpart (with computational complexity that does not grow with the number of state components of the large-scale system). In the first method, we identify a class of systems for which the solution to the continuum (and hence, also an approximate solution to the respective large-scale) kernel equations can be constructed in closed form. In the second method, we provide explicit formulae for the solution to the continuum kernels PDEs, employing a (triple) power series representation of the continuum kernel and establishing its convergence properties. In this case, we also provide means for reducing computational complexity by properly truncating the power series (in the powers of the ensemble variable). We also present numerical examples to illustrate computational efficiency/accuracy of the approaches, as well as to validate the stabilization properties of the approximate control kernels, constructed based on the continuum.

Comments: 13 pages, 5 figures, submitted to Systems & Control Letters
Categories: math.OC, cs.SY, eess.SY
Related articles: Most relevant | Search more
arXiv:1601.07629 [math.OC] (Published 2016-01-28)
The Computational Complexity of Duality
arXiv:1712.06723 [math.OC] (Published 2017-12-19)
A multi-criteria approach to approximate solution of multiple-choice knapsack problem
arXiv:1012.5568 [math.OC] (Published 2010-12-27, updated 2011-11-15)
Duality Gap, Computational Complexity and NP Completeness: A Survey