scispace - formally typeset
Search or ask a question

Showing papers by "Michel Gevers published in 1992"


Journal ArticleDOI
TL;DR: The paper concludes by showing how the obtained error bounds can be used for intelligent model order selection that takes into account both measurement noise and under-model- ing.
Abstract: Previous results on estimating errors or error bounds on identified transfer functions have relied on prior assumptions about the noise and the unmodeled dynamics. This prior information took the form of parameterized bounding functions or parameterized probability density functions, in the time or frequency domain with known parameters. It is shown that the parameters that quantify this prior information can themselves be estimated from the data using a maximum likelihood technique. This significantly reduces the prior information required to estimate transfer function error bounds. The authors illustrate the usefulness of the method with a number of simulation examples. How the obtained error bounds can be used for intelligent model-order selection that takes into account both measurement noise and under-modeling is shown. Another simulation study compares the method to Akaike's well-known FPE and AIC criteria. >

370 citations


Journal ArticleDOI
TL;DR: It is shown that a subset of the optimal realization set consists of sparse Schur realizations, whose actual sensitivity is even smaller than the theoretical minimal sensitivity.
Abstract: The optimal finite word length (FWL) state-space digital system problem is investigated. Instead of the unusual sensitivity measure, it is argued that it may be desirable to minimize a frequency weighted sensitivity measure over all similarity transformations. The set of optimal realizations minimizing this weighted sensitivity is completely characterized, and an algorithm is proposed to find the optimal solution set. It is shown that a subset of the optimal realization set consists of sparse Schur realizations, whose actual sensitivity (taking into account the zero elements) is even smaller than the theoretical minimal sensitivity. Some properties of the Schur realizations are discussed. A numerical example that confirms the theoretical results is given. >

106 citations


Journal ArticleDOI
TL;DR: In this paper, the interactions between identification and control design are illustrated, and a number of recent results are presented that aim at enhancing the synergy between these two fields, aiming to improve the quality of the identified model.

69 citations


Proceedings ArticleDOI
24 Jun 1992
TL;DR: The methodology of [1] is analyzed from the viewpoint of closed loop signal conditioning and the effect of the noise modelling error and plant modelling error on the closed loop performance is investigated.
Abstract: Many practical applications of control system design based on input-output measurements permit the repeated application of a system identification procedure operating on closed loop data together with successive refinement of the designed controller. Recently several iterative schemes for mutually enhanced plant identification and robust control design have been proposed [l]-[3]. In this paper we shall analyze the methodology of [1] from the viewpoint of closed loop signal conditioning and investigate the effect of the noise modelling error and plant modelling error on the closed loop performance.

32 citations


Journal ArticleDOI
TL;DR: In this paper, the convergence of the solutions of the differential difference Riccati equations to the strong solution of the corresponding algebraic Richecati equation (ARE) is addressed.
Abstract: The convergence of the solutions of the differential difference Riccati equations to the strong solution of the corresponding algebraic Riccati equation (ARE) is addressed. Detectability only is required in the analysis, and no assumption is made on the eigenvalues on the real imaginary axis (on the unit circle, in the discrete-time case). In particular, from the results, it follows that under the sole assumption of detectability, a positive definite initial condition guarantees convergence to the strong solution, even in the presence of unreachable eigenvalues on the imaginary axis or on the unit circle. >

24 citations


Journal ArticleDOI
TL;DR: An algorithm that directly identifies the unknown parameters is presented, and the authors characterize the convergence domains under two different sets of assumptions on the excitation of the signals.
Abstract: Often, a dynamical model is nonlinear in the unknown parameters, but it can be transformed into an overparametrized linear regression model, where the components of the overparametrization vector are nonlinear functions of the smaller number of unknown parameters. An algorithm that directly identifies the unknown parameters is presented, and the authors characterize the convergence domains under two different sets of assumptions on the excitation of the signals. The corresponding convergence rates are computed. >

15 citations


Journal ArticleDOI
TL;DR: In this paper, an adaptive generalized predictive control (AGC) algorithm was applied to the regulation of glass temperature in an industrial furnace operated by the Glaverbel Company (Belgium).

12 citations


Proceedings ArticleDOI
16 Dec 1992
TL;DR: In this article, it was shown that the existence of a simultaneous stabilizing controller for more than two plants is not guaranteed by the controller such that the closed loops have no real unstable poles.
Abstract: The authors disprove conjectures on simultaneous stabilizability conditions by showing that, unlike the case of two plants, the existence of a simultaneous stabilizing controller for more than two plants is not guaranteed by the existence of a controller such that the closed loops have no real unstable poles. An example of a plant which has the even interlacing property but which is not stabilizable by a bistable controller is presented. >

6 citations


Proceedings ArticleDOI
16 Dec 1992
TL;DR: In this paper, it was established that a reparametrization of a discrete transfer function in terms of polynomials other than the classical powers of the shift operator z is equivalent to a filtering of the data.
Abstract: It is established that a reparametrization of a discrete transfer function in terms of polynomials other than the classical powers of the shift operator z is equivalent to a filtering of the data. In adaptive parameter estimation problems, such reparametrization can yield significantly better accuracy for the estimate and convergence speed for the parameter estimator. One such generalized parametrization is presented. It yields good numerical results independently of the spectral properties of the data that enter into the unknown system. >

6 citations


01 Jan 1992
TL;DR: In this paper, the parameters that quantify this prior information can themselves be estimated from the data using a maximum likelihood technique, which significantly reduces the prior infor- mation required to estimate transfer function error bounds.
Abstract: Previous results on estimating errors or error bounds on identified transfer functions have relied upon prior assumptions about the noise and the unmodeled dynamics. This prior information took the form of parameterized bounding functions or parameterized probability density functions, in the time or frequency domain with known parameters. Here we show that the parameters that quantify this prior information can themselves be estimated from the data using a maximum likelihood technique. This significantly reduces the prior infor- mation required to estimate transfer function error bounds. We illustrate the usefulness of the method with a number of simula- tion examples. The paper concludes by showing how the obtained error bounds can be used for intelligent model order selection that takes into account both measurement noise and under-model- ing. Another simulation study compares our method to Akaike's well-known FPE and AIC criteria.