Finsler's Lemma for matrix polynomials

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the S-Lemma for Univariate Polynomials

The so-called S-lemma has played an important role in optimization, both in theory and in applications. The significance of S-lemma is especially pronounced in control theory, robust optimization, and non-convex quadratic optimization. Hitherto, S-lemma is however established only in the domain of quadratic functions. In this paper we shall extend the notion of S-lemma to the class of univariat...

متن کامل

Fast methods for resumming matrix polynomials and Chebyshev matrix polynomials

Fast and effective algorithms are discussed for resumming matrix polynomials and Chebyshev matrix polynomials. These algorithms lead to a significant speed-up in computer time by reducing the number of matrix multiplications required to roughly twice the square root of the degree of the polynomial. A few numerical tests are presented, showing that evaluation of matrix functions via polynomial e...

متن کامل

Higher numerical ranges of matrix polynomials

 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...

متن کامل

Generalized numerical ranges of matrix polynomials

In this paper, we introduce the notions of C-numerical range and C-spectrum of matrix polynomials. Some algebraic and geometrical properties are investigated. We also study the relationship between the C-numerical range of a matrix polynomial and the joint C-numerical range of its coefficients.

متن کامل

The Bailey Lemma and Kostka Polynomials

Using the theory of Kostka polynomials, we prove an An−1 version of Bailey’s lemma at integral level. Exploiting a new, conjectural expansion for Kostka numbers, this is then generalized to fractional levels, leading to a new expression for admissible characters of A n−1 and to identities for A-type branching functions.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Linear Algebra and its Applications

سال: 2015

ISSN: 0024-3795

DOI: 10.1016/j.laa.2014.09.037