The purpose of this paper is to present a brief overview of matrix stability and inertia theory.
A few applications of inertia and stability theorems, and a nonspectral implicit matrix …

In this paper we consider some matrix versions of classical interpolation problems (such as
the Nevanlinna-Pick, the Carathéodory or the Schur problems). We consider these …

We present the second part of our root-clustering investigation. Given A ε C n× n and A⊂ C,
we search for a criterion assuring the inclusion Σ (A)⊂ A. In this paper we study a criterion …

Given A ε ℂn+ n and ϰ⊂ ℂ, we search for a criterion assuring that the spectrum of A is
clustered in ϰ, σ (A)⊂ ϰ One approach to root clustering is the linear matrix equation, whose …

The problem of mixed H2/H∞ control with pole placement is considered for linear time‐
invariant systems. This is the problem of determining a controller for linear time‐invariant …

The authors construct a test for the roots of a polynomial to lie in a certain algebraic region.
This test uses only polynomial operations, is based on symmetric matrices, and involves n …

The problem of robust matrix root-clustering against additive structured uncertainty is
addressed. A bound on the size of the uncertainty domain preserving matrix D-stability is …

In classical design, a low-order compensator is applied to a given plant. In this paper, we
present an algebric construction of low (or fixed)-order compensators. Using the theory of …

For some applications we are interested in root clustering criteria with respect to the
intersection of regions. The left branch of a hyperbola, for instance, is the intersection of the …

The primary objective of this chapter is to advance the correlation between the theory of
stability and that of sensitivity. Undoubtedly system stability is of paramount concern in …