A new method for computing a column reduced polynomial matrix

T.G.J. Beelen; G.J.H.H. van den Hurk; C. Praagman

doi:10.1016/0167-6911(88)90010-2

A new method for computing a column reduced polynomial matrix

T.G.J. Beelen, G.J.H.H. van den Hurk, C. Praagman

Mathematics and Computer Science

Research output: Contribution to journal › Article › Academic › peer-review

18 Citations (Scopus)

Abstract

A new algorithm is presented for computing a column reduced form of a given full column rank polynomial matrix. The method is based on reformulating the problem as a problem of constructing a minimal polynomial basis for the right nullspace of a polynomial matrix closely related to the original one. The latter problem can easily be solved in a numerically reliable way. Three examples illustrating the method are included.

Original language	English
Pages (from-to)	217-224
Number of pages	8
Journal	Systems and Control Letters
Volume	10
Issue number	4
DOIs	https://doi.org/10.1016/0167-6911(88)90010-2
Publication status	Published - 1988

Access to Document

10.1016/0167-6911(88)90010-2

Cite this

@article{dfdd8d36adcb46b9b8a38460e3bafdb5,

title = "A new method for computing a column reduced polynomial matrix",

abstract = "A new algorithm is presented for computing a column reduced form of a given full column rank polynomial matrix. The method is based on reformulating the problem as a problem of constructing a minimal polynomial basis for the right nullspace of a polynomial matrix closely related to the original one. The latter problem can easily be solved in a numerically reliable way. Three examples illustrating the method are included.",

author = "T.G.J. Beelen and {van den Hurk}, G.J.H.H. and C. Praagman",

year = "1988",

doi = "10.1016/0167-6911(88)90010-2",

language = "English",

volume = "10",

pages = "217--224",

journal = "Systems and Control Letters",

issn = "0167-6911",

publisher = "Elsevier",

number = "4",

}

TY - JOUR

T1 - A new method for computing a column reduced polynomial matrix

AU - Beelen, T.G.J.

AU - van den Hurk, G.J.H.H.

AU - Praagman, C.

PY - 1988

Y1 - 1988

N2 - A new algorithm is presented for computing a column reduced form of a given full column rank polynomial matrix. The method is based on reformulating the problem as a problem of constructing a minimal polynomial basis for the right nullspace of a polynomial matrix closely related to the original one. The latter problem can easily be solved in a numerically reliable way. Three examples illustrating the method are included.

AB - A new algorithm is presented for computing a column reduced form of a given full column rank polynomial matrix. The method is based on reformulating the problem as a problem of constructing a minimal polynomial basis for the right nullspace of a polynomial matrix closely related to the original one. The latter problem can easily be solved in a numerically reliable way. Three examples illustrating the method are included.

U2 - 10.1016/0167-6911(88)90010-2

DO - 10.1016/0167-6911(88)90010-2

M3 - Article

SN - 0167-6911

VL - 10

SP - 217

EP - 224

JO - Systems and Control Letters

JF - Systems and Control Letters

IS - 4

ER -

A new method for computing a column reduced polynomial matrix

Abstract

Access to Document

Fingerprint

Cite this