Reliable Computation of the L∞-Norm of Linear Time-Invariant Systems Depending on One Parameter
Florent Corniquel, Alban Quadrat, Fabrice Rouillier, Grace Younes
Abstract
The L∞-norm of a linear time-invariant system is a central quantity in robust control, used in robust stability tests, stability margins, and H∞ controller design. Physical models depend on parameters, such as masses, stiffnesses, or gains, so the L∞-norm becomes a function of these parameters. This computation reduces to studying the real critical points of a plane algebraic curve whose coefficients depend on the parameters. Previous approaches based on cylindrical algebraic decomposition describe the L∞-norm on the whole parameter space, but their cost grows very quickly with the number of parameters. In this paper, we propose instead to compute a generic parametrisation of the solutions, valid outside an explicitly characterised set of non-generic parameter values. In the case of one parameter, this parametrisation is obtained by interpolation from a certified solver for the non-parametric case. The resulting algorithm is fully certified, relying on a priori bounds and multimodular computations rather than on Gröbner bases. It is illustrated on examples from the robust control literature.
Create a lesson
Related papers
Partial Homogenization and the Structure of Optimal Algebraic Algorithms
Yuval Spiizer
A Survey on the Use of Machine Learning within Computer Algebra
Uzma Shafiq, Matthew England, Nayyar Zaidi
Floating-point, exact and certified computation for control: paradigms, pitfalls, and how to combine them
Christina Katsamaki, Fabrice Rouillier
On computing the determinant over a ring
Gilles Villard
Exact certification for conic optimization over quadratic modules: partitions of unity and recession directions
Didier Henrion, Alaa Ibrahim, Victor Magron
Where models of minimal height are hard to find: cubic rational maps with a multiple fixed point
Elira Shaska