An algorithm for coprime matrix fraction description using Sylvester matrices

被引:12
作者
Basilio, JC
Kouvaritakis, B
机构
[1] Oxford University, Department of Engineering Science, Oxford OX1 3PJ, Parks Road
关键词
D O I
10.1016/S0024-3795(96)00636-2
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
Several algorithms for the computation of coprime matrix fraction descriptions have been proposed in the past. Here we explore some of the properties of Sylvester matrices and develop a different approach to the problem which is based on singular value decompositions and therefore avoids problems of numerical ill-conditioning. (C) 1997 Elsevier Science Inc.
引用
收藏
页码:107 / 125
页数:19
相关论文
共 13 条
[1]  
ANDERSON BDO, 1976, IEEE T AUTOMAT CONTR, V212, P551
[2]   COPRIME MATRIX-FRACTION DESCRIPTION VIA ORTHOGONAL STRUCTURE THEOREM [J].
DATTA, KB ;
GANGOPADHYAY, S .
IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 1992, 37 (10) :1517-1520
[3]  
DATTA KB, 1993, CONTR-THEOR ADV TECH, V4, P971
[4]  
FORNEY GD, 1975, SIAM J CONTROL, V13, P493, DOI 10.1137/0313029
[5]  
Kailath T., 1980, Linear systems
[6]  
KOUVARITAKIS B, P IEEE D, V140, P364
[7]  
Kuera V., 1979, DISCRETE LINEAR CONT
[8]   FAST PROJECTION METHODS FOR MINIMAL DESIGN-PROBLEMS IN LINEAR-SYSTEM THEORY [J].
KUNG, S ;
KAILATH, T .
AUTOMATICA, 1980, 16 (04) :399-403
[10]  
Rosenbrock H.H., 1970, State-space and multivariable theory