Matrix polynomials with completely prescribed eigenstructure
From MaRDI portal
Recommendations
- Structured strong $\boldsymbol{\ell}$-ifications for structured matrix polynomials in the monomial basis
- Spectral equivalence of matrix polynomials and the index sum theorem
- scientific article; zbMATH DE number 16875
- Constructing strong \(\ell\)-ifications from dual minimal bases
- Matrix completion problems
Cites work
- A new family of companion forms of polynomial matrices
- An algorithm for the complete solution of quadratic eigenvalue problems
- Column reduction of polynomial matrices
- Fiedler companion linearizations and the recovery of minimal indices
- scientific article; zbMATH DE number 3138903 (Why is no real title available?)
- scientific article; zbMATH DE number 3818965 (Why is no real title available?)
- scientific article; zbMATH DE number 3950733 (Why is no real title available?)
- scientific article; zbMATH DE number 3711820 (Why is no real title available?)
- scientific article; zbMATH DE number 3716709 (Why is no real title available?)
- scientific article; zbMATH DE number 3390604 (Why is no real title available?)
- scientific article; zbMATH DE number 3401090 (Why is no real title available?)
- Imbedding conditions for \(\lambda\)-matrices
- Linearizations of singular matrix polynomials and the recovery of minimal indices
- Local realizations and local polynomial matrix representations of systems
- Matrix Analysis
- Minimal Bases of Rational Vector Spaces, with Applications to Multivariable Linear Systems
- Möbius transformations of matrix polynomials
- On a quadratic inverse eigenvalue problem
- On the inverse symmetric quadratic eigenvalue problem
- Perturbation, extraction and refinement of invariant pairs for matrix polynomials
- Properties of the system matrix of a generalized state-space system†
- Quadratic realizability of palindromic matrix polynomials
- Sharp lower bounds for the dimension of linearizations of matrix polynomials
- SOAR: A Second-order Arnoldi Method for the Solution of the Quadratic Eigenvalue Problem
- Solving polynomial eigenvalue problems by means of the Ehrlich-Aberth method
- Spectral equivalence of matrix polynomials and the index sum theorem
- Stratification of full rank polynomial matrices
- The behavior of the complete eigenstructure of a polynomial matrix under a generic rational transformation
- The eigenstructure of an arbitrary polynomial matrix: Computational aspects
- The Quadratic Arnoldi Method for the Solution of the Quadratic Eigenvalue Problem
- The quadratic eigenvalue problem
- Triangularizing matrix polynomials
- Triangularizing quadratic matrix polynomials
- Vector Spaces of Linearizations for Matrix Polynomials
Cited in
(37)- Block Kronecker linearizations of matrix polynomials and their backward errors
- Robustness and perturbations of minimal bases. II: The case with given row degrees
- Robustness and perturbations of minimal bases
- On minimal bases and indices of rational matrices and their linearizations
- Solution of the linearly structured partial polynomial inverse eigenvalue problem
- Geometry of matrix polynomial spaces
- Root polynomials and their role in the theory of matrix polynomials
- Structure preserving stratification of skew-symmetric matrix polynomials
- Generic complete eigenstructures for sets of matrix polynomials with bounded rank and degree
- Quadratic realizability of palindromic matrix polynomials
- Generic symmetric matrix pencils with bounded rank
- Quasi-triangularization of matrix polynomials over arbitrary fields
- Fiedler-comrade and Fiedler-Chebyshev pencils
- Vectors with a prescribed minimal polynomial
- scientific article; zbMATH DE number 16875 (Why is no real title available?)
- Spectral equivalence of matrix polynomials and the index sum theorem
- On conditions guaranteeing two polynomial matrices possess identical zero structures
- Algebraic methods for the construction of algebraic-difference equations with desired behavior
- Structured backward error analysis of linearized structured polynomial eigenvalue problems
- Matrix polynomials with specified eigenvalues
- scientific article; zbMATH DE number 7351224 (Why is no real title available?)
- Structured strong $\boldsymbol{\ell}$-ifications for structured matrix polynomials in the monomial basis
- Generic symmetric matrix polynomials with bounded rank and fixed odd grade
- Conditioning and backward errors of eigenvalues of homogeneous matrix polynomials under Möbius transformations
- Non-backtracking alternating walks
- Van Dooren's index sum theorem and rational matrices with prescribed structural data
- Constructing strong \(\ell\)-ifications from dual minimal bases
- Row or Column Completion of Polynomial Matrices of Given Degree
- Quadratic realizability of palindromic matrix polynomials: the real case
- Inverse eigenvalue problem for affinely structured or sparse polynomial matrices with prescribed eigenvalues
- On the weak infinite zero structures and relative degrees for linear time-delay systems
- One dimensional perturbation problem for linear relations
- Minimal rank factorizations of polynomial matrices
- Row completion of polynomial and rational matrices
- Row or column completion of polynomial matrices of given degree. II
- Inverse problems of polynomial and rational matrices involving the eigenstructure and data of the column and row spaces
- Polynomial zigzag matrices, dual minimal bases, and the realization of completely singular polynomials
This page was built for publication: Matrix polynomials with completely prescribed eigenstructure
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5251738)
