Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2610.16249

$H_2$-optimal model order reduction using hyperbolic geometry

Andrea Angino·Tamás Dózsa·Matthias Voigt
View original source ↗Read source document ↗Export metadata ↓

Abstract

We revisit the problem of approximating a linear time-invariant LTI model by a reduced-order model (ROM) in an $H_2$-optimal sense. A widely used method for computing such ROMs is the iterative rational Krylov algorithm (IRKA). However, in practice, the stability of the resulting ROM is not generally guaranteed. In this work, we develop a novel framework that can be used to obtain $H_2$-optimal models of single-input single-output LTI systems while enforcing stability of the ROM. We use Malmquist-Takenaka orthogonal expansions in the corresponding $H_2$-spaces and their connection to hyperbolic geometry to develop an equilibrium function. We show that the poles of an $H_2$-optimal ROM transfer function are defined by the zeros of this equilibrium function. The resulting nonlinear root-finding problem is solved using a Newton-type method formulated on the products of Poincaré disk manifolds, where updates are performed along hyperbolic geodesics ensuring that the stability constraint is satisfied at every iteration. We present numerical experiments on benchmark systems for both discrete- and continuous-time LTI MOR problems, including examples where IRKA produces unstable reduced models while the proposed method preserves stability throughout the iteration.

Explore related subjects

eess.SYcs.NAcs.SYmath.NA

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Andrea Angino, Tamás Dózsa, Matthias Voigt. 2026-10-12. $H_2$-optimal model order reduction using hyperbolic geometry. https://arxiv.org/abs/2610.16249

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Age of Trust (AoT): A Continuous Verification Framework for Wireless Networks

Zero Trust is a new security vision for 6G networks that emphasises the philosophy of never trust and always verify. However, there is a fundamental trade-off between the wireless transmission efficiency and the trust level, which is reflected by the verification interval and its adaptation strategy. More importantly, the mathematical framework to characterise the trust level of the adaptive verification strategy is still missing. Inspired by this vision, we propose a concept called age of trust (AoT) to capture the characteristics of the trust level degrading over time, with the definition of the time elapsed since the last verification of the target user's trust plus the initial age, which depends on the trust level evaluated at that verification. The higher the trust level, the lower the initial age. To evaluate the trust level in the long term, the average AoT is used. We then investigate how to find a compromise between average AoT and wireless transmission efficiency with limited resources. In particular, we address the bi-objective optimization (BOO) problem between average AoT and throughput over a single link with arbitrary service process, where the identity of the receiver is constantly verified, and we devise a periodic verification scheme and a Q-learning-based scheme for constant process and random process, respectively. We also tackle the BOO problem in a multiple random access scenario, where a trust-enhanced frame-slotted ALOHA is designed. Finally, the numerical results show that our proposals can achieve a fair compromise between trust level and wireless transmission efficiency, and thus have a wide application prospect in various zero-trust architectures.

eess.SY↗
arXiv2026

LiDAL-Assisted RLNC-NOMA in OWC Systems

Optical wireless communication (OWC) is a key enabler for immersive indoor data transmission in future wireless networks. However, managing multi-user interference remains challenging in dense indoor OWC deployments with multiple optical access points (APs) serving multiple users. In this paper, we propose a dual-function OWC system for communication and localization. For data transmission, we design non-orthogonal multiple access (NOMA) combined with random linear network coding (RLNC): NOMA serves multiple users simultaneously via power-domain multiplexing, while RLNC improves decoding robustness under residual noise and processing impairments. The system is assisted by a light detection and localization (LiDAL) module that estimates users' spatio-temporal presence and location to enable dynamic user association. LiDAL also supports channel state information (CSI) estimation in realistic indoor scenarios where CSI may be noisy and/or highly correlated. We evaluate RLNC-NOMA by analyzing the probability of successful decoding and comparing it with conventional NOMA and orthogonal schemes. In addition, we derive the Cramer-Rao lower bound (CRLB) to evaluate the localization accuracy. The results indicate that RLNC-NOMA increases the probability of successful decoding, and that the proposed unbiased location estimator achieves 44% better CSI accuracy than the baseline CSI estimation and improves the overall system performance.

eess.SY↗
arXiv2026

Ensemble-MIX: Enhancing Sample-Efficiency in Multi-Agent RL via Selective Ensemble-Based Exploration

Multi-agent reinforcement learning (MARL) methods have achieved state-of-the-art results on a range of multi-agent tasks. Yet, MARL algorithms typically require significantly more environment interactions than their single-agent counterparts to converge, a problem exacerbated by the difficulty in exploring over a large joint action space and the high variance intrinsic to MARL environments. To tackle these issues, we propose a novel algorithm that combines a decomposed centralized critic with decentralized ensemble learning, incorporating several key contributions. The main component in our scheme is a selective exploration method that leverages ensemble kurtosis. We extend the global decomposed critic with a diversity-regularized ensemble of individual critics and utilize its excess kurtosis to guide exploration toward high-uncertainty states and actions. To improve sample efficiency, we train the centralized critic with a novel truncated variation of the TD($λ$) algorithm, enabling efficient off-policy learning with reduced variance. On the actor side, our suggested algorithm adapts the mixed samples approach to MARL, mixing on-policy and off-policy loss functions for training the actors. This approach balances between stability and efficiency and outperforms purely off-policy learning. The evaluation shows our method outperforms state-of-the-art baselines on standard MARL benchmarks, including a variety of SMAC II maps.

eess.SY↗