Computing the nearest scattering passive system

In this paper, we consider linear time-invariant control systems that are bounded real (BR), also known as scattering passive. Our main theoretical contribution is to show the equivalence between such systems and port-Hamiltonian (PH) systems whose factors satisfy certain linear matrix inequalities. Based on this result, we propose a formulation for the problem of finding the nearest BR system to a given system and design an algorithm combining alternating optimization and Nesterov's fast gradient method. This formulation also allows us to check whether a given system is BR by solving a semidefinite program and provide a PH parametrization for it. We illustrate our proposed algorithms on real world and synthetic datasets.

Authors

Institutions

Publication Details

Journal
Electronic Journal of Linear Algebra
Published
2026-11-13
DOI
https://doi.org/10.13001/ela.2026.10427
Citations
1
Primary Topic
Control and Stability of Dynamical Systems
Type
article
Field-Weighted Citation Impact
1.61

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
article

Computing the nearest scattering passive system

Punit Sharma, Nicolas Gillis, Karim Cherifi
1 citations
Electronic Journal of Linear Algebra
Control and Stability of Dynamical Systems
1.61
article

Computing the nearest scattering passive system

Punit Sharma, Nicolas Gillis, Karim Cherifi
article en
1 citations

Abstract

In this paper, we consider linear time-invariant control systems that are bounded real (BR), also known as scattering passive. Our main theoretical contribution is to show the equivalence between such systems and port-Hamiltonian (PH) systems whose factors satisfy certain linear matrix inequalities. Based on this result, we propose a formulation for the problem of finding the nearest BR system to a given system and design an algorithm combining alternating optimization and Nesterov's fast gradient method. This formulation also allows us to check whether a given system is BR by solving a semidefinite program and provide a PH parametrization for it. We illustrate our proposed algorithms on real world and synthetic datasets.

Electronic Journal of Linear AlgebraVol. 42
University of Mons (BE), École Nationale Supérieure de Mécanique et des Microtechniques (FR), Indian Institute of Technology Delhi (IN)
European Commission, Science and Engineering Research Board
Openalex Percentile: Top 22%
Control and Stability of Dynamical Systems
1.61
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon