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

插值 H-infinity 模型降阶

Interpolatory H-infinity Model Reduction

Virginia Tech(弗吉尼亚理工大学)

Garret Flagg, Christopher Beattie, Serkan Gugercin

AI总结:

提出一种基于最优 H2 插值、实现理论和复 Chebyshev 近似的插值框架,通过 Loewner 数据驱动方法避免大规模 H-infinity 范数计算,实现高效的大规模模型降阶。

摘要:

我们引入了一个用于 H-infinity 模型降阶的插值框架,该框架基于最优 H2 插值模型降阶、实现理论和复 Chebyshev 近似的思想。通过在每次优化循环中采用 Loewner“数据驱动”框架,可以完全避免大规模 H-infinity 范数计算。因此,我们能够制定一种在大规模设置中仍然有效的方法,其主要成本由稀疏线性求解主导。几个数值例子表明,我们的方法将一致地产生比平衡截断法具有更好 H-infinity 性能的高保真降阶模型;这些模型通常与最优 Hankel 范数逼近产生的模型一样好(有时甚至更好)。在所有情况下,这些降阶模型的生成成本远低于平衡截断法或最优 Hankel 范数逼近法。

英文摘要:

We introduce an interpolation framework for H-infinity model reduction founded on ideas originating in optimal-H2 interpolatory model reduction, realization theory, and complex Chebyshev approximation. By employing a Loewner "data-driven" framework within each optimization cycle, large-scale H-infinity norm calculations can be completely avoided. Thus, we are able to formulate a method that remains effective in large-scale settings with the main cost dominated by sparse linear solves. Several numerical examples illustrate that our approach will produce high fidelity reduced models consistently exhibiting better H-infinity performance than those produced by balanced truncation; these models often are as good as (and occasionally better than) those models produced by optimal Hankel norm approximation. In all cases, these reduced models are produced at far lower cost than is possible either with balanced truncation or optimal Hankel norm approximation.

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

↑