Pole placement with fields of positive characteristic
From MaRDI portal
Abstract: The pole placement problem belongs to the classical problems of linear systems theory. It is often assumed that the ground field is the real numbers R or the complex numbers C. The major result over the complex numbers derived in 1981 by Brockett and Byrnes states that arbitrary static pole placement is possible for a generic set of m-inputs, p-outputs and McMillan degree n system as soon as mp>=n. Moreover the number of solutions in the situation mp=n is an intersection number first computed by Hermann Schubert in the 19th century. In this paper we show that the same result with slightly different proofs holds over any algebraically closed field.
Recommendations
Cited in
(10)- Pole placement for overdetermined 2D systems
- On the pole placement problem for linear systems of arbitrary genus
- On the number of special feedback configurations in linear modular systems
- On 2-D pole placement
- Minimum sensitivity pole placer
- scientific article; zbMATH DE number 741139 (Why is no real title available?)
- Pole Placement and Matrix Extension Problems: A Common Point of View
- Dynamic Pole Assignment and Schubert Calculus
- scientific article; zbMATH DE number 2243643 (Why is no real title available?)
- Some results on the genericity of the pole placement problem
This page was built for publication: Pole placement with fields of positive characteristic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3001232)
