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

时间隐式降阶模型的稀疏Jacobian有效逼近

Efficient approximation of sparse Jacobians for time-implicit reduced order models

Răzvan Ştefănescu, Adrian Sandu

摘要:

本文介绍了一种稀疏矩阵离散插值方法,有效地计算矩阵近似的降阶建模框架。本文开发的稀疏算法依赖于离散经验插值方法,并且仅使用矩阵序列的非零项的样本。所提出的方法可以近似非常大的矩阵,不像目前的矩阵离散经验插值方法,这是有限的,其大的计算内存的要求。稀疏算法得到的经验插值指数与矩阵离散经验插值方法计算的指数略有不同,这是由于经济或全奇异值分解(SVD)算法应用于全矩阵快照时引入的奇异向量舍入误差造成的。当适当地用零填充时,快照矩阵的非零元素的经济SVD分解是完整快照矩阵的有效经济SVD。数值实验进行了一维Burgers和二维浅水方程测试问题的二次约化非线性通过张量演算计算。稀疏矩阵近似策略与现有的五种计算约化雅可比矩阵的方法进行了比较:a)矩阵离散经验插值方法,b)离散经验插值方法,c)张量演算,d)到约化基子空间上的全雅可比投影,以及e)沿约化基函数的模型的方向导数。稀疏矩阵方法优于所有其他算法。传统的矩阵离散经验插值方法对内存的要求很高,不适用于大型实例。

英文摘要:

This paper introduces a sparse matrix discrete interpolation method to effectively compute matrix approximations in the reduced order modeling framework. The sparse algorithm developed herein relies on the discrete empirical interpolation method and uses only samples of the nonzero entries of the matrix series. The proposed approach can approximate very large matrices, unlike the current matrix discrete empirical interpolation method which is limited by its large computational memory requirements. The empirical interpolation indexes obtained by the sparse algorithm slightly differ from the ones computed by the matrix discrete empirical interpolation method as a consequence of the singular vectors round-off errors introduced by the economy or full singular value decomposition (SVD) algorithms when applied to the full matrix snapshots. When appropriately padded with zeros the economy SVD factorization of the nonzero elements of the snapshots matrix is a valid economy SVD for the full snapshots matrix. Numerical experiments are performed with the 1D Burgers and 2D Shallow Water Equations test problems where the quadratic reduced nonlinearities are computed via tensorial calculus. The sparse matrix approximation strategy is compared against five existing methods for computing reduced Jacobians: a) matrix discrete empirical interpolation method, b) discrete empirical interpolation method, c) tensorial calculus, d) full Jacobian projection onto the reduced basis subspace, and e) directional derivatives of the model along the reduced basis functions. The sparse matrix method outperforms all other algorithms. The use of traditional matrix discrete empirical interpolation method is not possible for very large instances due to its excessive memory requirements.

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

↑