DocumentCode :
3526281
Title :
State covariances and the matrix completion problem
Author :
Yongxin Chen ; Jovanovic, Mihailo R. ; Georgiou, Tryphon T.
Author_Institution :
Dept. of Electr. & Comput. Eng., Univ. of Minnesota, Minneapolis, MN, USA
fYear :
2013
fDate :
10-13 Dec. 2013
Firstpage :
1702
Lastpage :
1707
Abstract :
State statistics of a linear system obey certain structural constraints that arise from the underlying dynamics and the directionality of input disturbances. Herein, we formulate completion problems of partially known state statistics with the added freedom of identifying disturbance dynamics. The goal of the proposed completion problem is to obtain information about input excitations that explain observed sample statistics. Our formulation aims at low-complexity models for admissible disturbances. The complexity represents the dimensionality of the subspace of the state-dynamics that is directly affected by disturbances. An example is provided to illustrate that colored-in-time stochastic processes can be effectively used to explain available data.
Keywords :
matrix algebra; stochastic processes; colored-in-time stochastic process; disturbance dynamics; low-complexity models; matrix completion problem; state covariances; state statistics; Complexity theory; Covariance matrices; Eigenvalues and eigenfunctions; Equations; Mathematical model; Matrix decomposition; Optimization; Convex optimization; low-rank approximation; noise statistics; nuclear norm regularization; state covariances; structured matrix completion problems;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Decision and Control (CDC), 2013 IEEE 52nd Annual Conference on
Conference_Location :
Firenze
ISSN :
0743-1546
Print_ISBN :
978-1-4673-5714-2
Type :
conf
DOI :
10.1109/CDC.2013.6760127
Filename :
6760127
Link To Document :
بازگشت