The Partial Quadratic Eigenvalue Assignment Problem (PQEVAP) concerns the reassignment of a small number of undesirable eigenvalues of a quadratic matrix pencil, while leaving the remaining large number of eigenvalues and the corresponding eigenvectors unchanged. The problem arises in controlling undesirable resonance in vibrating structures and in stabilizing control systems. The solution of t...

A methodology to improve the stability robustness of feedback control systems designed using direct eigenspace assignment techniques is presented. The method consists of considering the sensitivity of the minimum singular value of the return difference transfer matrix at the plant input to small changes in the desired closed-loop eigenvalues and the specified elements of the desired closed-loop...

in this paper, a fundamentally new method, based on the de nition, is introduced for numerical computation of eigenvalues, generalized eigenvalues and quadratic eigenvalues of matrices. some examples are provided to show the accuracy and reliability of the proposed method. it is shown that the proposed method gives other sequences than that of existing methods but they still are convergent to t...

Topology control and channel assignment are key steps in the design of Wireless Mesh Networks (WMNs). Topology control consists of selecting a subset of communication links to set up the routing network, subject to certain degree constraints. Assigning non-overlapping frequency channels to the selected links in order to minimize the interference during communication is called the channel assign...

General quadratic matrix minimization problems, with orthogonal constraints, arise in continuous relaxations for the (discrete) quadratic assignment problem (QAP). Currently, bounds for QAP are obtained by treating the quadratic and linear parts of the objective function, of the relaxations, separately. This paper handles general objectives as one function. The objectives can be both nonhomogen...

This work studies the problem of design of discrete-time nonlinear observers in the presence of exogenous disturbances. In particular, the present work proposes a systematic design method for discrete-time nonlinear state and disturbance observers in modular form, consisting of an observer for the disturbance-free part of the system, along with a disturbance observer and a stateestimate correct...

Min-max systems are timed discrete event dynamic systems containing min, max and plus operations. A min-max system is balanced if it admits a global cycle time (generalized eigenvalue) for every possible assignment of parameters. This paper proves that the testing of the balance property for min-max systems is co-NP hard by showing that the test of inseparability is co-NP hard. The latter resul...

For a given set of background interference signals, it is well known that the optimal sequence can be obtained by solving an eigenvalue problem. However, one usual practical constraint on the sequences in that the sequence elements should have a constant amplitude. We show that when the choice is limited to binary sequences, the sequence assignment problem is NP-hard. We propose a Local Search ...

Linear state constraints define a polyhedron in the state space of a dynamical system. If this polyhedron can be made positively invariant by state feedback, the constraints are satisfied all along the trajectory for any initial point in this polyhedron. In this paper, some algebraic invariance relations are established for continuous-time linear systems. The existence of a solution to the corr...