In this thesis we have studied several aspects of the minimal realization problem for descriptor systems. These aspects include purely theoretical questions such as that about the order of a minimal realization of a general improper rational matrix and problems of a numerical nature, like rounding error analysis of the computing a minimal realization from a nonminimal one. We have also treated the minimal partial realization problem for general descriptor systems with application to model reduction and to generalised eigenvalue problems
AbstractWe develop a theory of minimal realizations of a finite sequence over an integral domain R, ...
AbstractWe develop a theory of minimal realizations of a finite sequence over an integral domain R, ...
International audienceThe nonlinear realization theory is recasted for time-varying single-input sin...
In this thesis we have studied several aspects of the minimal realization problem for descriptor sys...
In this paper a generalization of Kalman's partial realization theory is developed using partial rea...
Abstract: We propose computationally ecient and numerically reliable algorithms to compute minimal r...
AbstractIn this paper a generalization of Kalman's partial realization theory is developed using par...
In this paper we extend Kalman's concept of partial realization and define generalized partial ...
In this thesis we have studied several aspects of the minimal realization problem for descriptor sys...
In this paper we try to give some contributions, in order to solve the problem of system identificat...
In this paper we try to give some contributions, in order to solve the problem of system identificat...
In this paper we try to give some contributions, in order to solve the problem of system identificat...
In this paper we try to give some contributions, in order to solve the problem of system identificat...
In this paper, all solutions of a generalized minimal partial realization problem are parametrized i...
A basis-free descriptor system representation is shown to facilitate the computation of all minimum-...
AbstractWe develop a theory of minimal realizations of a finite sequence over an integral domain R, ...
AbstractWe develop a theory of minimal realizations of a finite sequence over an integral domain R, ...
International audienceThe nonlinear realization theory is recasted for time-varying single-input sin...
In this thesis we have studied several aspects of the minimal realization problem for descriptor sys...
In this paper a generalization of Kalman's partial realization theory is developed using partial rea...
Abstract: We propose computationally ecient and numerically reliable algorithms to compute minimal r...
AbstractIn this paper a generalization of Kalman's partial realization theory is developed using par...
In this paper we extend Kalman's concept of partial realization and define generalized partial ...
In this thesis we have studied several aspects of the minimal realization problem for descriptor sys...
In this paper we try to give some contributions, in order to solve the problem of system identificat...
In this paper we try to give some contributions, in order to solve the problem of system identificat...
In this paper we try to give some contributions, in order to solve the problem of system identificat...
In this paper we try to give some contributions, in order to solve the problem of system identificat...
In this paper, all solutions of a generalized minimal partial realization problem are parametrized i...
A basis-free descriptor system representation is shown to facilitate the computation of all minimum-...
AbstractWe develop a theory of minimal realizations of a finite sequence over an integral domain R, ...
AbstractWe develop a theory of minimal realizations of a finite sequence over an integral domain R, ...
International audienceThe nonlinear realization theory is recasted for time-varying single-input sin...