Normalized Coprime Factorizations for Systems in Generalized State-Space Form

نویسنده

  • Peter M. M. Bongers
چکیده

This note presents a state-space algorithm for the calculation of a normalized coprime factorization of continuous-time generalized dynamical systems. It will be shown that two Riccati equations have to be solved to obtain this normalized coprime factorization.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Computation of Normalized Coprime Factorizations of Rational Matrices

We propose a new computational approach based on descriptor state space algorithms for computing normalized coprime factorizations of arbitrary rational matrices. The proposed approach applies to both continuousand discrete-time rational transfer-function matrices and shows that each rational matrix possesses a normalized coprime factorization with proper factors. The new method is conceptually...

متن کامل

On computing normalized coprime factorizations of periodic systems

A numerically reliable state space algorithm is proposed for computing normalized coprime factorizations of periodic descriptor systems. A preprocessing step is used in the algorithm to convert the initial problem for possibly non-causal systems into a simpler problem for causal periodic systems. The main computational ingredient here is the computation of a coprime factorization with causal fa...

متن کامل

Generalized Schur Methods to Compute Coprime Factorizations of Rational Matrices

Numerically reliable state space algorithms are proposed for computing the following stable coprime factorizations of rational matrices factorizations with least order denominators factorizations with inner denominators and factorizations with proper stable factors The new algorithms are based on a recursive generalized Schur algorithm for pole assignment They are generally applicable regardles...

متن کامل

A note on computing range space bases of rational matrices

We discuss computational procedures based on descriptor state-space realizations to compute proper range space bases of rational matrices. The main computation is the orthogonal reduction of the system matrix pencil to a special Kronecker-like form, which allows to extract a full column rank factor, whose columns form a proper rational basis of the range space. The computation of several types ...

متن کامل

Computation of Coprime Factorizations of Rational Matrices

We propose a numerically reliable state space algorithm for computing coprime factorizations of rational matrices with factors having poles in a given stability domain. The new algorithm is based on a recursive generalized Schur technique for poles dislocation by means of proportional-derivative state feedback. The proposed algorithm is generally applicable regardless the underlying descriptor ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004