...
首页> 外文期刊>IEEE Transactions on Automatic Control >On the existence of stationary points for the Steiglitz-McBride algorithm
【24h】

On the existence of stationary points for the Steiglitz-McBride algorithm

机译:关于Steiglitz-McBride算法的平稳点的存在

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

摘要

Most convergence results for adaptive identification algorithms have been developed in sufficient order settings, involving an unknown system with known degree. Reduced-order settings, in which the degree of the unknown system is underestimated, are more common, but more difficult to analyze. Deducing stationary points in these cases typically involves solving nonlinear equations, hence the sparseness of results for reduced-order cases. If we allow ourselves the tractable case in which the input to an identification experiment is white noise, we shall show that the Steiglitz-McBride method (1965) indeed admits a stationary point in reduced-order settings for which the resulting model is stable. Our interest in this study stems from a previous result, showing an attractive a priori bound on the mismodeling error at any such stationary point.
机译:自适应识别算法的大多数收敛结果都是在足够的阶数设置下开发的,涉及到一个已知程度的未知系统。降阶设置(其中低估未知系统的程度)更常见,但更难分析。在这些情况下,推导平稳点通常涉及求解非线性方程,因此,对于降阶情况,结果的稀疏性。如果我们允许自己在识别实验输入为白噪声的易处理情况下,我们将证明Steiglitz-McBride方法(1965)确实允许降阶设置中的平稳点,对于该点,结果模型是稳定的。我们对这项研究的兴趣源于先前的结果,显示出在任何这样的固定点上,模型错误的诱人先验约束。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号