Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2510.23082 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866910045636132864 |
|---|---|
| author | Zhang, Yehao Xu, Yuncheng Tan, Chenyi Su, Yangfeng |
| author_facet | Zhang, Yehao Xu, Yuncheng Tan, Chenyi Su, Yangfeng |
| contents | Accurate and efficient computation of Floquet multipliers and subspaces is essential for analyzing limit cycle in dynamical systems and periodic steady state in Radio Frequency simulation. This problem is typically addressed by solving a periodic linear eigenvalue problem, which is discretized from the linear time-periodic system using one-step collocation methods. Collocation methods become costly for large-scale cases. Our alternative approach is to use multistep methods. The multistep method leads to a periodic polynomial eigenvalue problem (pPEP), and introduces additional parasitic periodic eigenvalues. We prove that as the stepsize decreases, the computed Floquet multipliers and their associated invariant subspace converge with higher order, while the parasitic periodic eigenvalues converge to zero geometrically and therefore Floquet multipliers are not affected by those parasitic ones. A memory-efficient algorithm pTOAR is designed to solve the large-scale pPEP. Its computational and memory costs are almost independent of the choice of multistep methods. Numerical results coincide with our convergence analysis, and also demonstrate the efficiency of pTOAR. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2510_23082 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Multistep Methods for Floquet Multipliers and Subspaces Zhang, Yehao Xu, Yuncheng Tan, Chenyi Su, Yangfeng Numerical Analysis 65L15, 65F15, 65L70 Accurate and efficient computation of Floquet multipliers and subspaces is essential for analyzing limit cycle in dynamical systems and periodic steady state in Radio Frequency simulation. This problem is typically addressed by solving a periodic linear eigenvalue problem, which is discretized from the linear time-periodic system using one-step collocation methods. Collocation methods become costly for large-scale cases. Our alternative approach is to use multistep methods. The multistep method leads to a periodic polynomial eigenvalue problem (pPEP), and introduces additional parasitic periodic eigenvalues. We prove that as the stepsize decreases, the computed Floquet multipliers and their associated invariant subspace converge with higher order, while the parasitic periodic eigenvalues converge to zero geometrically and therefore Floquet multipliers are not affected by those parasitic ones. A memory-efficient algorithm pTOAR is designed to solve the large-scale pPEP. Its computational and memory costs are almost independent of the choice of multistep methods. Numerical results coincide with our convergence analysis, and also demonstrate the efficiency of pTOAR. |
| title | Multistep Methods for Floquet Multipliers and Subspaces |
| topic | Numerical Analysis 65L15, 65F15, 65L70 |
| url | https://arxiv.org/abs/2510.23082 |