Abstract
In this paper we consider and solve the General Matrix Pencil Completion Problem (GMPCP) under single rank restrictions. These constraints are less limiting than any other restrictions on the GMPCP studied in the past. Thus, the obtained results directly generalize the existing results in the literature on the GMPCP. Finally, as one direct corollary of the main results, we obtain a novel result on determining the possible Kronecker invariants of a quasi-regular matrix pencil with a prescribed subpencil.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
