76 research outputs found
Recommended from our members
Solution of the determinantal assignment problem using the Grassmann matrices
The paper provides a direct solution to the determinantal assignment problem (DAP) which unifies all frequency assignment problems of the linear control theory. The current approach is based on the solvability of the exterior equation (Formula presented.) where (Formula presented.) is an n âdimensional vector space over (Formula presented.) which is an integral part of the solution of DAP. New criteria for existence of solution and their computation based on the properties of structured matrices are referred to as Grassmann matrices. The solvability of this exterior equation is referred to as decomposability of (Formula presented.), and it is in turn characterised by the set of quadratic PlĂŒcker relations (QPRs) describing the Grassmann variety of the corresponding projective space. Alternative new tests for decomposability of the multi-vector (Formula presented.) are given in terms of the rank properties of the Grassmann matrix, (Formula presented.) of the vector (Formula presented.), which is constructed by the coordinates of (Formula presented.). It is shown that the exterior equation is solvable ((Formula presented.) is decomposable), if and only if (Formula presented.) where (Formula presented.); the solution space for a decomposable (Formula presented.), is the space (Formula presented.). This provides an alternative linear algebra characterisation of the decomposability problem and of the Grassmann variety to that defined by the QPRs. Further properties of the Grassmann matrices are explored by defining the HodgeâGrassmann matrix as the dual of the Grassmann matrix. The connections of the HodgeâGrassmann matrix to the solution of exterior equations are examined, and an alternative new characterisation of decomposability is given in terms of the dimension of its image space. The framework based on the Grassmann matrices provides the means for the development of a new computational method for the solutions of the exact DAP (when such solutions exist), as well as computing approximate solutions, when exact solutions do not exist
Recommended from our members
A Grassmann Matrix Approach for the Computation of Degenerate Solutions for Output Feedback Laws
The paper is concerned with the improvement of the overall sensitivity properties of a method to design feedback laws for multivariable linear systems which can be applied to the whole family of determinantal type frequency assignment problems, expressed by a unified description, the so-called Determinantal Assignment Problem (DAP). By using the exterior algebra/algebraic geometry framework, DAP is reduced to a linear problem (zero assignment of polynomial combinants) and a standard problem of multilinear algebra (decomposability of multivectors) which is characterized by the set of Quadratic PlĂŒcker Relations (QPR) that define the Grassmann variety of P. This design method is based on the notion of degenerate compensator, which are the solutions that indicate the boundaries of the control design and they provide the means for linearising asymptotically the nonlinear nature of the problems and hence are used as the starting points to generate linearized feedback laws. A new algorithmic approach is introduced for the computation and the selection of degenerate solutions (decomposable vectors) which allows the computation of static and dynamic feedback laws with reduced sensitivity (and hence more robust solutions). This approach is based on alternative, linear algebra type criterion for decomposability of multivectors to that defined by the QPRs, in terms of the properties of structured matrices, referred to as Grassmann Matrices. The overall problem is transformed to a nonlinear maximization problem where the objective function is expressed via the Grassmann Matrices and the first order conditions for optimality are reduced to a nonlinear eigenvalue-eigenvector problem. Hence, an iterative method similar to the power method for finding the largest modulus eigenvalue and the corresponding eigenvector is proposed as a solution for the above problem
Recommended from our members
Structure assignment problems in linear systems: Algebraic and geometric methods
The Determinantal Assignment Problem (DAP) is a family of synthesis methods that has emerged as the abstract formulation of pole, zero assignment of linear systems. This unifies the study of frequency assignment problems of multivariable systems under constant, dynamic centralized, or decentralized control structure. The DAP approach is relying on exterior algebra and introduces new system invariants of rational vector spaces, the Grassmann vectors and PlĂŒcker matrices. The approach can handle both generic and non-generic cases, provides solvability conditions, enables the structuring of decentralisation schemes using structural indicators and leads to a novel computational framework based on the technique of Global Linearisation. DAP introduces a new approach for the computation of exact solutions, as well as approximate solutions, when exact solutions do not exist using new results for the solution of exterior equations. The paper provides a review of the tools, concepts and results of the DAP framework and a research agenda based on open problems
Recommended from our members
Parameterisation of degenerate solutions of the determinantal assignment problem
The paper is concerned with defining and parametrising the families of all degenerate compensators (feedback, squaring down etc) emerging in a variety of linear control problems. Such compensators indicate the boundaries of the control design, but they also provide the means for linearising the non-linear nature of the Determinantal Assignment Problems, which provide the unifying description for all frequency assignment problems (pole, zero) under static and dynamic compensation schemes. The conditions provide the means for the selection of appropriate degenerate solutions that allow frequency assignability in the corresponding frequencies
Recommended from our members
The approximate Determinantal Assignment Problem
The Determinantal Assignment Problem (DAP) has been introduced as the unifying description of all frequency assignment problems in linear systems and it is studied in a projective space setting. This is a multi-linear nature problem and its solution is equivalent to finding real intersections between a linear space, associated with the polynomials to be assigned, and the Grassmann variety of the projective space. This paper introduces a new relaxed version of the problem where the computation of the approximate solution, referred to as the approximate DAP, is reduced to a distance problem between a point in the projective space from the Grassmann variety Gm(Rn). The cases G2(Rn) and its Hodge-dual Gnâ2(Rn) are examined and a closed form solution to the distance problem is given based on the skew-symmetric matrix description of multivectors via the gap metric. A new algorithm for the calculation of the approximate solution is given and stability radius results are used to investigate the acceptability of the resulting perturbed solutions
Recommended from our members
Approximate solutions of the determinantal assignment problem and distance problems
The paper introduces the formulation of an exact algebrogeometric problem, the study of the Determinantal Assignment Problem (DAP) in the set up of design, where approximate solutions of the algebraic problem are sought. Integral part of the solution of the Approximate DAP is the computation of distance of a multivector from the Grassmann variety of a projective space. We examine the special case of the calculation of the minimum distance of a multivector in â§2(â5) from the Grassmann variety G 2(â5). This problem is closely related to the problem of decomposing the multivector and finding its best decomposable approximation. We establish the existence of the best decomposition in a closed form and link the problem of distance to the decomposition of multivectors. The uniqueness of this decomposition is then examined and several new alternative decompositions are presented that solve our minimization problem based on the structure of the problem
Recommended from our members
Approximate zero polynomials of polynomial matrices and linear systems
This paper introduces the notions of approximate and optimal approximate zero polynomial of a polynomial matrix by deploying recent results on the approximate GCD of a set of polynomials Karcaniaset al. (2006) 1 and the exterior algebra Karcanias and Giannakopoulos (1984) 4 representation of polynomial matrices. The results provide a new definition for the "approximate", or "almost" zeros of polynomial matrices and provide the means for computing the distance from non-coprimeness of a polynomial matrix. The computational framework is expressed as a distance problem in a projective space. The general framework defined for polynomial matrices provides a new characterization of approximate zeros and decoupling zeros Karcanias et al. (1983) 2 and Karcanias and Giannakopoulos (1984) 4 of linear systems and a process leading to computation of their optimal versions. The use of restriction pencils provides the means for defining the distance of state feedback (output injection) orbits from uncontrollable (unobservable) families of systems, as well as the invariant versions of the "approximate decoupling polynomials". The overall framework that is introduced provides the means for introducing measures for the distance of a system from different families of uncontrollable, or unobservable systems, which may be feedback dependent, or feedback invariant as well as the notion of "approximate decoupling polynomials"
Recommended from our members
Approximate Zero Polynomials of Polynomial Matrices and Linear Systems
The aim of this paper is to extend recent results on the approximate GCD of polynomials [1] and approximate zeros to the case of a polynomial matrices within the framework of exterior algebra [2]. The results provide the means to introduce a new characterization of approximate decoupling zeros and measures for approximate controllability and observability for the case of linear systems
Recommended from our members
Approximate zero polynomials of polynomial matrices and linear systems
This paper introduces the notions of approximate and optimal approximate zero polynomial of a polynomial matrix by deploying recent results on the approximate GCD of a set of polynomials [1] and the exterior algebra [4] representation of polynomial matrices. The results provide a new definition for the "approximate", or "almost" zeros of polynomial matrices and provide the means for computing the distance from non-coprimeness of a polynomial matrix. The computational framework is expressed as a distance problem in a projective space. The general framework defined for polynomial matrices provides a new characterization of approximate zeros and decoupling zeros [2], [4] of linear systems and a process leading to computation of their optimal versions. The use of restriction pencils provides the means for defining the distance of state feedback (output injection) orbits from uncontrollable (unobservable) families of systems, as well as the invariant versions of the "approximate decoupling polynomials"
Recommended from our members
A quasi-Newton optimal method for the global linearisation of the output feedback pole assignment
The paper deals with the problem of output feedback pole assignment by static and dynamic compensators using a powerful method referred to as global linearisation which has addressed both solvability conditions and computation of solutions. The method is based on the asymptotic linearisation of the pole assignment map around a degenerate point and is aiming to reduce the multilinear nature of the problem to the solution of a linear set of equations by using algebro-geometric notions and tools. This novel framework is used as the basis to develop numerical techniques which make the method less sensitive to the use of degenerate solutions. The proposed new computational scheme utilizes a quasi-Newton method modified accordingly so it can be used for optimization goals while achieving (exact or approximate) pole placement. In the present paper the optimisation goal is to maximise the angle between a solution and the degenerate compensator so that less sensitive solutions are achieved
- âŠ