Nicola Guglielmi

Nicola Guglielmi

Auto-generated profile, based on publicly available information

Nicola Guglielmi

Gran Sasso Science Institute, L’Aquila, Italy

Research Focus & Metrics

Academic Career Length

34Years (1993-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
26 May 2012 in Foundations of Computational Mathematics
Verified
Journal Article
Closed access
PDF file
NGNicola Guglielmi
Nicola Guglielmi
VPVladimir Protasov
Vladimir Protasov

1 July 2001 in Computing
Verified
Journal Article
Closed access
PDF file
NGNicola Guglielmi
Nicola Guglielmi
EHErnst Hairer
Ernst Hairer

1 October 2011 in SIAM Journal on Matrix Analysis and Applications
Verified
Journal Article
Closed access
NGNicola Guglielmi
Nicola Guglielmi
MOMichael L. Overton
Michael L. Overton
The $\varepsilon$-pseudospectral abscissa and radius of an $n\times n$ matrix are, respectively, the maximal real part and the maximal modulus of points in its $\varepsilon$-pseudospectrum, defined using the spectral norm. Existing techniques compute these quantities accurately, but the cost is multiple singular value decompositions and eigenvalue decompositions of order n, making them impractical when n is large. We present new algorithms based on computing only the spectral abscissa or radius of a sequence of matrices, generating a sequence of lower bounds for the pseudospectral abscissa or radius. We characterize fixed points of the iterations, and we discuss conditions under which the sequence of lower bounds converges to local maximizers of the real part or modulus over the pseudospectrum, proving a locally linear rate of convergence for $\varepsilon$ sufficiently small. The convergence results depend on a perturbation theorem for the normalized eigenprojection of a matrix as well as a characterizati...

1 January 2005 in SIAM Journal on Matrix Analysis and Applications
Verified
Journal Article
Closed access
NGN. Guglielmi
N. Guglielmi
FWF. Wirth
F. Wirth
MZM. Zennaro
M. Zennaro
In this paper we consider finite families of complex $n\times n$-matrices. In particular, we focus on those families that satisfy the so-called finiteness conjecture, which was recently disproved in its more general formulation. We conjecture that the validity of the finiteness conjecture for a finite family of nondefective type is equivalent to the existence of an extremal norm in the class of complex polytope norms. However, we have not been able to prove this complex polytope extremality conjecture, but we are able to prove the small complex polytope extremality theorem under some more restrictive hypotheses on the underlying family of matrices. In addition, our theorem assures a certain finiteness property on the number of vertices of the unit ball of the extremal complex polytope norm, which could be very useful for the construction of suitable algorithms aimed at the actual computation of the spectral radius of the family.

28 April 2007 in Advances in Computational Mathematics
Verified
Journal Article
Closed access
PDF file
NGNicola Guglielmi
Nicola Guglielmi
EHErnst Hairer
Ernst Hairer

1 May 2008 in Linear Algebra and its Applications
Verified
Journal Article
Closed access
NGNicola Guglielmi
Nicola Guglielmi
MZMarino Zennaro
Marino Zennaro