15 citations · 40 across the 17 of their papers we have counts for
18 papers
Numerical Solution of Nonclassical Boundary Value Problems
Paola Boito, Yuli Eidelman, Luca Gemignani
We provide a new approach to obtain solutions of certain evolution equations set in a Banach space and equipped with nonlocal boundary conditions. From this approach we derive a fa…
Relaxed Fixed Point Iterations for Matrix Equations Arising in Markov Chains Modeling
Luca Gemignani, Beatrice Meini
We present some accelerated variants of fixed point iterations for computing the minimal non-negative solution of the unilateral matrix equation associated with an M/G/1-type Marko…
Comparison Theorems for Splittings of M-matrices in (block) Hessenberg Form
Luca Gemignani, Federico Poloni
Some variants of the (block) Gauss--Seidel iteration for the solution of linear systems with -matrices in (block) Hessenberg form are discussed. Comparison results for the asymp…
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…
Bezout-like polynomial equations associated with dual univariate interpolating subdivision schemes
Luca Gemignani, Lucia Romani, Alberto Viscardi
The algebraic characterization of dual univariate interpolating subdivision schemes is investigated. Specifically, we provide a constructive approach for finding dual univariate in…
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…
Accelerating the Sinkhorn-Knopp iteration by Arnoldi-type methods
A. Aristodemo, L. Gemignani
It is shown that the problem of balancing a nonnegative matrix by positive diagonal matrices can be recast as a constrained nonlinear multiparameter eigenvalue problem. Based on th…
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}…
Computing the Reciprocal of a -function by Rational Approximation
Paola Boito, Yuli Eidelman, Luca Gemignani
In this paper we introduce a family of rational approximations of the reciprocal of a -function involved in the explicit solutions of certain linear differential equations, as w…
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…
Efficient Solution of Parameter Dependent Quasiseparable Systems and Computation of Meromorphic Matrix Functions
Paola Boito, Yuli Eidelman, Luca Gemignani
In this paper we focus on the solution of shifted quasiseparable systems and of more general parameter dependent matrix equations with quasiseparable representations. We propose an…
A Real QZ Algorithm for Structured Companion Pencils
Paola Boito, Yuli Eidelman, Luca Gemignani
We design a fast implicit real QZ algorithm for eigenvalue computation of structured companion pencils arising from linearizations of polynomial rootfinding problems. The modified…
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…
Exponential Splines and Pseudo-Splines: Generation versus reproduction of exponential polynomials
Costanza Conti, Luca Gemignani, Lucia Romani
Subdivision schemes are iterative methods for the design of smooth curves and surfaces. Any linear subdivision scheme can be identified by a sequence of Laurent polynomials, also c…
Implicit QR for Companion-like Pencils
Paola Boito, Yuli Eidelman, Luca Gemignani
A fast implicit QR algorithm for eigenvalue computation of low rank corrections of unitary matrices is adjusted to work with matrix pencils arising from polynomial zerofinding prob…
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…
The Ehrlich-Aberth method for palindromic matrix polynomials represented in the Dickson basis
Luca Gemignani, Vanni Noferini
An algorithm based on the Ehrlich-Aberth root-finding method is presented for the computation of the eigenvalues of a T-palindromic matrix polynomial. A structured linearization of…