✦ LIBER ✦

Further results on trajectory insensitivity

✍ Scribed by A. Locatelli; N. Schiavoni

Publisher: Elsevier Science
Year: 1976
Tongue: English
Weight: 336 KB
Volume: 12
Category: Article
ISSN: 0005-1098
DOI: 10.1016/0005-1098(76)90030-3

No coin nor oath required. For personal study only.

✦ Synopsis

Further contributions are given to the problem of synthesizing an insensitivity generating control law for a linear system. The results refer to the possibility of achieving trajectory insensitivity for any given subspace of initial conditions without modifying the state controllability subspace of the system.

📜 SIMILAR VOLUMES

On a specific substitution theorem: furt

On a specific substitution theorem: further results

✍ Antonino M. Sommariva 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 76 KB

Apparently, the independent andator is the logical and lexical counterpart of the norator, while the well-known nullator is an independent andator with zero voltage and zero current signals. ¸emma Hypotheses: N is a lumped network free from redundant sources (i.e. free from loops made of independen

Further reflections on linkage results i

Further reflections on linkage results in schizophrenia

✍ Baron, Miron 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 313 KB 👁 1 views

Further Results on Proof Theories For Se

Further Results on Proof Theories For Semilattice Logics

✍ Robert K. Meyer; Errol P. Martin; Steve Giambrone; Alasdair Urquhart 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 212 KB

Further results on the accuracy of the S

Further results on the accuracy of the SSpj algorithms

✍ Wood, W. L. 📂 Article 📅 1987 🏛 Wiley (John Wiley & Sons) 🌐 English ⚖ 315 KB

Further results on the lower bounds of m

Further results on the lower bounds of mean color numbers

✍ F. M. Dong 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 181 KB 👁 1 views

Let G be a graph with n vertices. The mean color number of G, denoted by (G), is the average number of colors used in all n-colorings of G. This paper proves that (G) ! (Q), where Q is any 2-tree with n vertices and G is any graph whose vertex set has an ordering x 1 ,x 2 , . . . ,x n such that x i

Further results on forecasting and model

Further results on forecasting and model selection under asymmetric loss

✍ Peter F. Christoffersen; Francis X. Diebold 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 606 KB

We make three related contributions. First, we propose a new technique for solving prediction problems under asymmetric loss using piecewise-linear approximations to the loss function, and we establish existence and uniqueness of the optimal predictor. Second, we provide a detailed application to op