Constructing Strong Linearizations of Matrix Polynomials Expressed in Chebyshev Bases
From MaRDI portal
Publication:5348225
DOI10.1137/16M105839XzbMath1371.65034OpenAlexW2395882587MaRDI QIDQ5348225
Piers W. Lawrence, Javier J. Pérez
Publication date: 14 August 2017
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/16m105839x
Chebyshev polynomialsminimal indicesmatrix polynomialsminimal basespolynomial eigenvalue problemssingular matrix polynomialsstrong linearizationseigenvector recoverystructure-preserving linearizationsChebyshev pencilsone-sided factorizations
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Matrices over function rings in one or more variables (15A54) Matrix pencils (15A22)
Related Items
Block Kronecker linearizations of matrix polynomials and their backward errors, Block minimal bases \(\ell\)-ifications of matrix polynomials, Strong Linearizations of Rational Matrices, Structured strong $\boldsymbol{\ell}$-ifications for structured matrix polynomials in the monomial basis, A Framework for Structured Linearizations of Matrix Polynomials in Various Bases, Unnamed Item, Structured backward error analysis of linearized structured polynomial eigenvalue problems, A simplified approach to Fiedler-like pencils via block minimal bases pencils, Robustness and perturbations of minimal bases. II: The case with given row degrees, Compact Two-Sided Krylov Methods for Nonlinear Eigenvalue Problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Linearizations of matrix polynomials in Bernstein bases
- On the sign characteristics of Hermitian matrix polynomials
- Spectral equivalence of matrix polynomials and the index sum theorem
- Palindromic companion forms for matrix polynomials of odd degree
- Chebyshev interpolation for nonlinear eigenvalue problems
- An algorithm for the symmetric generalized eigenvalue problem
- Block Kronecker linearizations of matrix polynomials and their backward errors
- Linearizations of matrix polynomials in Newton bases
- Leverrier's algorithm for orthogonal polynomial bases
- Large vector spaces of block-symmetric strong linearizations of matrix polynomials
- Backward Error Analysis of Polynomial Eigenvalue Problems Solved by Linearization
- Backward stability of polynomial root-finding using Fiedler companion matrices
- On the stability of computing polynomial roots via confederate linearizations
- Fiedler-comrade and Fiedler--Chebyshev pencils
- Polynomial Eigenvalue Problems: Theory, Computation, and Structure
- Vector Spaces of Linearizations for Matrix Polynomials: A Bivariate Polynomial Approach
- Chebyshev rootfinding via computing eigenvalues of colleague matrices: when is it stable?
- Fiedler Companion Linearizations and the Recovery of Minimal Indices
- Minimal Bases of Rational Vector Spaces, with Applications to Multivariable Linear Systems
- THE COLLEAGUE MATRIX, A CHEBYSHEV ANALOGUE OF THE COMPANION MATRIX
- Linearization of regular matrix polynomials
- Backward Error of Polynomial Eigenproblems Solved by Linearization
- Linearization of matrix polynomials expressed in polynomial bases
- A Pencil Approach for Embedding a Polynomial Matrix into a Unimodular matrix
- Tridiagonal-Diagonal Reduction of Symmetric Indefinite Pairs
- Nonlinear eigenvalue problems: a challenge for modern eigenvalue methods
- The Ehrlich--Aberth Method for the Nonsymmetric Tridiagonal Eigenvalue Problem
- Linearizations of Hermitian Matrix Polynomials Preserving the Sign Characteristic
- Vector Spaces of Linearizations for Matrix Polynomials
- The Conditioning of Linearizations of Matrix Polynomials
- Structured Polynomial Eigenvalue Problems: Good Vibrations from Good Linearizations
