Adaptive subspace identification based on fast moving window QR decomposition
|更新时间:2025-12-10
|
Adaptive subspace identification based on fast moving window QR decomposition
CIESC JournalIssue 6, Pages: 1448-1453(2008)
作者机构:
1. 浙江大学系统与控制研究所,工业控制技术国家重点实验室
2. 电力电子工程及计算机科学学院
作者简介:
基金信息:
DOI:
CLC:
Online First:05 June 2008,
Published:05 June 2008
稿件说明:
移动端阅览
XIE Lei, LIANG Wuxing, ZHANG Quanling, et al. Adaptive subspace identification based on fast moving window QR decomposition[J]. CIESC Journal, 2008, (6): 1448-1453.
DOI:
XIE Lei, LIANG Wuxing, ZHANG Quanling, et al. Adaptive subspace identification based on fast moving window QR decomposition[J]. CIESC Journal, 2008, (6): 1448-1453.DOI:
Adaptive subspace identification based on fast moving window QR decomposition
Subspace identification identifies the state space model directly based on the process input and output data.Due to its simplicity and efficiency
subspace identification method is widely used in MIMO process identification.The main obstacle towards implementing adaptive subspace identification is developing online QR and SVD decomposition algorithms.A fast QR decomposition procedure was proposed by simultaneously applying data updating and downdating
which outperformed traditional algorithms in terms of computational efficiency.Complexity analysis showed that fast QR decomposition could save 8.3% computational cost compared with the two-step approach.Numerical simulation study demonstrated the efficiency of the proposed algorithm.