检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:Wai Ming Chau Shingyu Leung
出 处:《Communications in Computational Physics》2023年第3期824-848,共25页计算物理通讯(英文)
基 金:the Hong Kong RGC under grant 16302819.
摘 要:We propose a clustering-based approach for identifying coherent flow structuresin continuous dynamical systems. We first treat a particle trajectory over a finitetime interval as a high-dimensional data point and then cluster these data from differentinitial locations into groups. The method then uses the normalized standarddeviation or mean absolute deviation to quantify the deformation. Unlike the usualfinite-time Lyapunov exponent (FTLE), the proposed algorithm considers the completetraveling history of the particles. We also suggest two extensions of the method. To improvethe computational efficiency, we develop an adaptive approach that constructsdifferent subsamples of the whole particle trajectory based on a finite time interval. Tostart the computation in parallel to the flow trajectory data collection, we also developan on-the-fly approach to improve the solution as we continue to provide more measurementsfor the algorithm. The method can efficiently compute the WCVE over adifferent time interval by modifying the available data points.
关 键 词:Dynamical system visualization finite time Lyapunov exponent numerical methods for differential equations k-means clustering
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.117