[EN] In this paper we solve the bounded rank perturbation problem for regular pencils over arbitrary fields. The solution is obtained by reducing the problem to a row completion problem for matrix pencils. The result ...
[EN] The Berlekamp-Massey algorithm solves the problem of finding the shortest linear feedback shift register which generates a given finite sequence of scalars. This problem is reinterpreted from the point of view of the ...
Baragana, Itziar; Roca Martinez, Alicia(Society for Industrial and Applied Mathematics, 2022)
[EN] The change of the Kronecker structure of a matrix pencil perturbed by another
pencil of rank one has been characterized in terms of the homogeneous invariant factors and the
chains of column and row minimal indices ...