✦ LIBER ✦

On some algorithms for non-parametric identification of linear systems

✍ Scribed by E. Asarin; E. Gorin; M. Krasnosel'skii; N. Kuznetsov

Publisher: Elsevier Science
Year: 1994
Tongue: English
Weight: 332 KB
Volume: 16
Category: Article
ISSN: 0168-9274
DOI: 10.1016/0168-9274(94)00038-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

NON-LINEAR NORMAL MODES AND NON-PARAMETR

NON-LINEAR NORMAL MODES AND NON-PARAMETRIC SYSTEM IDENTIFICATION OF NON-LINEAR OSCILLATORS

✍ X. MA; M.F.A. AZEEZ; A.F. VAKAKIS 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 224 KB

The Karhunen}Loeve (K}L) decomposition procedure is applied to a system of coupled cantilever beams with non-linear grounding sti!nesses and a system of non-linearly coupled rods. The former system possesses localized non-linear normal modes (NNMs) for certain values of the coupling parameters and h

On the optimal location of sensors for p

On the optimal location of sensors for parametric identification of linear structural systems

✍ P.H. Kirkegaard; R. Brincker 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 343 KB

An outline of the field of optimal location of sensors for parametric identification of linear structural systems is presented. There are few papers devoted to the case of optimal location of sensors in which the measurements are modeled by a random field with non-trivial covariance function. It is

Worst-case optimality of smoothing algor

Worst-case optimality of smoothing algorithms for parametric system identification

✍ Roberto Tempo 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 439 KB

We study parametric identification of uncertain systems in a deterministic setting. We assume that the problem data and the linearly parameterized system model are given. In the presence of a priori information and norm-bounded noise, we design optimal worst-case algorithms. In particular, we study

A METHOD FOR PARAMETER IDENTIFICATION OF

A METHOD FOR PARAMETER IDENTIFICATION OF STRONGLY NON-LINEAR SYSTEMS

✍ J.S. TANG 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 79 KB

The bit-cost of some algorithms for the

The bit-cost of some algorithms for the solution of linear systems

✍ B. Codenotti 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 256 KB

On the equivalence of parametric context

On the equivalence of parametric contexts for linear inequality systems

✍ M.J. Cánovas; M.A. López; J. Parra 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 183 KB

In this paper we analyze the connections among different parametric settings in which the stability theory for linear inequality systems may be developed. Our discussion is focussed on the existence, or not, of an index set (possibly infinite). For some stability approaches it is not convenient to h