Structured backward error analysis of linearized structured polynomial eigenvalue problems
From MaRDI portal
Abstract: We introduce a new class of structured matrix polynomials, namely, the class of M_A-structured matrix polynomials, to provide a common framework for many classes of structured matrix polynomials that are important in applications: the classes of (skew-)symmetric, (anti-)palindromic, and alternating matrix polynomials. Then, we introduce the families of M_A-structured strong block minimal bases pencils and of M_A-structured block Kronecker pencils,, and show that any M_A-structured odd-degree matrix polynomial can be strongly linearized via an M_A-structured block Kronecker pencil. Finally, for the classes of (skew-)symmetric, (anti-)palindromic, and alternating odd-degree matrix polynomials, the M_A-structured framework allows us to perform a global and structured backward stability analysis of complete structured polynomial eigenproblems, regular or singular, solved by applying to an M_A-structured block Kronecker pencil a structurally backward stable algorithm that computes its complete eigenstructure, like the palindromic-QR algorithm or the structured versions of the staircase algorithm. This analysis allows us to identify those M_A-structured block Kronecker pencils that yield a computed complete eigenstructure which is the exact one of a slightly perturbed structured matrix polynomial.These pencils include (modulo permutations) the well-known block-tridiagonal and block-antitridiagonal structure-preserving linearizations. Our analysis incorporates structure to the recent (unstructured) backward error analysis performed for block Kronecker linearizations by Dopico, Lawrence, P'erez and Van Dooren, and share with it its key features, namely, it is a rigorous analysis valid for finite perturbations, i.e., it is not a first order analysis, it provides precise bounds, and it is valid simultaneously for a large class of structure-preserving strong linearizations.
Recommendations
- On backward errors of structured polynomial eigenproblems solved by structure preserving linearizations
- Backward errors for eigenvalues and eigenvectors of Hermitian, skew-Hermitian, H-even and H-odd matrix polynomials
- Block Kronecker linearizations of matrix polynomials and their backward errors
- Perturbation analysis for complex symmetric, skew symmetric, even and odd matrix polynomials
- Structured backward error analysis for sparse polynomial eigenvalue problems
Cites work
- scientific article; zbMATH DE number 3711820 (Why is no real title available?)
- scientific article; zbMATH DE number 3756646 (Why is no real title available?)
- scientific article; zbMATH DE number 1235882 (Why is no real title available?)
- scientific article; zbMATH DE number 635657 (Why is no real title available?)
- scientific article; zbMATH DE number 5049914 (Why is no real title available?)
- scientific article; zbMATH DE number 3236302 (Why is no real title available?)
- scientific article; zbMATH DE number 3390604 (Why is no real title available?)
- A framework for structured linearizations of matrix polynomials in various bases
- A real-coninvolutory analog of the polar decomposition
- A simplified approach to Fiedler-like pencils via block minimal bases pencils
- A structured staircase algorithm for skew-symmetric/symmetric pencils
- An Algorithm for Generalized Matrix Eigenvalue Problems
- An implicitly-restarted Krylov subspace method for real symmetric/skew-symmetric eigenproblems
- Block Kronecker linearizations of matrix polynomials and their backward errors
- Constructing strong linearizations of matrix polynomials expressed in Chebyshev bases
- Definite matrix polynomials and their linearization by definite pencils
- Dissipativity Enforcement via Perturbation of Para-Hermitian Pencils
- Fiedler companion linearizations and the recovery of minimal indices
- Fiedler-comrade and Fiedler-Chebyshev pencils
- Hermitian matrix polynomials with real eigenvalues of definite type. I: Classification
- Implicit QR algorithms for palindromic and even eigenvalue problems
- Inverse problems in vibrations.
- Jacobi-like Algorithms for the Indefinite Generalized Hermitian Eigenvalue Problem
- Jordan structures of alternating matrix polynomials
- Large vector spaces of block-symmetric strong linearizations of matrix polynomials
- Linearizations of Hermitian matrix polynomials preserving the sign characteristic
- Linearizations of polynomial matrices with symmetries and their applications
- Linearizations of singular matrix polynomials and the recovery of minimal indices
- Matrix polynomials with completely prescribed eigenstructure
- Minimal Bases of Rational Vector Spaces, with Applications to Multivariable Linear Systems
- Möbius transformations of matrix polynomials
- Nonlinear eigenvalue problems: a challenge for modern eigenvalue methods
- Numerical methods for palindromic eigenvalue problems: Computing the anti-triangular Schur form
- On backward errors of structured polynomial eigenproblems solved by structure preserving linearizations
- On the Sensitivity of the Eigenvalue Problem Ax = \lambda Bx
- Palindromic and even eigenvalue problems -- analysis and numerical methods.
- Palindromic companion forms for matrix polynomials of odd degree
- Palindromic linearizations of a matrix polynomial of odd degreee obtained from Fiedler pencils with repetition
- Palindromic quadratization and structure-preserving algorithm for palindromic matrix polynomials of even degree
- Perturbation analysis for complex symmetric, skew symmetric, even and odd matrix polynomials
- Polynomial zigzag matrices, dual minimal bases, and the realization of completely singular polynomials
- Skew-symmetric matrix polynomials and their Smith forms
- Smith forms of palindromic matrix polynomials
- Spectral equivalence of matrix polynomials and the index sum theorem
- Strongly stable gyroscopic systems
- Structure preserving stratification of skew-symmetric matrix polynomials
- Structure-preserving methods for computing eigenpairs of large sparse skew-Hamiltonian/Hamiltonian pencils
- Structured Polynomial Eigenvalue Problems: Good Vibrations from Good Linearizations
- Structured eigenvalue backward errors of matrix pencils and polynomials with Hermitian and related structures
- Structured eigenvalue backward errors of matrix pencils and polynomials with palindromic structures
- Structured eigenvalue condition number and backward error of a class of polynomial eigenvalue problems
- Structured eigenvalue methods for the computation of corner singularities in 3D anisotropic elastic structures
- Structured strong linearizations from Fiedler pencils with repetition. I.
- Structured strong linearizations from Fiedler pencils with repetition. II
- Symmetric Linearizations for Matrix Polynomials
- The Rayleigh-Ritz method for dissipative or gyroscopic systems
- The behavior of the complete eigenstructure of a polynomial matrix under a generic rational transformation
- The computation of Kronecker's canonical form of a singular pencil
- The eigenstructure of an arbitrary polynomial matrix: Computational aspects
- The palindromic generalized eigenvalue problem \(A^{*}x=\lambda Ax\): Numerical solution and applications
- The quadratic eigenvalue problem
- The ubiquitous Kronecker product
- Vector Spaces of Linearizations for Matrix Polynomials
- Vector spaces of linearizations for matrix polynomials: a bivariate polynomial approach
Cited in
(19)- Generic symmetric matrix polynomials with bounded rank and fixed odd grade
- Structured Polynomial Eigenvalue Problems: Good Vibrations from Good Linearizations
- Block Kronecker linearizations of matrix polynomials and their backward errors
- A block-symmetric linearization of odd degree matrix polynomials with optimal eigenvalue condition number and backward error
- Generic skew-symmetric matrix polynomials with fixed rank and fixed odd grade
- A simplified approach to Fiedler-like pencils via block minimal bases pencils
- Improving backward stability of Sakurai-Sugiura method with balancing technique in polynomial eigenvalue problem.
- Structured backward error for palindromic polynomial eigenvalue problems
- Structured strong $\boldsymbol{\ell}$-ifications for structured matrix polynomials in the monomial basis
- Backward error and conditioning of Fiedler companion linearizations
- Möbius transformations of matrix polynomials
- Strong linearizations of rational matrices with polynomial part expressed in an orthogonal basis
- Minimal degenerations of orbits of skew-symmetric matrix pencils
- Backward errors for eigenvalues and eigenvectors of Hermitian, skew-Hermitian, H-even and H-odd matrix polynomials
- Palindromic linearizations of palindromic matrix polynomials of odd degree obtained from Fiedler-like pencils
- Backward error bounds for polynomial eigenvalue problem solved by a Rayleigh-Ritz type contour integral-based eigensolver
- Structural backward stability in rational eigenvalue problems solved via block Kronecker linearizations
- Strongly minimal self-conjugate linearizations for polynomial and rational matrices
- Conditioning and backward errors of eigenvalues of homogeneous matrix polynomials under Möbius transformations
This page was built for publication: Structured backward error analysis of linearized structured polynomial eigenvalue problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4612565)
