首页> 外文期刊>Statistics and Its Interface >Iterative algorithms for weighted and unweighted finite-rank time-series approximations
【24h】

Iterative algorithms for weighted and unweighted finite-rank time-series approximations

机译:加权和非加权有限秩时间序列逼近的迭代算法

获取原文
           

摘要

The problem of time series approximation by series of finite rank is considered from the viewpoint of signal extraction. For signal estimation, a weighted least-squares method is applied to the trajectory matrix of the considered time series. Matrix weights are chosen to obtain equal or approximately equal weights in the equivalent problem of timeseries least-squares approximation. Several new methods are suggested and examined together with the Cadzow’s iterative method. The questions of convergence, computational complexity, and accuracy are considered for the proposed methods. The methods are compared on numeric examples.
机译:从信号提取的角度考虑了用有限秩序列进行时间序列逼近的问题。对于信号估计,将加权最小二乘法应用于考虑的时间序列的轨迹矩阵。在时间序列最小二乘近似的等效问题中,选择矩阵权重以获得相等或近似相等的权重。提出了几种新方法,并与Cadzow的迭代方法一起进行了研究。对于所提出的方法,考虑了收敛性,计算复杂性和准确性的问题。在数值示例上比较了这些方法。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号