Adjoint of Least Squares Shadowing: Existence, Uniqueness and Coarse Domain Discretization
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , |
|---|---|
| Format: | Preprint |
| Publié: |
2025
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866915152022994944 |
|---|---|
| author | Thakur, Pranshul Nadarajah, Siva |
| author_facet | Thakur, Pranshul Nadarajah, Siva |
| contents | Chaotic dynamical systems are characterized by the sensitive dependence of trajectories on initial conditions. Conventional sensitivity analysis of time-averaged functionals yields unbounded sensitivities when the simulation is chaotic. The least squares shadowing (LSS) is a popular approach to computing bounded sensitivities in the presence of chaotic dynamical systems. The current paper proves the existence, uniqueness, and boundedness of the adjoint of the LSS equations. In particular, the analysis yields a sharper bound on the condition number of the LSS equations than currently demonstrated in existing literature and shows that the condition number is bounded for large integration times. The derived bound on condition number also shows a relation between the conditioning of the LSS and the time dilation factor which is consistent with the trend numerically observed in the previous LSS literature. Furthermore, using the boundedness of the condition number for large integration times, we provide an alternate proof to (Chater et al., 2017) of the convergence of the LSS sensitivity to the true sensitivity at the rate of $\mathcal{O}\left(\frac{1}{\sqrt{T}}\right)$ regardless of the boundary conditions imposed on the adjoint, as long as the adjoint boundary conditions are bounded. Existence and uniqueness of the solution to the continuous-in-time adjoint LSS equation ensure that the LSS equation can be discretized independently of the primal equation and that the true LSS adjoint solution is recovered as the time step is refined. This allows for the adjoint LSS equation to be discretized on a coarser time domain than that of the primal governing equation to reduce the cost of solving the linear space-time system. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2502_09737 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Adjoint of Least Squares Shadowing: Existence, Uniqueness and Coarse Domain Discretization Thakur, Pranshul Nadarajah, Siva Numerical Analysis 34A34, 37A99, 37D20, 37D45, 37N30, 46N40, 65P99, 76F20 Chaotic dynamical systems are characterized by the sensitive dependence of trajectories on initial conditions. Conventional sensitivity analysis of time-averaged functionals yields unbounded sensitivities when the simulation is chaotic. The least squares shadowing (LSS) is a popular approach to computing bounded sensitivities in the presence of chaotic dynamical systems. The current paper proves the existence, uniqueness, and boundedness of the adjoint of the LSS equations. In particular, the analysis yields a sharper bound on the condition number of the LSS equations than currently demonstrated in existing literature and shows that the condition number is bounded for large integration times. The derived bound on condition number also shows a relation between the conditioning of the LSS and the time dilation factor which is consistent with the trend numerically observed in the previous LSS literature. Furthermore, using the boundedness of the condition number for large integration times, we provide an alternate proof to (Chater et al., 2017) of the convergence of the LSS sensitivity to the true sensitivity at the rate of $\mathcal{O}\left(\frac{1}{\sqrt{T}}\right)$ regardless of the boundary conditions imposed on the adjoint, as long as the adjoint boundary conditions are bounded. Existence and uniqueness of the solution to the continuous-in-time adjoint LSS equation ensure that the LSS equation can be discretized independently of the primal equation and that the true LSS adjoint solution is recovered as the time step is refined. This allows for the adjoint LSS equation to be discretized on a coarser time domain than that of the primal governing equation to reduce the cost of solving the linear space-time system. |
| title | Adjoint of Least Squares Shadowing: Existence, Uniqueness and Coarse Domain Discretization |
| topic | Numerical Analysis 34A34, 37A99, 37D20, 37D45, 37N30, 46N40, 65P99, 76F20 |
| url | https://arxiv.org/abs/2502.09737 |