A reachability test for systems over polynomial rings using Groebner bases

Onderzoeksoutput: Hoofdstuk in Boek/Rapport/CongresprocedureConferentiebijdrageAcademicpeer review

2 Citaten (Scopus)

Samenvatting

Conditions for the reachability of a system over a polynomial ring are well known in the literature. However, verification of these conditions is in general a difficult problem. In this paper, the reachability problem is expressed in terms of polynomial ideals, and Groebner Bases are used to carry out the test explicitly. Four different methods are proposed, and their effectiveness is compared. With one of these methods, it is also possible to obtain a right- or left-inverse of a general non-square polynomial matrix, often required in the design of feedback compensators.

Originele taal-2Engels
Titel1993 American Control Conference
Plaats van productiePiscataway
UitgeverijInstitute of Electrical and Electronics Engineers
Pagina's226-230
Aantal pagina's5
ISBN van geprinte versie0780308611
DOI's
StatusGepubliceerd - 1 dec 1993
Evenement1993 American Control Conference - San Francisco, CA, USA
Duur: 2 jun 19934 jun 1993

Congres

Congres1993 American Control Conference
StadSan Francisco, CA, USA
Periode2/06/934/06/93

Vingerafdruk

Duik in de onderzoeksthema's van 'A reachability test for systems over polynomial rings using Groebner bases'. Samen vormen ze een unieke vingerafdruk.

Citeer dit