structural codes vis-a-vis structural counts, like polynomials of a molecular graph, areimportant in computing graph-theoretical descriptors which are commonly known astopological indices. these indices are most important for characterizing carbon nanotubes(cnts). in this paper we have computed sadhana index (sd) for phenylenes and theirhexagonal squeezes using structural codes (counts). sadhan...

The problem of filter design for descriptor systems system has been intensively studied by a number of researchers for the past three decades; see Ref.[1]-[6]. This is due not only to theoretical interest but also to the relevance of this topic in control engineering applications. Descriptor systems or so called singularly perturbed systems are dynamical systems with multiple time-scales. Descr...

The problem of filter design for descriptor systems system has been intensively studied by a number of researchers for the past three decades; see Ref.[1]-[6]. This is due not only to theoretical interest but also to the relevance of this topic in control engineering applications. Descriptor systems or so called singularly perturbed systems are dynamical systems with multiple time-scales. Descr...

In this paper, we investigate several theoretical and computational aspects of fundamental subspaces for linear, time-invariant (LTI) descriptor systems, which appear in the solution of many control and estimation problems. Different types of reachability and controllability for descriptor systems are described and discussed. The Rosenbrock system matrix pencil is employed for the computation o...

Feature matching in omnidirectional vision systems is a challenging problem, mainly because complicated optical systems make the theoretical modelling of invariance and construction of invariant feature descriptors hard or even impossible. In this paper, we propose learning invariant descriptors using a training set of similar and dissimilar descriptor pairs. We use the similarity-preserving ha...

The structure uncertain non-linear descriptor systems have been considered. A controller feedback and open loop stabilization of non-linear perturbed descriptor system have been developed using Lyapunov function approach and finite time stability principle. The theoretical justifications with the necessary requirements and illustration have also been presented.

In this technical note, we discuss an algorithm for the computation of the L∞-norm of transfer functions related to descriptor systems. We show how one can achieve this goal by computing the eigenvalues of certain skew-Hamiltonian/Hamiltonian matrix pencils and analyze arising problems. We also formulate and prove a theoretical result which serves as a basis for testing a transfer function matr...

In this paper, we investigate interpolatory projection framework for model reduction of descriptor systems. With a simple numerical example, we first illustrate that employing subspace conditions from the standard state space settings to descriptor systems generically leads to unbounded H2 or H∞ errors due to the mismatch of the polynomial parts of the full and reducedorder transfer functions. ...

In this paper, we present a new approach to investigate the existence and design of reduced-order proper H∞ controllers that provide the same level of performance as that of full-order controllers. By examining some special features of the LMI-based solvability conditions for the H∞ control problem for descriptor systems, we obtain a refined bound on the order of H∞ controllers, which is indepe...

In this paper, we present a new approach to investigate the existence and design of reduced-order proper H∞ controllers that provide the same level of performance as that of full-order controllers. By revealing some special features of the LMI-based solvability conditions for the H∞ control problem for descriptor systems, we obtain a refined bound on the order of H∞ controllers, which is indepe...