Abstract. The paper presents a state-of-the art overview of algorithms and software for analysis and modelling of linear descriptor systems. The presentation focuses on algorithms for which reliable software implementations are already available. Most of mentioned software tools belong to a small Fortran subrou-tines library, called DESCRIPT, developed by the author. This library contains robust implementation of numerically reliable algorithms covering the basic computational problems in analysis and modelling of descriptor systems. DESCRIPT is the first systematized collection of software tools dedicated to descriptor systems. The analysis and modelling facilities for descriptor systems available in the interactive package CASAM are based...
The analysis of industrial processes, modelled as descriptor systems, is often computationally hard ...
In this paper, we give a numerically reliable algorithm to compute the zeros of a periodic descripto...
The analysis of industrial processes, modelled as descriptor systems, is often computationally hard ...
This paper considers the problem of computing the state reachable points, from the origin, of a line...
In this paper, we investigate several theoretical and computational aspects of fundamental subspaces...
This book contains the proceedings of the 8th Workshop on Coupled Descriptor Systems held March 2013...
The computation of the controllability function for nonlinear descriptor systems is considered. Thre...
We present a subspace algorithm for identifying state space models for descriptor systems, directly ...
Implicit dynamic-algebraic equations, known in control theory as descriptor systems, arise naturally...
AbstractIn this paper, for a given descriptor system, we construct a feedback in order to obtain a n...
AbstractThis paper surveys numerical techniques for the regularization of descriptor (generalized st...
Abstract: We propose computationally ecient and numerically reliable algorithms to compute minimal r...
In this report we introduce a Matlab toolbox for the regularization of descriptor systems. We apply ...
This paper is concerned with the reinforcement learning methods for the discrete time descriptor sys...
A mixed optimal model approximation is presented to obtain reduced-order models for truly fast descr...
The analysis of industrial processes, modelled as descriptor systems, is often computationally hard ...
In this paper, we give a numerically reliable algorithm to compute the zeros of a periodic descripto...
The analysis of industrial processes, modelled as descriptor systems, is often computationally hard ...
This paper considers the problem of computing the state reachable points, from the origin, of a line...
In this paper, we investigate several theoretical and computational aspects of fundamental subspaces...
This book contains the proceedings of the 8th Workshop on Coupled Descriptor Systems held March 2013...
The computation of the controllability function for nonlinear descriptor systems is considered. Thre...
We present a subspace algorithm for identifying state space models for descriptor systems, directly ...
Implicit dynamic-algebraic equations, known in control theory as descriptor systems, arise naturally...
AbstractIn this paper, for a given descriptor system, we construct a feedback in order to obtain a n...
AbstractThis paper surveys numerical techniques for the regularization of descriptor (generalized st...
Abstract: We propose computationally ecient and numerically reliable algorithms to compute minimal r...
In this report we introduce a Matlab toolbox for the regularization of descriptor systems. We apply ...
This paper is concerned with the reinforcement learning methods for the discrete time descriptor sys...
A mixed optimal model approximation is presented to obtain reduced-order models for truly fast descr...
The analysis of industrial processes, modelled as descriptor systems, is often computationally hard ...
In this paper, we give a numerically reliable algorithm to compute the zeros of a periodic descripto...
The analysis of industrial processes, modelled as descriptor systems, is often computationally hard ...