A novel approach for finite-frequency ℋ<sub>∞</sub> model reduction

This article addresses the problem of ℋ<inf xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">∞</inf> model order reduction for continuous-time linear time-invariant (LTI) systems over finite-frequency intervals. The goal is to compute a reduced-order model such that the error characterised by ℋ<inf xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">∞</inf>-norm between the original system and reduced-order model is minimised within a specified frequency interval. Utilising the generalised Kalman-Yakubovich-Popov lemma, the problem is formulated as an optimisation problem constrained by nonlinear matrix inequalities. By employing a novel application of the projection lemma, the problem is reformulated into an optimisation problem with linear matrix inequality constraints. An iterative algorithm is then given to compute the solution of the finite-frequency model order reduction problem. In case studies, the proposed approach is shown to outperform existing results in the literature.

Authors

Institutions

Publication Details

Published
2025-06-24
DOI
https://doi.org/10.23919/ecc65951.2025.11186989
Primary Topic
Model Reduction and Neural Networks
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A novel approach for finite-frequency ℋ∞ model reduction

M.F. Shakib, Guilin Huang, Imad M. Jaimoukha
Model Reduction and Neural Networks
article

A novel approach for finite-frequency ℋ∞ model reduction

M.F. Shakib, Guilin Huang, Imad M. Jaimoukha
article en

Abstract

This article addresses the problem of ℋ<inf xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">∞</inf> model order reduction for continuous-time linear time-invariant (LTI) systems over finite-frequency intervals. The goal is to compute a reduced-order model such that the error characterised by ℋ<inf xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">∞</inf>-norm between the original system and reduced-order model is minimised within a specified frequency interval. Utilising the generalised Kalman-Yakubovich-Popov lemma, the problem is formulated as an optimisation problem constrained by nonlinear matrix inequalities. By employing a novel application of the projection lemma, the problem is reformulated into an optimisation problem with linear matrix inequality constraints. An iterative algorithm is then given to compute the solution of the finite-frequency model order reduction problem. In case studies, the proposed approach is shown to outperform existing results in the literature.

Imperial College London (GB)
Openalex Percentile: Top 77%
Model Reduction and Neural Networks
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.