arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1712.00301math.OC
收藏

面向限时$\mathcal H_2$ -最优模型降阶

Towards Time-Limited $\mathcal H_2$-Optimal Model Order Reduction

Pawan Goyal, Martin Redmann

摘要:

为了精确地数值求解偏微分方程,通常需要进行高阶空间离散。模型降阶(MOR)技术常用于空间离散系统的降阶,从而降低计算复杂性。一类特殊的MOR技术是$\mathcal H_2$ -最优方法,例如迭代有理Krylov子空间算法(IRKA)和相关方案。然而,这些方法用于在无限时间范围内获得良好的近似。因此,在这项工作中,我们的主要目标是讨论MOR计划的时间限制线性系。为此,我们提出了一个替代的时间有限的$\mathcal H_2$ -规范,并显示其与时间有限的Gramian。然后,我们提供了一阶最优性条件的最优降阶模型(ROM)的时间限制$\mathcal H_2$ -范数。基于这些最优性条件,我们提出了一个迭代格式,其收敛时,旨在满足这些条件近似。然后,我们分析了如何远离所获得的ROM由于所提出的算法是从满足最优性条件。我们使用各种数值例子测试所提出的迭代方案的效率,并说明新提出的迭代法可以导致更好的降阶相比,在有限的时间间隔的兴趣的无限制IRKA。

英文摘要:

In order to solve partial differential equations numerically and accurately, a high order spatial discretization is usually needed. Model order reduction (MOR) techniques are often used to reduce the order of spatially-discretized systems and hence reduce computational complexity. A particular class of MOR techniques are $\mathcal H_2$-optimal methods such as the iterative rational Krylov subspace algorithm (IRKA) and related schemes. However, these methods are used to obtain good approximations on a infinite time-horizon. Thus, in this work, our main goal is to discuss MOR schemes for time-limited linear systems. For this, we propose an alternative time-limited $\mathcal H_2$-norm and show its connection with the time-limited Gramians. We then provide first-order optimality conditions for an optimal reduced order model (ROM) with respect to the time-limited $\mathcal H_2$-norm. Based on these optimality conditions, we propose an iterative scheme, which, upon convergence, aims at satisfying these conditions approximately. Then, we analyze how far away the obtained ROM due to the proposed algorithm is from satisfying the optimality conditions. We test the efficiency of the proposed iterative scheme using various numerical examples and illustrate that the newly proposed iterative method can lead to a better reduced-order compared to the unrestricted IRKA in the finite time interval of interest.

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

↑