Errors-in-variables system identification can be posed and solved as a Hankel structured low-rank approximation problem. In this paper different estimates based on suboptimal low-rank approximations are considered. The estimates are shown to have almost the same efficiency and lead to the same minimum when supplied as an initial approximation to local optimization solver of the structured low-rank approximation problem. In this paper it is shown that increasing Hankel matrix window length improves suboptimal estimates for autonomous systems and does not improve them for systems with inputs
Abstract. We consider the problem of approximating an affinely structured matrix, for example, a Han...
Fitting data by a bounded complexity linear model is equivalent to low-rank approximation of a matri...
The aim of this paper is to show how Chebycheff approximation may be used in frequency weighted ℋ∞ s...
Rank deficiency of a data matrix is equivalent to the existence of an exact linear model for the dat...
Rank deficiency of a data matrix is equivalent to the existence of an exact linear model for the dat...
Abstract. System identification is a fast growing research area that encompasses a broad range of pr...
Matrix low-rank approximation is intimately related to data modelling; a problem that arises frequen...
In this thesis, the use of low-rank approximations in connection with problems in system identificat...
In this thesis, the use of low-rank approximations in connection with problems in system identificat...
In this thesis, the use of low-rank approximations in connection with problems in system identificat...
In this note we present a new updating technique to estimate a low rank approximation of the Hankel ...
In this note we present a new updating technique to estimate a low rank approximation of the Hankel ...
In this note we present a new updating technique to estimate a low rank approximation of the Hankel ...
atrix low-rank approximation is intimately related to data modelling; a problem that arises frequent...
In this note we present a new updating technique to estimate a low rank approximation of the Hankel ...
Abstract. We consider the problem of approximating an affinely structured matrix, for example, a Han...
Fitting data by a bounded complexity linear model is equivalent to low-rank approximation of a matri...
The aim of this paper is to show how Chebycheff approximation may be used in frequency weighted ℋ∞ s...
Rank deficiency of a data matrix is equivalent to the existence of an exact linear model for the dat...
Rank deficiency of a data matrix is equivalent to the existence of an exact linear model for the dat...
Abstract. System identification is a fast growing research area that encompasses a broad range of pr...
Matrix low-rank approximation is intimately related to data modelling; a problem that arises frequen...
In this thesis, the use of low-rank approximations in connection with problems in system identificat...
In this thesis, the use of low-rank approximations in connection with problems in system identificat...
In this thesis, the use of low-rank approximations in connection with problems in system identificat...
In this note we present a new updating technique to estimate a low rank approximation of the Hankel ...
In this note we present a new updating technique to estimate a low rank approximation of the Hankel ...
In this note we present a new updating technique to estimate a low rank approximation of the Hankel ...
atrix low-rank approximation is intimately related to data modelling; a problem that arises frequent...
In this note we present a new updating technique to estimate a low rank approximation of the Hankel ...
Abstract. We consider the problem of approximating an affinely structured matrix, for example, a Han...
Fitting data by a bounded complexity linear model is equivalent to low-rank approximation of a matri...
The aim of this paper is to show how Chebycheff approximation may be used in frequency weighted ℋ∞ s...