Sector bounds in stability analysis and control design

M Xia, P Gahinet, N Abroug, C Buhr… - International Journal of …, 2020 - Wiley Online Library
The sector stability theorem is an intuitive condition for the stability of feedback loops that
unifies many lines of research including robust control and the theory of passive and …

Faster and More Accurate Computation of the Norm via Optimization

P Benner, T Mitchell - SIAM Journal on Scientific Computing, 2018 - SIAM
In this paper, we propose an improved method for computing the H_∞ norm of linear
dynamical systems that results in a code that is often several times faster than existing …

[PDF][PDF] Performance improvement in computing the L-infinity norm of descriptor systems

V Sima - J Eng Sci Innov, 2023 - jesi.astr.ro
Efficient and realible algorithms for finding the L-infinity norm for both continuous-and
discrete-time descriptor systems have been recently developed. These algorithms exploit …

[PDF][PDF] Improving the Convergence of the Periodic QZ Algorithm.

V Sima, P Gahinet - ICINCO (1), 2019 - scitepress.org
The periodic QZ algorithm involved in the structure-preserving skew-Hamiltonian/
Hamiltonian algorithm is investigated. These are key algorithms for many applications in …

Sector bounds in control design and analysis

M Xia, P Gahinet, N Abroug… - 2017 IEEE 56th Annual …, 2017 - ieeexplore.ieee.org
The Sector Stability Theorem is an intuitive condition for the stability of feedback loops that
unifies many lines of research including robust control, passivity theory, dissipativity theory …

Computation of initial transformation for implicit double step in the periodic QZ algorithm

V Sima - 2019 23rd International Conference on System Theory …, 2019 - ieeexplore.ieee.org
The periodic QZ algorithm (pQZ) is required in many applications, including periodic linear
systems, cyclic matrices and matrix pencils, and some structured eigenproblems. The …

Convergence rate analysis and improved iterations for numerical radius computation

T Mitchell - SIAM Journal on Scientific Computing, 2023 - SIAM
The main two algorithms for computing the numerical radius are the level-set method of
Mengi and Overton and the cutting-plane method of Uhlig. Via new analyses, we explain …

On the stability radius for linear time-delay systems

A Malyshev, M Sadkane - BIT Numerical Mathematics, 2024 - Springer
The exponential function that appears in the formula of the stability radius of linear time-
delay differential systems is approximated by its Padé approximant. This reduces the …

Fast interpolation-based globality certificates for computing Kreiss constants and the distance to uncontrollability

T Mitchell - SIAM Journal on Matrix Analysis and Applications, 2021 - SIAM
We propose a new approach to computing global minimizers of singular value functions in
two real variables. Specifically, we present new algorithms to compute the Kreiss constant of …

[PDF][PDF] Using Semi-implicit Iterations in the Periodic QZ Algorithm.

V Sima, P Gahinet, O Gusikhin, K Madani, J Zaytoon - ICINCO, 2020 - scitepress.org
The periodic QZ (pQZ) algorithm is the key solver in many applications, including periodic
systems, cyclic matrices and matrix pencils, and solution of skew-Hamiltonian/Hamiltonian …