DC FieldValueLanguage
dc.contributor.authorDodig, Marijaen_US
dc.contributor.authorStošić, Markoen_US
dc.date.accessioned2021-11-03T10:05:23Z-
dc.date.available2021-11-03T10:05:23Z-
dc.date.issued2021-01-01-
dc.identifier.issn0308-1087-
dc.identifier.urihttp://researchrepository.mi.sanu.ac.rs/handle/123456789/4672-
dc.description.abstractIn 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.en_US
dc.publisherTaylor & Francisen_US
dc.relation.ispartofLinear and Multilinear Algebraen_US
dc.subject05A17 | 15A83 | Completion of matrix pencils | polynomial chains | quasi-regular pencils | rank restrictionsen_US
dc.titleCompletion of matrix pencils with a single rank restrictionen_US
dc.typeArticleen_US
dc.identifier.doi10.1080/03081087.2021.1981810-
dc.identifier.scopus2-s2.0-85116312497-
dc.contributor.affiliationMechanicsen_US
dc.contributor.affiliationMathematics-
dc.contributor.affiliationMathematical Institute of the Serbian Academy of Sciences and Arts-
dc.description.rank~M21-
item.cerifentitytypePublications-
item.grantfulltextnone-
item.openairetypeArticle-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.fulltextNo Fulltext-
crisitem.author.orcid0000-0001-8209-6920-
crisitem.author.orcid0000-0002-4464-396X-
Show simple item record

SCOPUSTM   
Citations

2
checked on Jun 20, 2024

Page view(s)

81
checked on May 9, 2024

Google ScholarTM

Check

Altmetric

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.