The General Matrix Pencil Completion Problem: A Minimal Case

DOI10.1137/17M1155041MaRDI QIDQ4631264zbMATH OpenOpenAlexWikidataFDO

Authors Marija Dodig, Marko Stošić

Publication date 24 April 2019

Published in SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/17m1155041

zbMATH Keywords

completion of matrix pencilsmajorization of partitions

Mathematics Subject Classification ID

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

Recommendations

• Minimal completion problem for quasi-regular matrix pencils
• Some remarks on matrix pencil completion problems.
• Matrix pencils completion problems
• Matrix pencils completion problems. II
• The P₀-matrix completion problem
• Completion of matrix pencils with a single rank restriction
• The P₀^+-matrix completion problem
• scientific article; zbMATH DE number 1413869
• Exact matrix completion via convex optimization
• Minimization of the norm, the norm of the inverse and the condition number of a matrix by completion

Cites work

• scientific article; zbMATH DE number 4070711 (Why is no real title available?)
• scientific article; zbMATH DE number 3661177 (Why is no real title available?)
• scientific article; zbMATH DE number 3673938 (Why is no real title available?)
• scientific article; zbMATH DE number 3752680 (Why is no real title available?)
• scientific article; zbMATH DE number 97560 (Why is no real title available?)
• scientific article; zbMATH DE number 3334252 (Why is no real title available?)
• scientific article; zbMATH DE number 3390604 (Why is no real title available?)
• Assigning the Kronecker invariants of a matrix pencil by row or column completions
• Column completion of a pair of matrices
• Combinatorics of column minimal indices and matrix pencil completion problems
• Combinatorics of polynomial chains
• Completion of quasi-regular matrix pencils
• Completion up to a matrix pencil with column minimal indices as the only nontrivial Kronecker invariants
• Controllability Subspaces and Feedback Simulation
• Descriptor systems under feedback and output injection
• Eigenvalues of completions of submatrices
• Eigenvalues, invariant factors, highest weights, and Schubert calculus
• Embedding a regular subpencil into a general linear pencil
• Existenzsätze in der Theorie der Matrizen und lineare Kontrolltheorie
• Explicit solution of the row completion problem for matrix pencils
• Feedback invariants of matrices with prescribed rows
• Fundamental theorem of state feedback for singular systems
• Imbedding conditions for \(\lambda\)-matrices
• Interlacing inequalities for invariant factors
• Interlacing inequalities for regular pencils
• Matrices with prescribed characteristic polynomial and a prescribed submatrix. III
• Matrices with prescribed rows and invariant factors
• Matrix pencils completion problems
• Matrix pencils completion problems. II
• Minimal completion problem for quasi-regular matrix pencils
• On the fundamental theorem of linear state variable feedback
• Placing zeroes and the Kronecker canonical form
• Similarity class of a matrix with a prescribed submatrix
• Similarity invariants of completions of submatrices
• Submodules of Kronecker modules via extension monoid products
• Subrepresentations of Kronecker representations.
• Sur la Modification de la Structure à l’Infini par un Retour D’État Statique
• The rank distance problem for pairs of matrices and a completion of quasi-regular matrix pencils

Cited in

(23)

• Bounded rank perturbations of a regular matrix pencil
• One dimensional perturbation problem for linear relations
• Minimal rank perturbations of matrix pencils
• Row completion of polynomial and rational matrices
• Row or Column Completion of Polynomial Matrices of Given Degree
• Explicit solution of the row completion problem for matrix pencils
• Completion of matrix pencils with a single rank restriction
• Row or column completion of polynomial matrices of given degree. II
• Combinatorics of column minimal indices and matrix pencil completion problems
• Some remarks on matrix pencil completion problems.
• Completion up to a matrix pencil with column minimal indices as the only nontrivial Kronecker invariants
• Matrix pencils completions of size two
• scientific article; zbMATH DE number 7224104 (Why is no real title available?)
• scientific article; zbMATH DE number 653117 (Why is no real title available?)
• Minimal completion problem for quasi-regular matrix pencils
• Matrix pencils completion problems
• GMPCP for one row and one column completion
• Combinatorics of polynomial chains
• Rank one perturbations of matrix pencils
• Rank-one perturbations of matrix pencils
• A short solution to the subpencil problem involving only column minimal indices
• Is the bounded rank perturbations problem for matrix pencils just a completion problem?
• Bounded rank perturbations of matrix pencils without nontrivial invariant factors

This page was built for publication: The General Matrix Pencil Completion Problem: A Minimal Case

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