arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2304.01802math.NAcs.LGcs.NA
收藏

机器学习发现等几何分析的最优求积规则

Machine Learning Discovery of Optimal Quadrature Rules for Isogeometric Analysis

BCAM – Basque Center for Applied Mathematics(巴斯克应用数学中心(BCAM));CUNEF University(CUNEF大学);University of the Basque Country (UPV/EHU)(巴斯克大学(UPV/EHU));Ikerbasque – Basque Foundation for Sciences(巴斯克科学基金会(Ikerbasque))

Tomas Teijeiro, Jamie M. Taylor, Ali Hashemian, David Pardo

AI总结:

提出基于梯度下降和动态规划的机器学习策略,为等几何分析寻找最优求积规则,在保持精度的同时显著减少积分点数,实现1D至3D空间高达44%-82%的计算节省。

摘要:

我们提出使用机器学习技术来寻找最优求积规则,用于在等几何分析(IGA)中构建刚度矩阵和质量矩阵。我们首先考虑在均匀和非均匀节点序列上展开的任意次数的一维样条空间,然后使用张量积方式将生成的最优规则用于高维空间的积分。求积规则搜索被表述为优化问题,并通过基于梯度下降的机器学习策略求解。然而,由于优化空间高度非凸,搜索的成功强烈依赖于求积点数和参数初始化。因此,我们使用动态规划策略,从具有较少节点数的样条空间上的最优解初始化参数。通过这种方法,我们在使用多达50个均匀元素和高达8次多项式次数的IGA离散化时,找到了样条空间的最优求积规则,展示了该方法在此场景中的通用性。对于非均匀划分,该方法也在合理数量的测试案例中找到了最优规则。我们还在两个实际案例研究中评估了生成的最优规则,即Laplace算子的特征值问题和自由形态曲梁的特征频率分析,后者展示了该方法对曲率几何的适用性。特别是,所提出的方法相对于传统高斯积分在1D中节省高达44%,在2D中节省68%,在3D中节省82%。

英文摘要:

We propose the use of machine learning techniques to find optimal quadrature rules for the construction of stiffness and mass matrices in isogeometric analysis (IGA). We initially consider 1D spline spaces of arbitrary degree spanned over uniform and non-uniform knot sequences, and then the generated optimal rules are used for integration over higher-dimensional spaces using tensor product sense. The quadrature rule search is posed as an optimization problem and solved by a machine learning strategy based on gradient-descent. However, since the optimization space is highly non-convex, the success of the search strongly depends on the number of quadrature points and the parameter initialization. Thus, we use a dynamic programming strategy that initializes the parameters from the optimal solution over the spline space with a lower number of knots. With this method, we found optimal quadrature rules for spline spaces when using IGA discretizations with up to 50 uniform elements and polynomial degrees up to 8, showing the generality of the approach in this scenario. For non-uniform partitions, the method also finds an optimal rule in a reasonable number of test cases. We also assess the generated optimal rules in two practical case studies, namely, the eigenvalue problem of the Laplace operator and the eigenfrequency analysis of freeform curved beams, where the latter problem shows the applicability of the method to curved geometries. In particular, the proposed method results in savings with respect to traditional Gaussian integration of up to 44% in 1D, 68% in 2D, and 82% in 3D spaces.

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

↑