74 citations · 122 across the 32 of their papers we have counts for
8 papers · 1 filter
Fast Hessenberg reduction of some rank structured matrices
Luca Gemignani, Leonardo Robol
We develop two fast algorithms for Hessenberg reduction of a structured matrix where is a real or unitary diagonal matrix and $U, V \in\mathbb{C}^{n…
Fast and backward stable computation of the eigenvalues and eigenvectors of matrix polynomials
Jared Aurentz, Thomas Mach, Leonardo Robol +2
In the last decade matrix polynomials have been investigated with the primary focus on adequate linearizations and good scaling techniques for computing their eigenvalues and eigen…
Fast and backward stable computation of roots of polynomials, Part II: backward error analysis; companion matrix and companion pencil
Jared L. Aurentz, Thomas Mach, Leonardo Robol +2
This work is a continuation of "Fast and backward stable computation of roots of polynomials" by J.L. Aurentz, T. Mach, R. Vandebril, and D.S. Watkins, SIAM Journal on Matrix Analy…
On the decay of the off-diagonal singular values in cyclic reduction
Dario Andrea Bini, Stefano Massei, Leonardo Robol
It was recently observed that the singular values of the off-diagonal blocks of the matrix sequences generated by the Cyclic Reduction algorithm decay exponentially. This property…
Decay bounds for the numerical quasiseparable preservation in matrix functions
Stefano Massei, Leonardo Robol
Given matrices and such that , where is a holomorphic function, we analyze the relation between the singular values of the off-diagonal submatrices of an…
Solvability and uniqueness criteria for generalized Sylvester-type equations
Fernando De Terán, Bruno Iannazzo, Federico Poloni +1
We provide necessary and sufficient conditions for the generalized -Sylvester matrix equation, , to have exactly one solution for any right-hand side E…