2015
DOI: 10.1016/j.laa.2015.03.032
|View full text |Cite
|
Sign up to set email alerts
|

Large vector spaces of block-symmetric strong linearizations of matrix polynomials

Abstract: Abstract. Given a matrix polynomial P (λ) = P k i=0 λ i A i of degree k, where A i are n × n matrices with entries in a field F, the development of linearizations of P (λ) that preserve whatever structure P (λ) might posses has been a very active area of research in the last decade. Most of the structure-preserving linearizations of P (λ) discovered so far are based on certain modifications of block-symmetric linearizations. The block-symmetric linearizations of P (λ) available in the literature fall essential… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
49
0

Year Published

2016
2016
2020
2020

Publication Types

Select...
5
2

Relationship

1
6

Authors

Journals

citations
Cited by 26 publications
(49 citation statements)
references
References 25 publications
0
49
0
Order By: Relevance
“…In [10], the family of GFPR associated with a matrix polynomial P ( ) of degree k as in (2.1) was introduced as an extension of the family of Fiedler pencils with repetition (FPR) presented in [32].…”
Section: Hermitian Generalized Fiedler Pencils With Repetitionmentioning
confidence: 99%
See 3 more Smart Citations
“…In [10], the family of GFPR associated with a matrix polynomial P ( ) of degree k as in (2.1) was introduced as an extension of the family of Fiedler pencils with repetition (FPR) presented in [32].…”
Section: Hermitian Generalized Fiedler Pencils With Repetitionmentioning
confidence: 99%
“…In addition, for practical purposes, it is essential that these linearizations are easily constructible from the coefficients of the polynomial. References [3,7,10,11,12,19,21,22,32] are a small sample of papers where new classes of linearizations have been presented.…”
mentioning
confidence: 99%
See 2 more Smart Citations
“…Since the structure of a matrix polynomial is reflected in its spectrum, numerical methods to solve polynomial eigenvalue problems should exploit to a maximal extent the structure of matrix polynomials [21]. For this reason, finding linearizations that retain whatever structure the matrix polynomial P (x) might possess is a fundamental problem in the theory of linearizations (see, for example, [4,5,8,21] and the references therein). The results in this work expand the arena in which to look for linearizations of matrix polynomials expressed in some orthogonal polynomial bases having additional useful properties.…”
mentioning
confidence: 99%