On pole assignability over polynomial rings

DOI10.1016/S0167-6911(82)80037-6zbMath0486.93027OpenAlexW2063589427MaRDI QIDQ1165209

Allen Tannenbaum

Publication date: 1982

Published in: Systems \& Control Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0167-6911(82)80037-6

zbMATH Keywords

elliptic curvespolynomial ringpole assignability

Mathematics Subject Classification ID

Controllability (93B05) Special algebraic curves and curves of low genus (14H45) Controllability, observability, and system structure (93B99)

Related Items (7)

New results on pole-shifting for parametrized families of systems ⋮ Preserving pole assignable systems and reachable systems in commutative rings ⋮ Polynomial rings over arbitrary fields in two or more variables are not pole assignable ⋮ Parametric stabilization is easy ⋮ The pole assignability property in polynomial rings over GCD-domains ⋮ On pole assignment problems in polynomial rings ⋮ On bézout domains, elementary divisor rings, and pole assignability

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Remarks on the pole-shifting problem over rings
• The arithmetic of elliptic curves

This page was built for publication: On pole assignability over polynomial rings