Papers › Sensitivity analysis on chaotic dynamical system by Non-Intrusive Least Square...
Sensitivity analysis on chaotic dynamical system by Non-Intrusive Least Square Shadowing (NILSS)
Angxiu Ni, Qiqi Wang
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.
This paper develops the non-intrusive formulation of the Least-squares shadowing (LSS) method, for computing the sensitivity of long-time averaged objectives in chaotic dynamical systems. This non-intrusive formulation constrains the computation to only the unstable subspace, greatly reducing the cost of LSS for many problems; moreover, it reparametrizes the LSS problem, requiring only minor modifications to existing tangent solvers. NILSS is demonstrated on a chaotic flow over a backward-facing step simulated with a mesh of 12e3 cells.
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