arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1004.2924math.OCcs.SCmath.RA
收藏

使用Ore代数的精确线性建模

Exact linear modeling using Ore algebras

Kristina Schindelar, Viktor Levandovskyy, Eva Zerz

摘要:

线性精确建模是一个来自系统辨识的问题:给定一组观测到的轨迹,目标是找到一个模型(通常是偏微分和/或差分方程的系统),尽可能精确地解释数据。常系数算子的情况在系统理论文献中得到了很好的研究和了解,而变系数算子只是最近才得到解决。这个问题可以用Ore代数上模的Gröbner基来解决,也可以用微分代数的思想和交换环中的计算来解决。在本文中,我们提出了算法的方法来计算“最强大的不可伪造的模型”(MPUM)和他们的同行与变系数(VMPUM)的多项式和多项式指数信号。我们还研究了由此产生的模型的结构特性,讨论了算法背后的计算机代数技术,并提供了几个例子。

英文摘要:

Linear exact modeling is a problem coming from system identification: Given a set of observed trajectories, the goal is find a model (usually, a system of partial differential and/or difference equations) that explains the data as precisely as possible. The case of operators with constant coefficients is well studied and known in the systems theoretic literature, whereas the operators with varying coefficients were addressed only recently. This question can be tackled either using Gröbner bases for modules over Ore algebras or by following the ideas from differential algebra and computing in commutative rings. In this paper, we present algorithmic methods to compute "most powerful unfalsified models" (MPUM) and their counterparts with variable coefficients (VMPUM) for polynomial and polynomial-exponential signals. We also study the structural properties of the resulting models, discuss computer algebraic techniques behind algorithms and provide several examples.

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

↑