DC FieldValueLanguage
dc.contributor.authorDodig, Marijaen
dc.date.accessioned2020-04-27T10:33:23Z-
dc.date.available2020-04-27T10:33:23Z-
dc.date.issued2017-07-15en
dc.identifier.issn0024-3795en
dc.identifier.urihttp://researchrepository.mi.sanu.ac.rs/handle/123456789/648-
dc.description.abstractIn this paper we study the problem of completion of an arbitrary matrix pencil by rows and columns in order to obtain a quasi-regular matrix pencil, in the case when the number of added columns, or rows, is the minimal possible to obtain a quasi-regular matrix pencil. In the solution we use combinatorial methods involving LR coefficients, a solution of the Carlson problem and localization techniques. The result is given over algebraically closed fields.en
dc.publisherElsevier-
dc.relationFundação para a Ciência e a Tecnologia/(FCT), Grant No. UID/MAT/04721/2013-
dc.relationGeometry and Topology of Manifolds, Classical Mechanics and Integrable Dynamical Systems-
dc.relation.ispartofLinear Algebra and Its Applicationsen
dc.subjectCarlson problem | Completion of pencils | Quasi-regular pencilsen
dc.titleMinimal completion problem for quasi-regular matrix pencilsen
dc.typeArticleen
dc.identifier.doi10.1016/j.laa.2017.03.009en
dc.identifier.scopus2-s2.0-85016160327en
dc.relation.firstpage84en
dc.relation.lastpage104en
dc.relation.volume525en
dc.description.rankM21-
item.fulltextNo Fulltext-
item.openairetypeArticle-
item.grantfulltextnone-
item.cerifentitytypePublications-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
crisitem.author.orcid0000-0001-8209-6920-
Show simple item record

SCOPUSTM   
Citations

4
checked on Apr 1, 2025

Page view(s)

28
checked on Jan 31, 2025

Google ScholarTM

Check

Altmetric

Altmetric


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