Floating-point, exact and certified computation for control: paradigms, pitfalls, and how to combine them
Christina Katsamaki, Fabrice Rouillier
Abstract
Many questions in linear systems theory have a discrete answer: is a polynomial Hurwitz, is a 2-D system structurally stable, is the peak gain finite, which solution of a Riccati equation is stabilizing? Algorithms implemented in floating point usually answer such questions, but often with a limited, or even no, guarantee on the result, which depends on a tolerance fixed a priori. Computer algebra and interval arithmetic provide other ways of computing, which give guarantees on the result, but usually at a higher cost. In this paper, we propose a short guide to these approaches: floating-point, exact, multiprecision and interval arithmetic, certified root isolation and certified Newton methods. Using small examples from control theory (each of them runs in a few seconds), we show what each approach guarantees and in which situations it fails, and how several approaches can be combined, for example by certifying a numerical solution, or by reducing a problem exactly before solving it with certified real solving. We then revisit the structural stability of 2-D systems (with and without parameters) and the computation of the H∞ norm, and we list the available implementations. The main examples are given as reproducible worksheets based on the PACE ecosystem.
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
Reliable Computation of the L∞-Norm of Linear Time-Invariant Systems Depending on One Parameter
Florent Corniquel, Alban Quadrat, Fabrice Rouillier et al.
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