Luca Bergamaschi

Luca Bergamaschi


Research Focus & Metrics

Academic Career Length

28Years (1999-Present)

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

Representative Publications

View All Publications
7 January 2021 in Numerical Linear Algebra with Applications
Verified
Journal Article
Open access
PDF file
LBLuca Bergamaschi
Luca Bergamaschi
JGJacek Gondzio
Jacek Gondzio
ÁCÁngeles Martinez Calomardo
Ángeles Martinez Calomardo
JPJohn W. Pearson
John W. Pearson
SPSpyridon Pougkakiotis
Spyridon Pougkakiotis
In this article, we address the efficient numerical solution of linear and quadratic programming problems, often of large scale. With this aim, we devise an infeasible interior point method, blended with the proximal method of multipliers, which in turn results in a primal‐dual regularized interior point method. Application of this method gives rise to a sequence of increasingly ill‐conditioned linear systems which cannot always be solved by factorization methods, due to memory and CPU time restrictions. We propose a novel preconditioning strategy which is based on a suitable sparsification of the normal equations matrix in the linear case, and also constitutes the foundation of a block‐diagonal preconditioner to accelerate MINRES for linear systems arising from the solution of general quadratic programming problems. Numerical results for a range of test problems demonstrate the robustness of the proposed preconditioning strategy, together with its ability to solve linear systems of very large dimension.

21 April 2020 in Algorithms
Verified
Journal Article
Open access
PDF file
LBLuca Bergamaschi
Luca Bergamaschi
The aim of this survey is to review some recent developments in devising efficient preconditioners for sequences of symmetric positive definite (SPD) linear systems A k x k = b k , k = 1 , … arising in many scientific applications, such as discretization of transient Partial Differential Equations (PDEs), solution of eigenvalue problems, (Inexact) Newton methods applied to nonlinear systems, rational Krylov methods for computing a function of a matrix. In this paper, we will analyze a number of techniques of updating a given initial preconditioner by a low-rank matrix with the aim of improving the clustering of eigenvalues around 1, in order to speed-up the convergence of the Preconditioned Conjugate Gradient (PCG) method. We will also review some techniques to efficiently approximate the linearly independent vectors which constitute the low-rank corrections and whose choice is crucial for the effectiveness of the approach. Numerical results on real-life applications show that the performance of a given iterative solver can be very much enhanced by the use of low-rank updates.

28 April 2023 in Applied Numerical Mathematics
Verified
Journal Article
Open access
FBFariba Bakrani Balani
Fariba Bakrani Balani
MHMasoud Hajarian
Masoud Hajarian
LBLuca Bergamaschi
Luca Bergamaschi

1 July 2019 in Journal of Computational and Applied Mathematics
Verified
Journal Article
Closed access
LBLuca Bergamaschi
Luca Bergamaschi
EFE. Facca
E. Facca
ÁCÁngeles Martinez Calomardo
Ángeles Martinez Calomardo
MPM. Putti
M. Putti

22 February 2024 in Numerical Linear Algebra with Applications
Verified
Journal Article
Open access
FBFariba Balani Bakrani
Fariba Balani Bakrani
LBLuca Bergamaschi
Luca Bergamaschi
ÁCÁngeles Martinez Calomardo
Ángeles Martinez Calomardo
MHMasoud Hajarian
Masoud Hajarian
Summary: In this paper, we describe and analyze the spectral properties of several exact block preconditioners for a class of double saddle point problems. Among all these, we consider an inexact version of a block triangular preconditioner providing extremely fast convergence of the (F)GMRES method. We develop a spectral analysis of the preconditioned matrix showing that the complex eigenvalues lie in a circle of center and radius 1, while the real eigenvalues are described in terms of the roots of a third order polynomial with real coefficients. Numerical examples are reported to illustrate the efficiency of inexact versions of the proposed preconditioners, and to verify the theoretical bounds.

1 April 2006 in Applied Mathematics and Computation
Verified
Journal Article
Closed access
LBLuca Bergamaschi
Luca Bergamaschi
ÁCÁngeles Martinez Calomardo
Ángeles Martinez Calomardo
GPGiorgio Pini
Giorgio Pini