首页> 外文期刊>urnal of Symbolic Computation >A probabilistic algorithm to test local algebraic observability in polynomial time
【24h】

A probabilistic algorithm to test local algebraic observability in polynomial time

机译:在多项式时间内测试局部代数可观性的概率算法

获取原文
获取原文并翻译 | 示例
       

摘要

The following questions are often encountered in system and control theory. Given an algebraic model of a physical process, which variables can be, in theory, deduced from the input-output behaviour of an experiment? How many of the remaining variables should we assume to be known in order to determine all the others? These questions are parts of the local algebraic observability problem which is concerned with the existence of a non-trivial Lie subalgebra of model's symmetries letting the inputs and the outputs be invariant.
机译:在系统和控制理论中经常遇到以下问题。给定物理过程的代数模型,理论上可以从实验的输入输出行为推导哪些变量?为了确定所有其他变量,我们应该假设知道剩余多少个变量?这些问题是局部代数可观察性问题的一部分,该问题与模型对称性的非平凡李子代数的存在有关,从而使输入和输出不变。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号