𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A general algorithm for determining state-space representations

✍ Scribed by W.A. Wolovich; R. Guidorzi

Publisher
Elsevier Science
Year
1977
Tongue
English
Weight
361 KB
Volume
13
Category
Article
ISSN
0005-1098

No coin nor oath required. For personal study only.

✦ Synopsis

A new and direct procedure is presented for determining state-space representations of given, time-invariant systems whose dynamical behavior is expressed in a more general, differential operator form. The procedure employs some preliminary polynomial matrix operations, if necessary, in order to "reduce" the given system to an equivalent differential operator form which satisfies four specific conditions. An equivalent state space representation is then determined in a most direct manner; i.e. the algorithm presented requires only a single matrix inversion. An explicit relationship between the partial state and input of the given system and the state of the equivalent state-space system is also obtained.

πŸ“œ SIMILAR VOLUMES

The determination of state-space represe
The determination of state-space representations for linear multivariable systems
✍ W.A. Wolovich πŸ“‚ Article πŸ“… 1973 πŸ› Elsevier Science 🌐 English βš– 832 KB

A direct constructive method can be employed to obtain state-space or normal form representations for linear, time invariant systems whose dynamics are expressed in a more general matrix differential operator form. Summary--A new, relatively simple, constructive method is presented for obtaining st

State space representation for arbitrary
State space representation for arbitrary orthogonal rational functions
✍ Patrick Van gucht; Adhemar Bultheel πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 230 KB

We ΓΏrst give a brief summary of the arguments that lead to the conclusion that the use of orthogonal rational functions in system identiΓΏcation should not be restricted to the Takenaka-Malmquist basis because there are important cases where orthogonality with respect to a certain nonnegative weight

A Generalized Euclidean Algorithm for Co
A Generalized Euclidean Algorithm for Computing Triangular Representations of Algebraic Varieties
✍ Michael Kalkbrener πŸ“‚ Article πŸ“… 1993 πŸ› Elsevier Science 🌐 English βš– 628 KB

We present an algorithm that computes an unmixed-dimensional decomposition of an arbitrary algebraic variety \(V\). Each \(V_{i}\) in the decomposition \(V=V_{1} \cup \ldots \cup V_{m}\) is given by a finite set of polynomials which represents the generic points of the irreducible components of \(V_