15 citations · 22 across the 5 of their papers we have counts for
6 papers
Orthogonal iterations on Structured Pencils
Roberto Bevilacqua, Gianna M. Del Corso, Luca Gemignani
We present a class of fast subspace tracking algorithms based on orthogonal iterations for structured matrices/pencils that can be represented as small rank perturbations of unitar…
Efficient Reduction of Compressed Unitary plus Low-rank Matrices to Hessenberg form
Roberto Bevilacqua, Gianna M. Del Corso, Luca Gemignani
We present fast numerical methods for computing the Hessenberg reduction of a unitary plus low-rank matrix , where is a unitary matrix repre…
Fast QR iterations for unitary plus low rank matrices
Roberto Bevilacqua, Gianna M. Del Corso, Luca Gemignani
Some fast algorithms for computing the eigenvalues of a block companion matrix , where is unitary block circulant and $X, Y \in\mathbb{C}…
A CMV--based eigensolver for companion matrices
Roberto Bevilacqua, Gianna M. Del Corso, Luca gemignani
In this paper we present a novel matrix method for polynomial rootfinding. By exploiting the properties of the QR eigenvalue algorithm applied to a suitable CMV-like form of a comp…
Compression of unitary rank--structured matrices to CMV-like shape with an application to polynomial rootfinding
Roberto Bevilacqua, Gianna M. Del Corso, Luca Gemignani
This paper is concerned with the reduction of a unitary matrix U to CMV-like shape. A Lanczos--type algorithm is presented which carries out the reduction by computing the block tr…
Block Tridiagonal Reduction of Perturbed Normal and Rank Structured Matrices
Roberto Bevilacqua, Gianna M. Del Corso, Luca Gemignani
It is well known that if a matrix solves the matrix equation , where is a linear bivariate polynomial, then is normal; and…