Partial Floquet transformation and model order reduction of linear time-periodic systems

Abstract Time-periodic dynamical systems occur commonly both in nature and as engineered systems. Large-scale linear time-periodic dynamical systems, for example, may arise through linearization of a nonlinear system about a given periodic solution (possibly as a consequence of a baseline periodic forcing) with subsequent spatial discretization. The potential need to simulate responses to a wide variety of input profiles (viewed as perturbations off a baseline periodic forcing) creates a potent incentive for effective model reduction strategies applicable to linear time-periodic ( ltp ) systems. Classical approaches that take into account the underlying time-periodic system structure often utilize the Floquet transform; however, computation of the Floquet transform is typically intractable for large-order systems. In this paper, we develop the notion of a partial Floquet transformation connected to selected invariant subspaces of a time-varying differential operator associated with the ltp system. We modify and repurpose the Dominant Pole Algorithm of Rommes to identify effective invariant subspaces useful for model reduction. We discuss the construction of associated partial Floquet transformations and time-varying reduction bases with which to produce effective reduced-order ltp models and illustrate the process on a simple time-periodic system.

Authors

Institutions

Publication Details

Journal
Advances in Computational Mathematics
Published
2026-06-26
DOI
https://doi.org/10.1007/s10444-026-10320-9
Primary Topic
Model Reduction and Neural Networks
Type
article
Field-Weighted Citation Impact
0.00

Funders

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

Partial Floquet transformation and model order reduction of linear time-periodic systems

Christopher Beattie, Sam Bender
Advances in Computational Mathematics
Model Reduction and Neural Networks
article

Partial Floquet transformation and model order reduction of linear time-periodic systems

Christopher Beattie, Sam Bender
article en

Abstract

Abstract Time-periodic dynamical systems occur commonly both in nature and as engineered systems. Large-scale linear time-periodic dynamical systems, for example, may arise through linearization of a nonlinear system about a given periodic solution (possibly as a consequence of a baseline periodic forcing) with subsequent spatial discretization. The potential need to simulate responses to a wide variety of input profiles (viewed as perturbations off a baseline periodic forcing) creates a potent incentive for effective model reduction strategies applicable to linear time-periodic ( ltp ) systems. Classical approaches that take into account the underlying time-periodic system structure often utilize the Floquet transform; however, computation of the Floquet transform is typically intractable for large-order systems. In this paper, we develop the notion of a partial Floquet transformation connected to selected invariant subspaces of a time-varying differential operator associated with the ltp system. We modify and repurpose the Dominant Pole Algorithm of Rommes to identify effective invariant subspaces useful for model reduction. We discuss the construction of associated partial Floquet transformations and time-varying reduction bases with which to produce effective reduced-order ltp models and illustrate the process on a simple time-periodic system.

Advances in Computational MathematicsVol. 52(4)
Virginia Tech (US)
National Science Foundation, Division of Mathematical Sciences
Openalex Percentile: Top 98%
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.