SYNov 25, 2018
Descriptor System Tools (DSTOOLS) User's GuideAndreas Varga
The Descriptor System Tools (DSTOOLS) is a collection of MATLAB functions for the operation on and manipulation of rational transfer function matrices via their descriptor system realizations. The DSTOOLS collection relies on the Control System Toolbox and several mex-functions based on the Systems and Control Library SLICOT. Many of the implemented functions are based on the computational procedures described in Chapter 10 of the book: "A. Varga, Solving Fault Diagnosis Problems - Linear Synthesis Techniques, Springer, 2017". This document is the User's Guide for the version V0.71 of DSTOOLS. First, we present the mathematical background on rational matrices and descriptor systems. Then, we give in-depth information on the command syntax of the main computational functions. Several examples illustrate the use of the main functions of DSTOOLS.
SYFeb 8, 2020
On recursive computation of coprime factorizations of rational matricesAndreas Varga
General computational methods based on descriptor state-space realizations are proposed to compute coprime factorizations of rational matrices with minimum degree denominators. The new methods rely on recursive pole dislocation techniques, which allow to successively place all poles of the factors into a "good" region of the complex plane. The resulting McMillan degree of the denominator factor is equal to the number of poles lying in the complementary "bad" region and therefore is minimal. The developed pole dislocation techniques are instrumental for devising numerically reliable procedures for the computation of coprime factorizations with proper and stable factors of arbitrary improper rational matrices and coprime factorizations with inner denominators. Implementation aspects of the proposed algorithms are discussed and illustrative examples are given.
SYNov 20, 2018
Fault Detection and Isolation Tools (FDITOOLS) User's GuideAndreas Varga
The Fault Detection and Isolation Tools (FDITOOLS) is a collection of MATLAB functions for the analysis and solution of fault detection and model detection problems. The implemented functions are based on the computational procedures described in the Chapters 5, 6 and 7 of the book: "A. Varga, Solving Fault Diagnosis Problems - Linear Synthesis Techniques, Springer, 2017". This document is the User's Guide for the version V1.0 of FDITOOLS. First, we present the mathematical background for solving several basic exact and approximate synthesis problems of fault detection filters and model detection filters. Then, we give in-depth information on the command syntax of the main analysis and synthesis functions. Several examples illustrate the use of the main functions of FDITOOLS.
SYFeb 1, 2022
Fault detection and diagnosis: computational issues and toolsAndreas Varga
A representative set of fault diagnosis problems is formulated for linear time-invariant systems with additive faults. For all formulated problems, general existence conditions of their solutions are given. An overview of recent developments of computational methods for the synthesis of fault detection filters is presented and available software tools are described.
SYDec 29, 2018
On Checking Null Rank Conditions of Rational MatricesAndreas Varga
In this paper we discuss possible numerical approaches to reliably check the rank condition rank $G(λ) = 0$ for a given rational matrix $G(λ)$ in terms of its descriptor system realization. For test purposes we employ functions available in the Control System Toolbox of MATLAB and the Descriptor System Tools (DSTOOLS) collection.
SYJul 4, 2017
A note on computing range space bases of rational matricesAndreas Varga
We discuss computational procedures based on descriptor state-space realizations to compute proper range space bases of rational matrices. The main computation is the orthogonal reduction of the system matrix pencil to a special Kronecker-like form, which allows to extract a full column rank factor, whose columns form a proper rational basis of the range space. The computation of several types of bases can be easily accommodated, such as minimum-degree bases, stable inner minimum-degree bases, etc. Several straightforward applications of the range space basis computation are discussed, such as, the computation of full rank factorizations, normalized coprime factorizations, pseudo-inverses, and inner-outer factorizations.