Work

Is the bounded rank perturbations problem for matrix pencils just a completion problem?

Year: 2025

Type: article

Abstract: In 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.

Source: Electronic Journal of Linear Algebra

DOI: 10.13001/ela.2025.9593

Authors: Marija Dodig, Marko Stosic

Institution: University of Lisbon

Language: English

Topic: Matrix Theory and Algorithms

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: diamond

Funders: Universidade de Lisboa, Fundação para a Ciência e a Tecnologia

Award: Centro de Estudos Matemáticos de Ciências, ULisboa