ON POLE ASSIGNABILITY AND FEEDEBACK CYCLISATION FOR SYSTEMS OVER RINGS OF FINITE DIMENSION

DOI10.1080/16073606.1988.9632162zbMath0663.93034OpenAlexW1975300386MaRDI QIDQ3815201

F. Minnaar, G. Naude

Publication date: 1989

Published in: Quaestiones Mathematicae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/16073606.1988.9632162

zbMATH Keywords

dynamic feedbacksystems over ringspole assignabilityfeedback cyclisation

Mathematics Subject Classification ID

Linear systems in control theory (93C05) Pole and zero placement problems (93B55) Projective and free modules and ideals in commutative rings (13C10) Algebraic methods (93B25)

Cites Work

• Unnamed Item
• Unnamed Item
• Pole assignment for systems over rings
• Comments on pole assignability over rings
• The pole assignability property in polynomial rings over GCD-domains
• On pole assignment problems in polynomial rings
• Some results on pole-placement and reachability
• Generating non-Noetherian modules efficiently
• Pole assignability in polynomial rings, power series rings, and Prüfer domains
• On the pole assignability property over commutative rings
• Pole assignability of rings of low dimension
• Dynamic feedback over commutative rings
• New results on pole-shifting for parametrized families of systems
• On \(\text{Pic}(R[X)\) for \(R\) seminormal]
• Remarks on the pole-shifting problem over rings
• Polynomial rings over arbitrary fields in two or more variables are not pole assignable
• On the stabilizer subgroup of a pair of matrices
• Generating modules efficiently: Theorems from algebraic K-theory
• Finitely generated modules over Bezout rings
• Determinants in Projective Modules
• On bézout domains, elementary divisor rings, and pole assignability

This page was built for publication: ON POLE ASSIGNABILITY AND FEEDEBACK CYCLISATION FOR SYSTEMS OVER RINGS OF FINITE DIMENSION