arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 0908.3954math.NAcs.CCcs.NA
收藏

关于区间矩阵的指数运算

On the Exponentiation of Interval Matrices

Laboratoire d'Informatique de Nantes Atlantique\ \'e des Sciences et des Techniques 2, rue de la Houssini\`ere\ 92208, 44322 Nantes CEDEX 3, France

Alexandre Goldsztejn

AI总结:

本文证明计算区间矩阵指数的精确包络是NP-hard问题,并提出一种改进的缩放与平方方法以减少区间评估中的依赖损失。

摘要:

实数矩阵指数运算的数值计算已被深入研究。一个好的数值方法的主要目标是处理舍入误差和计算成本。当处理区间矩阵指数运算时,情况更为复杂:实际上,主要问题将是区间评估导致的变量不同出现之间的依赖损失,这可能产生如此宽的包络以至于它们毫无用处。本文证明计算区间矩阵指数的精确包络是NP-hard问题。然后,将缩放与平方方法适应于区间矩阵,并显示该方法相对于泰勒级数的区间评估显著减少了依赖损失。

英文摘要:

The numerical computation of the exponentiation of a real matrix has been intensively studied. The main objective of a good numerical method is to deal with round-off errors and computational cost. The situation is more complicated when dealing with interval matrices exponentiation: Indeed, the main problem will now be the dependency loss of the different occurrences of the variables due to interval evaluation, which may lead to so wide enclosures that they are useless. In this paper, the problem of computing a sharp enclosure of the interval matrix exponential is proved to be NP-hard. Then the scaling and squaring method is adapted to interval matrices and shown to drastically reduce the dependency loss w.r.t. the interval evaluation of the Taylor series.

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

↑