DC FieldValueLanguage
dc.contributor.authorDodig, Marijaen_US
dc.contributor.authorStošić, Markoen_US
dc.date.accessioned2025-12-24T16:45:02Z-
dc.date.available2025-12-24T16:45:02Z-
dc.date.issued2025-
dc.identifier.issn1537-9582-
dc.identifier.urihttp://researchrepository.mi.sanu.ac.rs/handle/123456789/5687-
dc.description.abstractIn this paper, we study a direct link between the bounded rank perturbations problem and the completion problem for matrix pencils. We conjecture that the bounded rank perturbations problem is, in fact, equivalent to a completion problem. We prove the conjecture in three cases: when the rank bound is one, when the involved pencils are of full row rank, and when the rank bound equals the rank distance of the involved matrix pencils.en_US
dc.publisherInternational Linear Algebra Societyen_US
dc.relation.ispartofElectronic Journal of Linear Algebraen_US
dc.subjectBounded rank perturbations | Completion of matrix pencils | Matrix pencilsen_US
dc.titleIS THE BOUNDED RANK PERTURBATIONS PROBLEM FOR MATRIX PENCILS JUST A COMPLETION PROBLEM?en_US
dc.typeArticleen_US
dc.identifier.doi10.13001/ela.2025.9593-
dc.identifier.scopus2-s2.0-105017910777-
dc.contributor.affiliationMechanicsen_US
dc.contributor.affiliationMathematicsen_US
dc.contributor.affiliationMathematical Institute of the Serbian Academy of Sciences and Arts-
dc.relation.firstpage491-
dc.relation.lastpage510-
dc.relation.volume41-
dc.description.rankM22-
item.openairetypeArticle-
item.fulltextNo Fulltext-
item.grantfulltextnone-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.cerifentitytypePublications-
crisitem.author.orcid0000-0001-8209-6920-
crisitem.author.orcid0000-0002-4464-396X-
Show simple item record

Page view(s)

8
checked on Jan 9, 2026

Google ScholarTM

Check

Altmetric

Altmetric


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