Transfer function computation for generalized n-dimensional systems
โ Scribed by George E. Antoniou
- Publisher
- Elsevier Science
- Year
- 2001
- Tongue
- English
- Weight
- 110 KB
- Volume
- 338
- Category
- Article
- ISSN
- 0016-0032
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
An algorithm is developed for the computation of the transfer function matrix of a two-dimensional system, which is given in its state-space form, without inverting a polynomial matrix. A new transformation has been considered so that the well known Fadeeva's algorithm for regular systems can be use
This paper is concerned with the computation of transfer function matrices of linear multivariable systems described by their state-space equations. The algorithm proposed here performs orthogonal similarity transformations to find the minimal order subsystem corresponding to each input-output pair
For singular systems, i.e. for systems of the form Ek = Ax + Bu, with E singular, the problem of computing the transfer function matrix has been studied. An algorithm is developed which is similar to the corresponding algorithm proposed by Faddeev or Leverrierfor regular Systems. The present results
problem of computing the transfer function matrices for regular and singular discrete two-dimensional general state-space models (2D GM) is discussed, and some programmable algorithms are developed that generalize the well-known Leverrier algorithm to 2D systems of general form. The results also sho