Completion of quasi-regular matrix pencils

DOI10.1016/J.LAA.2016.03.020zbMATH Open1334.15068OpenAlexW2306362598MaRDI QIDQ273138FDOQ273138

Authors: Marija Dodig 

Publication date: 21 April 2016

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2016.03.020

Recommendations

• Minimal completion problem for quasi-regular matrix pencils
• Matrix pencils completion problems
• Matrix pencils completion problems. II
• On quasiregular spectrum of matrix pencils
• Unified theorems on completions of matrix pencils
• Completion of matrix pencils with a single rank restriction
• Some remarks on matrix pencil completion problems.
• The quasi-Kronecker form for matrix pencils
• The quasi-Weierstrass form for regular matrix pencils
• A \(QR\) decomposition for matrix pencils

zbMATH Keywords

completion of matrix pencilspartitions of integerspolynomial pathsquasi-regular matrix pencils

Mathematics Subject Classification ID

Matrix completion problems (15A83) Combinatorial aspects of partitions of integers (05A17) Matrix pencils (15A22)

Cites Work

• Matrices with prescribed rows and invariant factors
• Interlacing inequalities for regular pencils
• Embedding a regular subpencil into a general linear pencil
• Unified theorems on completions of matrix pencils
• Similarity invariants of completions of submatrices
• Interlacing inequalities for invariant factors
• Imbedding conditions for \(\lambda\)-matrices
• Assigning the Kronecker invariants of a matrix pencil by row or column completions
• Completion up to a matrix pencil with column minimal indices as the only nontrivial Kronecker invariants
• The rank distance problem for pairs of matrices and a completion of quasi-regular matrix pencils
• Matrix pencils completion problems
• Feedback invariants of matrices with prescribed rows
• Matrices with prescribed characteristic polynomial and a prescribed submatrix. III
• Combinatorics of column minimal indices and matrix pencil completion problems
• Column completion of a pair of matrices
• Eigenvalues of completions of submatrices
• Similarity class of a matrix with a prescribed submatrix
• Rank distance problem for pairs of matrices
• Subrepresentations of Kronecker representations.
• On properties of the generalized majorization
• Explicit solution of the row completion problem for matrix pencils
• Matrix pencils completion problems. II
• On convexity of polynomial paths and generalized majorizations

Cited In (13)

• The General Matrix Pencil Completion Problem: A Minimal Case
• Descriptor systems under feedback and output injection
• Completion of matrix pencils with a single rank restriction
• Matrix pencils completion problems. II
• Addition to “The Quasi-Kronecker Form for Matrix Pencils
• Combinatorics of column minimal indices and matrix pencil completion problems
• Some remarks on matrix pencil completion problems.
• Title not available (Why is that?)
• The rank distance problem for pairs of matrices and a completion of quasi-regular matrix pencils
• Minimal completion problem for quasi-regular matrix pencils
• Double generalized majorization and diagrammatics
• Combinatorics of polynomial chains
• A short solution to the subpencil problem involving only column minimal indices

This page was built for publication: Completion of quasi-regular matrix pencils

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