Finding the nearest positive-real system

From MaRDI portal
Publication:4637764

DOI10.1137/17M1137176zbMATH Open1390.93296arXiv1707.00530MaRDI QIDQ4637764FDOQ4637764


Authors: Nicolas Gillis, Punit Sharma Edit this on Wikidata


Publication date: 26 April 2018

Published in: SIAM Journal on Numerical Analysis (Search for Journal in Brave)

Abstract: The notion of positive realness for linear time-invariant (LTI) dynamical systems, equivalent to passivity, is one of the oldest in system and control theory. In this paper, we consider the problem of finding the nearest positive-real (PR) system to a non PR system: given an LTI control system defined by Edotx=Ax+Bu and y=Cx+Du, minimize the Frobenius norm of (DeltaE,DeltaA,DeltaB,DeltaC,DeltaD) such that (E+DeltaE,A+DeltaA,B+DeltaB,C+DeltaC,D+DeltaD) is a PR system. We first show that a system is extended strictly PR if and only if it can be written as a strict port-Hamiltonian system. This allows us to reformulate the nearest PR system problem into an optimization problem with a simple convex feasible set. We then use a fast gradient method to obtain a nearby PR system to a given non PR system, and illustrate the behavior of our algorithm on several examples. This is, to the best of our knowledge, the first algorithm that computes a nearby PR system to a given non PR system that (i) is not based on the spectral properties of related Hamiltonian matrices or pencils, (ii) allows to perturb all matrices (E,A,B,C,D) describing the system, and (iii) does not make any assumption on the original given system.


Full work available at URL: https://arxiv.org/abs/1707.00530




Recommendations




Cites Work


Cited In (17)

Uses Software





This page was built for publication: Finding the nearest positive-real system

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4637764)