Let $P(lambda)$ be an $n$-square complex matrix polynomial, and $1 leq k leq n$ be a positive integer. In this paper, some algebraic and geometrical properties of the $k$-numerical range of $P(lambda)$ are investigated. In particular, the relationship between the $k$-numerical range of $P(lambda)$ and the $k$-numerical range of its companion linearization is stated. Moreover, the $k$-numerical...

let $p(lambda)$ be an $n$-square complex matrix polynomial, and $1 leq k leq n$ be a positive integer. in this paper, some algebraic and geometrical properties of the $k$-numerical range of $p(lambda)$ are investigated. in particular, the relationship between the $k$-numerical range of $p(lambda)$ and the $k$-numerical range of its companion linearization is stated. moreover, the $k$-numerical ...

In this research work, a new method is proposed for linearizing class of nonlinear multivariable system; where the number inputs divides exactly states. The idea consists in representing original system into state-dependent coefficient form and applying block similarity transformations that allow getting linearized companion form. Because system’s eigenstructure can determine performance robust...

In this paper, the notions of pseudofield of values and joint pseudofield of values of matrix polynomials are introduced and some of their algebraic and geometrical properties are studied.  Moreover, the relationship between the pseudofield of values of a matrix polynomial and the pseudofield of values of its companion linearization is stated, and then some properties of the augmented field of ...

The standard way of solving the polynomial eigenvalue problem of degree m in n×n matrices is to “linearize” to a pencil in mn×mn matrices and solve the generalized eigenvalue problem. For a given polynomial, P , infinitely many linearizations exist and they can have widely varying eigenvalue condition numbers. We investigate the conditioning of linearizations from a vector space DL(P ) of penci...

A standard way to solve polynomial eigenvalue problems P (λ)x = 0 is to convert the matrix polynomial P (λ) into a matrix pencil that preserves its elementary divisors and, therefore, its eigenvalues. This process is known as linearization and is not unique, since there are infinitely many linearizations with widely varying properties associated with P (λ). This freedom has motivated the recent...

In this note, we investigate the relationship between the finite and infinite frequency structure of a regular polynomial matrix and that of a particular linearization, called the generalised companion matrix. A special resolvent decomposition of the regular polynomial matrix is proposed which is based on the Weierstrass canonical form of this generalised companion matrix and the solution of a ...

In this note, we investigate the relationship between the finite and infinite frequency structure of a regular polynomial matrix and that of a particular linearization, called the generalised companion matrix. A special resolvent decomposition of the regular polynomial matrix is proposed which is based on the Weierstrass canonical form of this generalised companion matrix and the solution of a ...

We show that any regular quadratic matrix polynomial can be reduced to an upper triangular quadratic matrix polynomial over the complex numbers preserving the finite and infinite elementary divisors. We characterize the real quadratic matrix polynomials that are triangularizable over the real numbers and show that those that are not triangularizable are quasi-triangularizable with diagonal bloc...

A standard way of dealing with a matrix polynomial P (λ) is to convert it into an equivalent matrix pencil – a process known as linearization. For any regular matrix polynomial, a new family of linearizations generalizing the classical first and second Frobenius companion forms has recently been introduced by Antoniou and Vologiannidis, extending some linearizations previously defined by Fiedle...