Error analysis of randomized symplectic model order reduction for Hamiltonian systems

Solving high-dimensional dynamical systems in multi-query or real-time applications requires efficient surrogate modelling techniques, as e.g., achieved via model order reduction (MOR). If these systems are Hamiltonian systems their physical structure should be preserved during the reduction, which can be ensured by applying symplectic basis generation techniques such as the complex SVD (cSVD). Recently, randomized symplectic methods such as the randomized complex singular value decomposition (rcSVD) have been developed for a more efficient computation of symplectic bases that preserve the Hamiltonian structure during MOR. In the current paper, we present two error bounds for the rcSVD basis depending on the choice of hyperparameters. We provide numerical experiments that demonstrate the efficiency of randomized symplectic basis generation and compare the bounds numerically.

Authors

Institutions

Publication Details

Journal
Linear Algebra and its Applications
Published
2025-09-30
DOI
https://doi.org/10.1016/j.laa.2025.09.022
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

Error analysis of randomized symplectic model order reduction for Hamiltonian systems

Johannes Rettberg, Jörg Fehr, Bernard Haasdonk, Robin Herkert et al.
Linear Algebra and its Applications
Model Reduction and Neural Networks
article

Error analysis of randomized symplectic model order reduction for Hamiltonian systems

Johannes Rettberg, Jörg Fehr, Bernard Haasdonk, Robin Herkert, Patrick Buchfink
article en

Abstract

Solving high-dimensional dynamical systems in multi-query or real-time applications requires efficient surrogate modelling techniques, as e.g., achieved via model order reduction (MOR). If these systems are Hamiltonian systems their physical structure should be preserved during the reduction, which can be ensured by applying symplectic basis generation techniques such as the complex SVD (cSVD). Recently, randomized symplectic methods such as the randomized complex singular value decomposition (rcSVD) have been developed for a more efficient computation of symplectic bases that preserve the Hamiltonian structure during MOR. In the current paper, we present two error bounds for the rcSVD basis depending on the choice of hyperparameters. We provide numerical experiments that demonstrate the efficiency of randomized symplectic basis generation and compare the bounds numerically.

Linear Algebra and its ApplicationsVol. 729
University of Stuttgart (DE), University of Twente (NL)
Openalex Percentile: Top 79%
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.

Error analysis of randomized symplectic model order reduction for Hamiltonian systems — Johannes Rettberg, Jörg Fehr, et al. · Linear Algebra and its Applications (2025) | TGRS Research Map | TGRS