Imbedding conditions for -matrices
From MaRDI portal
Cites work
Cited in
(only showing first 100 items - show all)- Structured perturbation of the Brunovsky form: a particular case
- Matrix completion problems
- Minimax and interlacing theorems for matrices
- \(p\)-adic matrix valued inequalities
- Existence of matrices with prescribed entries
- Matrices with prescribed rows and invariant factors
- Matrices with prescribed eigenvalues and principal submatrices
- On the invariant factors on the matrix \(XAY+B^*\)
- A convexity lemma on the interlacing inequalities for invariant factors
- Interlacing inequalities and control theory
- Interlacing and majorization in invariant factor assignment problems
- Unified theorems on completions of matrix pencils
- High, low, and quantitative roads in linear algebra
- Interlacing inequalities. Matrix groups
- Similarity invariants of completions of submatrices
- Restricted invariant factor assignment under state-feedback
- Assigning the Kronecker invariants of a matrix pencil by row or column completions
- On the number of invariant polynomials of partially prescribed matrices
- Possible block similarity classes of a matrix with a prescribed nonprincipal submatrix. II
- The number of nonconstant invariant polynomials of matrices with several prescribed blocks
- \(k\)-fold anti-invariant subspaces of a linear mapping.
- Model reduction via truncation: An interpolation point of view.
- Inertia theorems for pairs of matrices.
- On the number of invariant factors of partially prescribed matrices and control theory
- Eigenvalues of matrices with several prescribed blocks
- Inverse matrix eigenvalue problems
- State feedback in linear control theory
- A completion problem over the field of real numbers
- On the change of the Jordan form under the transition from the adjacency matrix of a vertex-transitive digraph to its principal submatrix of co-order one
- The change of the Jordan structure under one row perturbations
- A polynomial approach to the invariant factors assignment problem via state feedback and output injection
- On the number of invariant factors of matrix products
- Matrices with prescribed submatrices and number of invariant polynomials
- Block similarity invariants of restrictions to \((A,B)\)-invariant subspaces
- Special rank-one perturbations
- Completely controllable pairs of matrices with prescribed positions
- Covering singular linear semi-groups
- Completion up to a matrix pencil with column minimal indices as the only nontrivial Kronecker invariants
- Ranks of submatrices and the off-diagonal indices of a square matrix
- Feedback invariants of series connected systems
- Solution of the linearly structured partial polynomial inverse eigenvalue problem
- Combinatorics of polynomial chains
- Matrices with prescribed eigenvalues and prescribed submatrices. II
- Some matrix completion problems
- Minimal completion problem for quasi-regular matrix pencils
- Quadratic realizability of palindromic matrix polynomials
- Triangularizing matrix polynomials
- Pencils with prescribed constant subpencils over arbitrary fields
- Matrix pencils completion problems
- Feedback invariants of matrices with prescribed rows
- Possible block similarity classes of a matrix with a prescribed nonprincipal submatrix
- On the embedding of state space realizations
- Quasi-triangularization of matrix polynomials over arbitrary fields
- Completion of quasi-regular matrix pencils
- On coprime rational function matrices
- scientific article; zbMATH DE number 7224104 (Why is no real title available?)
- Generalized minimax and interlacing theorems
- Matrices with prescribed eigenvalues and prescribed submatrices
- Matrices with prescribed invariant factors and off-diagonal submatrices
- Sums and products of matrices with prescribed similarity classes
- Interlacing and degree conditios for invariat polynomials
- Matrix realizations of littlewood—richardson sequences
- Column completion of a pair of matrices
- Matrices with prescribed invariant factors
- Eigenvalues of completions of submatrices
- Similarity class of a matrix with a prescribed submatrix
- Invariant factors and generalized Schur matrices
- The rank of the difference of matrices with prescribed similarity classes
- The rank of the difference of matrices with prescribed invariant factors
- scientific article; zbMATH DE number 3745403 (Why is no real title available?)
- Matrices with prescribed submatrices
- Controllability of pairs of matrices with prescribed entries
- Pencils with prescribed constant subpencils
- Invariant polynomials of matrices with prescibed entries
- On the eigenvalues of matrices with prescribed upper triangular part
- Realizations of interlacing by tree-patterned matrics
- The General Matrix Pencil Completion Problem: A Minimal Case
- On the eigenvalues of matrices with prescribed upper triangular part
- On the interlacing inequalities for invariant factors
- On the existence of unimodular matrices with a prescribed submatrix
- A new approach to square matrix completion problem
- GMPCP for one row and one column completion
- The change of feedback invariants under column perturbations: particular cases
- Matrix polynomials with completely prescribed eigenstructure
- On pole structure assignment in linear systems
- Some remarks on matrix pencil completion problems.
- Subrepresentations of Kronecker representations.
- Completion of matrix pencils with a single rank restriction
- Invariant factor assignment under state feedback and output injection
- Feedback invariants of a pair of matrices with prescribed columns
- Characteristic polynomials and controllability of partially prescribed matrices
- The number of invariant polynomials of a matrix with prescribed complementary submatrices
- Bounded rank perturbations of a regular matrix pencil
- Row or Column Completion of Polynomial Matrices of Given Degree
- Quadratic realizability of palindromic matrix polynomials: the real case
- Explicit solution of the Carlson problem
- Matrix pencils completions of size two
- Is the bounded rank perturbations problem for matrix pencils just a completion problem?
- Minimal rank perturbations of matrix pencils
- Solvability and uniqueness of solution of generalized -Sylvester equations with arbitrary coefficients
This page was built for publication: Imbedding conditions for \(\lambda\)-matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1252913)
