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

基于局部误差optimization的非线性模型降阶的在线自适应基构造

Online adaptive basis construction for nonlinear model reduction through local error optimization

Jun-Geol Ahn, Hyun-Ik Yang, Jin-Gyun Kim

摘要:

降阶模型(ROM)的精度主要取决于所选择的基。因此,当应用ROM处理非线性问题时,必须用有效的数值方法计算合适的基。在本文中,我们提出了一个在线自适应的基础技术,以提高质量的ROM,同时降低计算成本的非线性问题。在该方法中,自适应基由低秩更新公式定义,并设置两个辅助向量来实现这种低秩条件。为了同时解决ROM基的精度和计算成本的问题,通过优化局部残差算子来代数地导出辅助向量。结果,ROM的可靠性以低的计算成本显著提高,因为可以包含误差信息而无需传统方法中所需的全模型维度的逆运算。与传统的在线自适应基方法不同,该迭代算法的另一个特点是初始增量ROM基的数目可以改变。它可以在迭代步骤中提供高质量ROM子空间的快速有效的生成过程。详细的推导过程中提出的方法,其性能进行评估,在各种非线性数值例子。

英文摘要:

The accuracy of the reduced-order model (ROM) mainly depends on the selected basis. Therefore, it is essential to compute an appropriate basis with an efficient numerical procedure when applying ROM to nonlinear problems. In this paper, we propose an online adaptive basis technique to increase the quality of ROM while decreasing the computational costs in nonlinear problems. In the proposed method, the adaptive basis is defined by the low-rank update formulation, and two auxiliary vectors are set to implement this low-rank condition. To simultaneously tackle the issues of accuracy and the computational cost of the ROM basis, the auxiliary vectors are algebraically derived by optimizing a local residual operator. As a result, the reliability of ROM is significantly improved with a low computational cost because the error information can be contained without inverse operations of the full model dimension required in conventional approaches. The other feature of the proposed iterative algorithm is that the number of the initial incremental ROM basis could be varied, unlike in the typical online adaptive basis approaches. It may provide a fast and effective spanning process of the high-quality ROM subspace in the iteration step. A detailed derivation process of the proposed method is presented, and its performance is evaluated in various nonlinear numerical examples.

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

↑