论文信息 - Numerical computation of a coprime factorization of a transfer function matrix

Numerical computation of a coprime factorization of a transfer function matrix

Abstract A new algorithm is presented for computing a coprime factorization of a transfer function matrix. The method is based on reformulating the problem as a problem of constructing a minimal basis of the right nullspace of a matrix pencil λ B - A . Due to the special structure and rank properties of the pencil obtained after transforming λ B - A to generalized Schur form, the original problem can be easily solved in a numerically reliable way.

T. Beelen | G. Veltkamp | G. W. Veltkamp | Th. G. L. Beelen

[1] J. B. Pearson,et al. Synthesis of Linear Multivariable Regulators , 1980 .

[2] Thomas Kailath,et al. Linear Systems , 1980 .

[3] Jr. G. Forney,et al. Minimal Bases of Rational Vector Spaces, with Applications to Multivariable Linear Systems , 1975 .

[4] W. Wolovich. Linear multivariable systems , 1974 .

[5] P. Dooren. The Computation of Kronecker's Canonical Form of a Singular Pencil , 1979 .

[6] T. Kailath,et al. Properties of the system matrix of a generalized state-space system , 1978 .

[7] C. Desoer,et al. Design of multivariable feedback systems with stable plant , 1981 .

[8] Tgj Theo Beelen. New algorithms for computing the Kronecker structure of a pencil with applications to systems and control theory , 1987 .