论文标题
数据驱动的均值群集模型的最佳封闭:超越经典对近似
Data-Driven Optimal Closures for Mean-Cluster Models: Beyond the Classical Pair Approximation
论文作者
论文摘要
这项研究涉及建模晶格动力学演变的均值聚类方法。该方法没有跟踪各个晶格位点的状态,而是描述了不同集群类型的浓度的时间演变。它导致了普通微分方程的无限层次结构,必须使用所谓的闭合条件通过截断来封闭。根据低阶浓度,这种情况近似高阶簇的浓度。近似是最常见的闭合形式。在这里,我们考虑其概括,称为“最佳近似”,我们使用强大的数据驱动策略对其进行校准。为了解决注意力,我们专注于最近提出的基于镍的氧化物的结构化晶格模型,类似于现代商用锂离子电池中用作阴极材料的氧化物。获得的最佳近似形式使我们能够推断出简单的稀疏闭合模型。除了比经典对近似更准确之外,此``稀疏近似''还可以从物理上解释,这使我们能够后验优化此类闭合模型的基础构造的假设。此外,使用此稀疏近似值封闭的均值群集模型是线性的,因此在分析上可解析,因此其参数化很简单。另一方面,均值近似封闭的均值群集模型的参数化显示出导致逆问题不良。
This study concerns the mean-clustering approach to modelling the evolution of lattice dynamics. Instead of tracking the state of individual lattice sites, this approach describes the time evolution of the concentrations of different cluster types. It leads to an infinite hierarchy of ordinary differential equations which must be closed by truncation using a so-called closure condition. This condition approximates the concentrations of higher-order clusters in terms of the concentrations of lower-order ones. The pair approximation is the most common form of closure. Here, we consider its generalization, termed the "optimal approximation", which we calibrate using a robust data-driven strategy. To fix attention, we focus on a recently proposed structured lattice model for a nickel-based oxide, similar to that used as cathode material in modern commercial Li-ion batteries. The form of the obtained optimal approximation allows us to deduce a simple sparse closure model. In addition to being more accurate than the classical pair approximation, this ``sparse approximation'' is also physically interpretable which allows us to a posteriori refine the hypotheses underlying construction of this class of closure models. Moreover, the mean-cluster model closed with this sparse approximation is linear and hence analytically solvable such that its parametrization is straightforward. On the other hand, parametrization of the mean-cluster model closed with the pair approximation is shown to lead to an ill-posed inverse problem.