This letter deals with a system identification problem with unknown model order, which can be formulated as the matrix rank minimization problem by applying the subspace identification method. A sequential rank minimization algorithm is provided by modifying the null space based alternating optimization (NSAO) algorithm, and a model order identification algorithm is proposed. Numerical examples show that the proposed sequential algorithm can adaptively identify the model order of switched systems whose model order changes.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Katsumi KONISHI, "Sequential Matrix Rank Minimization Algorithm for Model Order Identification" in IEICE TRANSACTIONS on Fundamentals,
vol. E95-A, no. 10, pp. 1788-1791, October 2012, doi: 10.1587/transfun.E95.A.1788.
Abstract: This letter deals with a system identification problem with unknown model order, which can be formulated as the matrix rank minimization problem by applying the subspace identification method. A sequential rank minimization algorithm is provided by modifying the null space based alternating optimization (NSAO) algorithm, and a model order identification algorithm is proposed. Numerical examples show that the proposed sequential algorithm can adaptively identify the model order of switched systems whose model order changes.
URL: https://globals.ieice.org/en_transactions/fundamentals/10.1587/transfun.E95.A.1788/_p
Copy
@ARTICLE{e95-a_10_1788,
author={Katsumi KONISHI, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Sequential Matrix Rank Minimization Algorithm for Model Order Identification},
year={2012},
volume={E95-A},
number={10},
pages={1788-1791},
abstract={This letter deals with a system identification problem with unknown model order, which can be formulated as the matrix rank minimization problem by applying the subspace identification method. A sequential rank minimization algorithm is provided by modifying the null space based alternating optimization (NSAO) algorithm, and a model order identification algorithm is proposed. Numerical examples show that the proposed sequential algorithm can adaptively identify the model order of switched systems whose model order changes.},
keywords={},
doi={10.1587/transfun.E95.A.1788},
ISSN={1745-1337},
month={October},}
Copy
TY - JOUR
TI - Sequential Matrix Rank Minimization Algorithm for Model Order Identification
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1788
EP - 1791
AU - Katsumi KONISHI
PY - 2012
DO - 10.1587/transfun.E95.A.1788
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E95-A
IS - 10
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - October 2012
AB - This letter deals with a system identification problem with unknown model order, which can be formulated as the matrix rank minimization problem by applying the subspace identification method. A sequential rank minimization algorithm is provided by modifying the null space based alternating optimization (NSAO) algorithm, and a model order identification algorithm is proposed. Numerical examples show that the proposed sequential algorithm can adaptively identify the model order of switched systems whose model order changes.
ER -