A NEW METHOD FOR COMPUTING A COLUMN REDUCED POLYNOMIAL MATRIX

被引：12

作者：

BEELEN, TGJ

VANDENHURK, GJ

PRAAGMAN, C

机构：

[1] PHILIPS MAIN SUPPLY GRP GLASS,5600 MD EINDHOVEN,NETHERLANDS

[2] EINDHOVEN UNIV TECHNOL,DEPT MATH & COMP SCI,5600 MB EINDHOVEN,NETHERLANDS

来源：

SYSTEMS & CONTROL LETTERS | 1988年 / 10卷 / 04期

关键词：

COMPUTER PROGRAMMING - Algorithms;

D O I：

10.1016/0167-6911(88)90010-2

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

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.

引用

页码：217 / 224

页数：8

共 6 条

[1]

Beelen T., 1987, THESIS EINDHOVEN U T

[2] NUMERICAL COMPUTATION OF A COPRIME FACTORIZATION OF A TRANSFER-FUNCTION MATRIX [J].