Explicit block-structures for block-symmetric Fiedler-like pencils

MaRDI QIDQ4615397zbMATH OpenFDO

Authors Madeline Martin, Alexander Song, Irina Viviano, M. I. Bueno, Javier Pérez

Publication date 28 January 2019

Full work available at URL https://arxiv.org/abs/1711.06300

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

matrix polynomialstrong linearizationFiedler pencilblock minimal bases pencilsymmetric strong linearizationblock Kronecker pencilblock-symmetric generalized Fiedler pencilblock-symmetric generalized Fiedler pencil with repetitionextended block Kronecker pencil

Mathematics Subject Classification ID

Eigenvalues, singular values, and eigenvectors (15A18) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Matrix pencils (15A22) Matrices over function rings in one or more variables (15A54)

Abstract: In the last decade, there has been a continued effort to produce families of strong linearizations of a matrix polynomial $P(lambda)$, regular and singular, with good properties. As a consequence of this research, families such as the family of Fiedler pencils, the family of generalized Fiedler pencils (GFP), the family of Fiedler pencils with repetition, and the family of generalized Fiedler pencils with repetition (GFPR) were constructed. In particular, one of the goals was to find in these families structured linearizations of structured matrix polynomials. For example, if a matrix polynomial $P(lambda)$ is symmetric (Hermitian), it is convenient to use linearizations of $P(lambda)$ that are also symmetric (Hermitian). Both the family of GFP and the family of GFPR contain block-symmetric linearizations of $P(lambda)$, which are symmetric (Hermitian) when $P(lambda)$ is. Now the objective is to determine which of those structured linearizations have the best numerical properties. The main obstacle for this study is the fact that these pencils are defined implicitly as products of so-called elementary matrices. In this paper we consider the family of block-minimal bases pencils, whose pencils are defined in terms of their block-structure, as a source of canonical forms for block-symmetric pencils. More precisely, we present four families of block-symmetric pencils which, under some generic nonsingularity conditions are block minimal bases pencils and strong linearizations of a matrix polynomial. We show that the block-symmetric GFP and GFPR, after some row and column permutations, belong to the union of these four families. Hence, these four families of pencils provide an alternative but explicit approach to the block-symmetric Fiedler-like pencils existing in the literature.

Recommendations

• Structured strong linearizations from Fiedler pencils with repetition. I.
• Large vector spaces of block-symmetric strong linearizations of matrix polynomials
• Structured strong linearizations from Fiedler pencils with repetition. II
• Constructing symmetric structure-preserving strong linearizations
• A simplified approach to Fiedler-like pencils via block minimal bases pencils

Cites work

• scientific article; zbMATH DE number 1235881 (Why is no real title available?)
• A block-symmetric linearization of odd degree matrix polynomials with optimal eigenvalue condition number and backward error
• A framework for structured linearizations of matrix polynomials in various bases
• A new family of companion forms of polynomial matrices
• A permuted factors approach for the linearization of polynomial matrices
• A simplified approach to Fiedler-like pencils via block minimal bases pencils
• An Algorithm for Generalized Matrix Eigenvalue Problems
• Backward error and condition of polynomial eigenvalue problems
• Block Kronecker ansatz spaces for matrix polynomials
• Block Kronecker linearizations of matrix polynomials and their backward errors
• Block minimal bases \(\ell\)-ifications of matrix polynomials
• Fiedler companion linearizations and the recovery of minimal indices
• Fiedler companion linearizations for rectangular matrix polynomials
• Large vector spaces of block-symmetric strong linearizations of matrix polynomials
• Linearizations of Hermitian matrix polynomials preserving the sign characteristic
• Linearizations of singular matrix polynomials and the recovery of minimal indices
• Minimal Bases of Rational Vector Spaces, with Applications to Multivariable Linear Systems
• Palindromic companion forms for matrix polynomials of odd degree
• Palindromic linearizations of a matrix polynomial of odd degreee obtained from Fiedler pencils with repetition
• Spectral equivalence of matrix polynomials and the index sum theorem
• Structured Polynomial Eigenvalue Problems: Good Vibrations from Good Linearizations
• Structured strong linearizations from Fiedler pencils with repetition. I.
• Structured strong linearizations from Fiedler pencils with repetition. II
• Symmetric Linearizations for Matrix Polynomials
• The Conditioning of Linearizations of Matrix Polynomials
• The computation of Kronecker's canonical form of a singular pencil
• The eigenstructure of an arbitrary polynomial matrix: Computational aspects
• Vector Spaces of Linearizations for Matrix Polynomials

Cited in

(10)

• On the descriptor variable observation of rectangular implicit representations, in the presence of column minimal indices blocks
• Structured strong linearizations from Fiedler pencils with repetition. I.
• Palindromic linearizations of palindromic matrix polynomials of odd degree obtained from Fiedler-like pencils
• A block-symmetric linearization of odd degree matrix polynomials with optimal eigenvalue condition number and backward error
• A simplified approach to Fiedler-like pencils via block minimal bases pencils
• On why using \(\mathbb{DL}(P)\) for the symmetric polynomial eigenvalue problem might need to be reconsidered
• Constructing symmetric structure-preserving strong linearizations
• Structured strong $\boldsymbol{\ell}$-ifications for structured matrix polynomials in the monomial basis
• Structured strong linearizations from Fiedler pencils with repetition. II
• Automatic recovery of eigenvectors and minimal bases of matrix polynomials from generalized Fiedler pencils with repetition

This page was built for publication: Explicit block-structures for block-symmetric Fiedler-like pencils

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4615397)