A passivation algorithm for linear time-invariant systems

We propose and study an algorithm for computing a nearest passive system to a given non-passive linear time-invariant system (with much freedom in the choice of the metric defining `nearest'), and also a closely related algorithm for computing the structured distance of a given passive system to non-passivity. Both problems are addressed by solving eigenvalue optimization problems for Hamiltonian matrices that are constructed from perturbed system matrices. The proposed algorithms are two-level methods that optimize the Hamiltonian eigenvalue of smallest positive real part over perturbations of a fixed size in the inner iteration, using a constrained gradient flow, and optimize over the perturbation size in the outer iteration. For large systems, we propose a variant of the algorithm that takes advantage of the inherent low-rank structure of the problem. Numerical experiments illustrate the behavior of the proposed algorithms.

[1]  Nicola Guglielmi,et al.  Matrix Stabilization Using Differential Equations , 2017, SIAM J. Numer. Anal..

[2]  Hanna Walach,et al.  Discretized Dynamical Low-Rank Approximation in the Presence of Small Singular Values , 2016, SIAM J. Numer. Anal..

[3]  Stefano Grivet-Talocia,et al.  Passive Macromodeling: Theory and Applications , 2015 .

[4]  K. Williams,et al.  WILEY SERIES IN MICROWAVE AND OPTICAL ENGINEERING , 2015, Algorithms.

[5]  Daniel Kressner,et al.  Low rank differential equations for Hamiltonian matrix nearness problems , 2015, Numerische Mathematik.

[6]  C. Lubich,et al.  A projector-splitting integrator for dynamical low-rank approximation , 2013, BIT Numerical Mathematics.

[7]  Michael L. Overton,et al.  Fast Algorithms for the Approximation of the Pseudospectral Abscissa and Pseudospectral Radius of a Matrix , 2011, SIAM J. Matrix Anal. Appl..

[8]  Volker Mehrmann,et al.  Perturbation Theory for Hamiltonian Matrices and the Distance to Bounded-Realness , 2011, SIAM J. Matrix Anal. Appl..

[9]  Othmar Koch,et al.  Dynamical Low-Rank Approximation , 2007, SIAM J. Matrix Anal. Appl..

[10]  Stefano Grivet-Talocia,et al.  Passivity enforcement via perturbation of Hamiltonian matrices , 2004, IEEE Transactions on Circuits and Systems I: Regular Papers.

[11]  Peter Benner,et al.  Symplectic Balancing of Hamiltonian Matrices , 2000, SIAM J. Sci. Comput..

[12]  Stephen P. Boyd,et al.  A bisection method for computing the H∞ norm of a transfer matrix and related problems , 1989, Math. Control. Signals Syst..

[13]  C. D. Meyer,et al.  Derivatives and perturbations of eigenvectors , 1988 .

[14]  C. Loan,et al.  A Schur decomposition for Hamiltonian matrices , 1981 .

[15]  John B. Conway,et al.  Finite-dimensional points of continuity of Lat , 1980 .

[16]  Tosio Kato.  Perturbation theory for linear operators , 1966 .