期刊
SIAM JOURNAL ON MATRIX ANALYSIS AND APPLICATIONS
卷 42, 期 4, 页码 1553-1580出版社
SIAM PUBLICATIONS
DOI: 10.1137/20M1376972
关键词
passive control system; structured passivity enforcement; distance to nonpassivity; matrix nearness problem; structured eigenvalue optimization; Hamiltonian matrices
资金
- Fund for Scientific Research Vlaanderen (FWO) [G028015N, G090117N]
- FNRS-FWO under Excellence of Science (EOS) Project [30468160]
- Italian MUR (Ministero dell'Universita e della Ricerca) within the PRIN
- INdAM Research group GNCS (Gruppo Nazionale di Calcolo Scientifico)
This paper introduces an algorithm for computing the nearest passive system to a given nonpassive system, and studies a related algorithm for calculating the structured distance between a given passive system and a nonpassive one. Both problems are addressed by solving eigenvalue optimization problems for Hamiltonian matrices constructed from perturbed system matrices.
We propose and study an algorithm for computing a nearest passive system to a given nonpassive linear time-invariant system (with much freedom in the choice of the metric defining nearest, which may be restricted to structured perturbations), and also a closely related algorithm for computing the structured distance of a given passive system to nonpassivity. 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 the smallest positive real part over perturbations of a fixed size in the inner iteration, using a constrained gradient flow. They optimize over the perturbation size in the outer iteration, which is shown to converge quadratically in the typical case of a defective coalescence of simple eigenvalues approaching the imaginary axis. 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.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据