This note deals with the approximation of sets of linear time-invariant systems via orthonormal basis functions. This problem is relevant to conditional set membership identification, where a set of feasible systems is available from observed data, and a reduced-complexity model must be estimated. The basis of the model class is made of impulse responses of linear filters. The objective of the note is to select the basis function poles according to a worst-case optimality criterion. Suboptimal conditional identification algorithms are introduced and tight bounds are provided on the associated identification errors
One form of the identification problem can ge formulated as follows: Given the input U(z) and the ou...
When the problem of restricted complexity identification is addressed in a set membership setting, t...
Frequency-domain identification algorithms are considered. The aim of this paper is to develop a new...
This note deals with the approximation of sets of linear time-invariant systems via orthonormal basi...
This paper deals with the approximation of sets of linear time-invariant systems via orthonormal bas...
Investigates the set membership identification of time-invariant, discrete-time, exponentially stabl...
A global model structure is developed for parametrization and identification of a general class of L...
Abstract: The present paper deals with the problem of reduced complexity model estimation in the fra...
The present paper deals with the problem of reduced complexity model estimation in the framework of ...
This paper develops a general and very simple construction for complete orthonormal bases for system...
The paper presents some extensions of the optimality results obtained in previous work on algorithms...
AbstractThe paper presents some extensions of the optimality results obtained in previous work on al...
Nonconvex feasible parameter sets are encountered in set membership identification whenever the regr...
Restricted complexity estimation is a major topic in control-oriented identification. Conditional al...
One form of the identification problem can ge formulated as follows: Given the input U(z) and the ou...
When the problem of restricted complexity identification is addressed in a set membership setting, t...
Frequency-domain identification algorithms are considered. The aim of this paper is to develop a new...
This note deals with the approximation of sets of linear time-invariant systems via orthonormal basi...
This paper deals with the approximation of sets of linear time-invariant systems via orthonormal bas...
Investigates the set membership identification of time-invariant, discrete-time, exponentially stabl...
A global model structure is developed for parametrization and identification of a general class of L...
Abstract: The present paper deals with the problem of reduced complexity model estimation in the fra...
The present paper deals with the problem of reduced complexity model estimation in the framework of ...
This paper develops a general and very simple construction for complete orthonormal bases for system...
The paper presents some extensions of the optimality results obtained in previous work on algorithms...
AbstractThe paper presents some extensions of the optimality results obtained in previous work on al...
Nonconvex feasible parameter sets are encountered in set membership identification whenever the regr...
Restricted complexity estimation is a major topic in control-oriented identification. Conditional al...
One form of the identification problem can ge formulated as follows: Given the input U(z) and the ou...
When the problem of restricted complexity identification is addressed in a set membership setting, t...
Frequency-domain identification algorithms are considered. The aim of this paper is to develop a new...