✦ LIBER ✦

On generic stabilizability and pole assignability

✍ Scribed by M.S. Ravi; Joachim Rosenthal; Xiaochang Wang

Publisher: Elsevier Science
Year: 1994
Tongue: English
Weight: 469 KB
Volume: 23
Category: Article
ISSN: 0167-6911
DOI: 10.1016/0167-6911(94)90037-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Comments on pole assignability over ring

Comments on pole assignability over rings

✍ C.G. Naudé; G. Naudé 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 249 KB

On pole assignability over polynomial ri

On pole assignability over polynomial rings

✍ Allen Tannenbaum 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 238 KB

all of which may be found in Hartshorne [3]. For the sake of completeness we collect some of the more important facts in Section 1.

Pole assignability and the invariant fac

Pole assignability and the invariant factor theorem in Prüfer domains and Dedekind domains

✍ James Brewer; Lee Klingler 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 576 KB

On pole assignment problems in polynomia

On pole assignment problems in polynomial rings

✍ Pramod K. Sharma 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 349 KB

On adaptive estimation and pole assignme

On adaptive estimation and pole assignment of overparametrized systems

✍ Liga Xia; J. B. Moore; M. Gevers 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 752 KB

Pole assignment, a new proof and algorit

Pole assignment, a new proof and algorithm

✍ Rikus Eising 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 349 KB

In this paper a new proof of the pol e assignment theorem is given. This proof is a very straightforward one. II is not based on canoni cal forms and also rhe reduction IO the single input case (Heymann's lemma) is not used. Furthermore. an algorithm is given which allows IO take into account numeri