This paper deals with the computation of basis matrices of output-nulling and reachability subspaces for linear\ud time-invariant (LTI) descriptor systems, which have been found to appear in the solution of many control and estimation problems. In particular, one of the classic approaches for the computation of these subspaces, which exploits the calculation of the null-space of the Rosenbrock system matrix pencil and which has found important applications in non-interacting and fault-detection problems, is generalized for descriptor systems
The focus of this paper is the connection between two foundational areas of linear time-invariant (L...
Conditions for the existence of positive and asymptotically stable realizations for descriptor discr...
This paper is concerned with the parameterisation of basis matrices and the simultaneous computation...
This paper deals with the computation of basis matrices of output-nulling and reachability subspaces...
This paper deals with the computation of basis matrices of output-nulling and reachability subspaces...
In this paper, we investigate several theoretical and computational aspects of fundamental subspaces...
In this paper we offer a set of algorithms for the computation of the fundamental subspaces of linea...
In this paper, we employ the Rosenbrock system matrix pencil to find and parameterise regular friend...
In this paper, we investigate several theoretical and computational aspects of fundamental subspaces...
This paper provides a system theoretic investigation of the building blocks of the supremal output-n...
This paper provides a system theoretic investigation of the building blocks of the supremal output-n...
This paper is concerned with the problem of computing basis matrices for the fundamental output-null...
In this paper we employ the Rosenbrock system matrix pencil for the computation of output-nulling su...
We present a subspace algorithm for identifying state space models for descriptor systems, directly ...
summary:Contrary to state space systems, there are different notions of controllability for linear t...
The focus of this paper is the connection between two foundational areas of linear time-invariant (L...
Conditions for the existence of positive and asymptotically stable realizations for descriptor discr...
This paper is concerned with the parameterisation of basis matrices and the simultaneous computation...
This paper deals with the computation of basis matrices of output-nulling and reachability subspaces...
This paper deals with the computation of basis matrices of output-nulling and reachability subspaces...
In this paper, we investigate several theoretical and computational aspects of fundamental subspaces...
In this paper we offer a set of algorithms for the computation of the fundamental subspaces of linea...
In this paper, we employ the Rosenbrock system matrix pencil to find and parameterise regular friend...
In this paper, we investigate several theoretical and computational aspects of fundamental subspaces...
This paper provides a system theoretic investigation of the building blocks of the supremal output-n...
This paper provides a system theoretic investigation of the building blocks of the supremal output-n...
This paper is concerned with the problem of computing basis matrices for the fundamental output-null...
In this paper we employ the Rosenbrock system matrix pencil for the computation of output-nulling su...
We present a subspace algorithm for identifying state space models for descriptor systems, directly ...
summary:Contrary to state space systems, there are different notions of controllability for linear t...
The focus of this paper is the connection between two foundational areas of linear time-invariant (L...
Conditions for the existence of positive and asymptotically stable realizations for descriptor discr...
This paper is concerned with the parameterisation of basis matrices and the simultaneous computation...