𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the lower smoothing bound in identification of time-varying systems

✍ Scribed by Maciej Niedźwiecki

Publisher
Elsevier Science
Year
2008
Tongue
English
Weight
196 KB
Volume
44
Category
Article
ISSN
0005-1098

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Optimal and suboptimal smoothing algorit
Optimal and suboptimal smoothing algorithms for identification of time-varying systems with randomly drifting parameters
✍ Maciej Niedźwiecki 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 617 KB

Noncausal estimation algorithms, which involve smoothing, can be used for off-line identification of nonstationary systems. Since smoothing is based on both past and future data, it offers increased accuracy compared to causal (tracking) estimation schemes, incorporating past data only. It is shown

A Parametrization for the closed-loop id
A Parametrization for the closed-loop identification of nonlinear time-varying systems
✍ Soura Dasgupta; Brian D.O. Anderson 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 993 KB

## We convert the closed-loop identification of nonlinear time-varying plants, with high signal-to-noise ratio, to an open-loop identification problem of an associated Youla-Kucera parameter. The plant must be stabilizable by a known linear, possibly time-varying controller.

A WAVELET-BASED APPROACH FOR THE IDENTIF
A WAVELET-BASED APPROACH FOR THE IDENTIFICATION OF LINEAR TIME-VARYING DYNAMICAL SYSTEMS
✍ ROGER GHANEM; FRANCESCO ROMEO 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 260 KB

A novel procedure is developed for the identi"cation of linear discrete models of dynamical systems from noisy data. Of particular interest is the application of the methodology to time-varying systems. The procedure is based on a representation of the governing di!erential equations with respect to

A lower bound on the number of Semi-Bool
A lower bound on the number of Semi-Boolean quadruple systems
✍ Marco Buratti; Alberto Del Fra 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 135 KB 👁 1 views

## Abstract A Steiner quadruple system of order 2^__n__^ is __Semi‐Boolean__ (SBQS(2^__n__^) in short) if all its derived triple systems are isomorphic to the point‐line design associated with the projective geometry __PG__(__n__−1, 2). We prove by means of explicit constructions that for any __n__