arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2111.07692math.DScs.NAmath.NAphysics.comp-ph
收藏

基于传递算子不稳定扰动的混沌快速伴随微分

Fast adjoint differentiation of chaos via computing unstable perturbations of transfer operators

Angxiu Ni

摘要:

针对离散时间双曲混沌系统的物理量(长时平均统计量)关于多个系统参数的梯度,设计了快速伴随响应算法。它的代价与参数的个数无关。该算法将我们新的理论工具,伴随跟踪引理和等变散度公式,转化为逐步计算$u$许多有界向量在一个轨道上的形式。这里$u$是不稳定维。我们证明了我们的算法上的一个例子很难为以前的方法,一个系统的随机噪声,和一个系统的不连续映射。我们还给出了等变散度公式的一个简短的形式证明。与著名的有限元法相比,我们的算法不受相空间维数的限制(典型的现实生活中的系统具有非常高的维数),因为它是通过一个轨道进行采样的。与集成/随机方法相比,由于算法中的递归关系是有界的,因此该算法不受蝴蝶效应的影响。

英文摘要:

We devise the fast adjoint response algorithm for the gradient of physical measures (long-time-average statistics) of discrete-time hyperbolic chaos with respect to many system parameters. Its cost is independent of the number of parameters. The algorithm transforms our new theoretical tools, the adjoint shadowing lemma and the equivariant divergence formula, into the form of progressively computing $u$ many bounded vectors on one orbit. Here $u$ is the unstable dimension. We demonstrate our algorithm on an example difficult for previous methods, a system with random noise, and a system of a discontinuous map. We also give a short formal proof of the equivariant divergence formula. Compared to the better-known finite-element method, our algorithm is not cursed by dimensionality of the phase space (typical real-life systems have very high dimensions), since it samples by one orbit. Compared to the ensemble/stochastic method, our algorithm is not cursed by the butterfly effect, since the recursive relations in our algorithm is bounded.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑