SearcharxivSearch

arXiv subjects

Chenyi Tan

Publications and source records attributed to Chenyi Tan.

2 recordsLinked to original sources

A Fourier-Aware Projection-Based Periodic Parareal Method for Time-Periodic Problems

Time-periodic problems arise when the desired solution is a periodic steady state rather than a transient trajectory. The periodic parareal algorithm with a periodic coarse problem (PP-PC) is a periodicity-preserving parallel-in-time approach for such problems. Projection-based correction can accelerate convergence of both parareal and PP-PC. In this paper, we propose a Fourier-aware construction of projection spaces and a new correction scheme to further accelerate the convergence of projection-based PP-PC. We develop a convergence analysis of projection-based PP-PC with the discrepancy-based correction scheme for general nonlinear time-periodic problems. For an arbitrary orthogonal projection, we derive a local one-step convergence estimate controlled by the unresolved error and explicit nonlinear contributions. A temporal Fourier decomposition bounds the unresolved error by a tail-leak quantity, which is small when dominant error modes are selected and their coefficients are captured by the projection space. For linear problems, the nonlinear contributions vanish, yielding a globally valid one-step tail-leak convergence estimate under weaker assumptions. Experiments on linear and nonlinear problems show that Fourier-aware PP-PC requires fewer outer iterations than Krylov-enhanced PP-PC. For the linear problems, the errors track the tail-leak bound. For the nonlinear problems, the experiments quantify the unresolved-error and explicit nonlinear contributions in the local one-step estimate and show that the evaluated tail-leak estimate follows the observed decay.

math.NA

Multistep Methods for Floquet Multipliers and Subspaces

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.

math.NA