Ograniczanie wyników
Preferencje help
Widoczny [Schowaj] Abstrakt
Liczba wyników

Znaleziono wyników: 1

Liczba wyników na stronie
first rewind previous Strona / 1 next fast forward last
Wyniki wyszukiwania
Wyszukiwano:
w słowach kluczowych:  linear time-invariant regular type
help Sortuj według:

help Ogranicz wyniki do:
first rewind previous Strona / 1 next fast forward last
EN
An algorithmic method is presented for the computation of a reduced set of quadratic Plucker relations describing completely the Grassmann variety of the corresponding projective space. In particular, it is proven that a set of three terms homogeneous equations can be extracted from the whole set of quadratic Plucker relations. This set contains a specific number of equations, which exactly-constitute a reduced set of quadratic Plucker relations. This is achieved by using a simple criterion based on a correspondence between the coordinates of a decomposable vector and lexicographical orderings. In addition, the algorithm suggested is error-free from numerical computations. The above theory is used for the development of a unifying approach for pole assignment by state and output feedback, for asymptotic observer design and for zero assignment by squaring down for linear time-invariant regular type control systems.
first rewind previous Strona / 1 next fast forward last
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.