AbstractThe concept of Hankel matrices of Markov parameters associated with two polynomials is generalized for matrices. The generalized Hankel matrices of Markov parameters are then used to develop methods for testing the relative primeness of two matrices A and B, for determining stability and inertia of a matrix, and for constructing a class of matrices C such that A + C has a desired spectrum. Neither the method of construction of the generalized Hankel matrices nor the methods developed using these matrices require explicit computation of the characteristic polynomial of A (or of B)
In this paper, we develop three essential ingredients of an algebraic structure theory of finite blo...
The Ho-Kalman algorithm creates a minimum realization of a system, when given a series of determinis...
The Ho-Kalman algorithm creates a minimum realization of a system, when given a series of determinis...
AbstractThe concept of Hankel matrices of Markov parameters associated with two polynomials is gener...
AbstractFinite Hankel matrices [si+j] are considered, for which si are the Markov parameters of a gi...
AbstractIt is shown that certain sequences of Hankel matrices of finite rank obtained from a given s...
AbstractWe introduce so-called generalized Loewner matrices. The definition is almost the same as An...
A generalized Hankel matrix (in pencil form) is introduced. Based upon this definition the dimension...
Polynomial matrix theory is very important to many automatic control related pro- blems. This thesis...
In this thesis, existing methods for symbolic computation of Hankel deteriminants and matrix general...
AbstractWe consider polynomial matrix representations of MIMO linear systems and their connection to...
Dynamic systems are considered whose outputs can be represented either by a deterministic series of ...
AbstractAfter introducing the notion of “dynamical interpretation functor” to provide a general meth...
AbstractTransformations of the form C are investigated that transform Toeplitz and Toeplitz-plus-Han...
This paper gives displacement structure algorithms for the factorization positive definite and indef...
In this paper, we develop three essential ingredients of an algebraic structure theory of finite blo...
The Ho-Kalman algorithm creates a minimum realization of a system, when given a series of determinis...
The Ho-Kalman algorithm creates a minimum realization of a system, when given a series of determinis...
AbstractThe concept of Hankel matrices of Markov parameters associated with two polynomials is gener...
AbstractFinite Hankel matrices [si+j] are considered, for which si are the Markov parameters of a gi...
AbstractIt is shown that certain sequences of Hankel matrices of finite rank obtained from a given s...
AbstractWe introduce so-called generalized Loewner matrices. The definition is almost the same as An...
A generalized Hankel matrix (in pencil form) is introduced. Based upon this definition the dimension...
Polynomial matrix theory is very important to many automatic control related pro- blems. This thesis...
In this thesis, existing methods for symbolic computation of Hankel deteriminants and matrix general...
AbstractWe consider polynomial matrix representations of MIMO linear systems and their connection to...
Dynamic systems are considered whose outputs can be represented either by a deterministic series of ...
AbstractAfter introducing the notion of “dynamical interpretation functor” to provide a general meth...
AbstractTransformations of the form C are investigated that transform Toeplitz and Toeplitz-plus-Han...
This paper gives displacement structure algorithms for the factorization positive definite and indef...
In this paper, we develop three essential ingredients of an algebraic structure theory of finite blo...
The Ho-Kalman algorithm creates a minimum realization of a system, when given a series of determinis...
The Ho-Kalman algorithm creates a minimum realization of a system, when given a series of determinis...