Papers › Efficient computation of global resolvent modes
Efficient computation of global resolvent modes
Eduardo Martini, Daniel Rodríguez, Aaron Towne, André V. G. Cavalieri
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
Resolvent analysis of the linearized Navier-Stokes equations provides useful insight into the dynamics of transitional and turbulent flows and can provide a model for the dominant coherent structures within the flow, particularly for flows with large gain separation. Direct computation of force and response modes using a singular value decomposition of the full resolvent matrix is feasible only for simple problems; despite recent progress, the cost of resolvent analysis for complex flows remains considerable. In this paper, we propose a new matrix-free method for computing resolvent modes based on integration of the linearized equations and the corresponding adjoint system in the time domain. Our approach achieves an order of magnitude speedup when compared to previous matrix-free time stepping methods by enabling all frequencies of interest to be computed simultaneously. Two different methods are presented: one based on analysis of the transient response, providing leading modes with fine frequency discretization; and another based on the steady-state response to a periodic forcing, providing optimal and suboptimal modes for a discrete set of frequencies. The methods are validated using a linearized Ginzburg-Landau equation and applied to the three dimensional flow around a parabolic body.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections