Pasqua D'Ambra
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Pasqua D'Ambra has a total of 87 co-authors. Here are the top co-authors by number of shared publications:
- Salvatore Filippone
Istituto per le Applicazioni del Calcolo “Mauro Picone
14 shared publications - Fabio Durastante
Department of Mathematics, University of Pisa, Pisa, Italy
10 shared publications - Daniela di Serafino
Department of Mathematics and Applications University of Naples Federico II Napoli Italy
4 shared publications - Alessandro Celestini
Institute for Applied Mathematics National Research Council Rome Italy
3 shared publications - Herbert Owen
Universitat Politècnica de Catalunya, Jordi Girona 1-3, Edifici C1, 08034 Barcelona, Spain
3 shared publications - Massimo Bernaschi
Istituto per le Applicazioni del Calcolo
3 shared publications
Latest Publications
- Open Access
- 19 May 2026
- Published by Association for Computing Machinery (ACM)
- p. 163-171
The Energy-Oriented Centre of Excellence
EoCoE is a EuroHPC Centre of Excellence contributing to Europe transition to sustainable energy through High Performance Computing. Now in its third phase, the project harnesses exascale technologies, massively parallel simulations, and advanced computational methods to tackle some of the most pressing challenges in renewable energy. At the heart of EoCoE are five lighthouse applications spanning four strategic domains: fusion, photovoltaics, water, and wind energy. By enhancing these applications, making them exascale-ready, and developing and optimising the underlying software tools and mathematical libraries, the project contributes to both the green energy transition and the advancement of scientific computing methodologies in Europe. This paper presents the five lighthouse applications and highlights the key achievements in performance, portability, and productivity. It further describes the development of enabling tools and libraries, and outlines the project broader efforts to maximise scientific, technological, and societal impact.
- 19 May 2026
- Published by Association for Computing Machinery (ACM)
- p. 163-171
Open AccessThe Energy-Oriented Centre of Excellence
EoCoE is a EuroHPC Centre of Excellence contributing to Europe transition to sustainable energy through High Performance Computing. Now in its third phase, the project harnesses exascale technologies, massively parallel simulations, and advanced computational methods to tackle some of the most pressing challenges in renewable energy. At the heart of EoCoE are five lighthouse applications spanning four strategic domains: fusion, photovoltaics, water, and wind energy. By enhancing these applications, making them exascale-ready, and developing and optimising the underlying software tools and mathematical libraries, the project contributes to both the green energy transition and the advancement of scientific computing methodologies in Europe. This paper presents the five lighthouse applications and highlights the key achievements in performance, portability, and productivity. It further describes the development of enabling tools and libraries, and outlines the project broader efforts to maximise scientific, technological, and societal impact.
- Open Access
- 16 April 2026
- Published by Elsevier in Future Generation Computer Systems
- Vol. 183
On the energy efficiency of sparse matrix computations on multi-GPU clusters
- 16 April 2026
- Published by Elsevier in Future Generation Computer Systems
- Vol. 183
Open AccessOn the energy efficiency of sparse matrix computations on multi-GPU clusters
- Open Access
Inexact Gauss Seidel and Coarse Solvers for AMG and s-step CG
Communication-avoiding Krylov methods require solving small dense Gram systems at each outer iteration. We present a low-synchronization approach based on Forward Gauss--Seidel (FGS), which exploits the structure of Gram matrices arising from Chebyshev polynomial bases. We show that a single FGS sweep is mathematically equivalent to Modified Gram--Schmidt (MGS) orthogonalization in the $A$-norm and provide corresponding backward error bounds. For weak scaling on AMD MI-series GPUs, we demonstrate that 20--30 FGS iterations preserve scalability up to 64 GPUs with problem sizes exceeding 700 million unknowns. We further extend this approach to Algebraic MultiGrid (AMG) coarse-grid solves, removing the need to assemble or factor dense coarse operators
Open AccessInexact Gauss Seidel and Coarse Solvers for AMG and s-step CG
Communication-avoiding Krylov methods require solving small dense Gram systems at each outer iteration. We present a low-synchronization approach based on Forward Gauss--Seidel (FGS), which exploits the structure of Gram matrices arising from Chebyshev polynomial bases. We show that a single FGS sweep is mathematically equivalent to Modified Gram--Schmidt (MGS) orthogonalization in the $A$-norm and provide corresponding backward error bounds. For weak scaling on AMD MI-series GPUs, we demonstrate that 20--30 FGS iterations preserve scalability up to 64 GPUs with problem sizes exceeding 700 million unknowns. We further extend this approach to Algebraic MultiGrid (AMG) coarse-grid solves, removing the need to assemble or factor dense coarse operators
- 23 November 2025
- Published by Springer Nature
- p. 271-285
PSCToolkit: Solving Sparse Linear Systems with a Large Number of GPUs
- 23 November 2025
- Published by Springer Nature
- p. 271-285
PSCToolkit: Solving Sparse Linear Systems with a Large Number of GPUs
- 9 June 2025
- Published by Springer Nature in Numerical Algorithms
- Vol. 100 (4) , 1783-1812
Optimal polynomial smoothers for parallel AMG
- 9 June 2025
- Published by Springer Nature in Numerical Algorithms
- Vol. 100 (4) , 1783-1812
Optimal polynomial smoothers for parallel AMG
- Open Access
Communication-reduced Conjugate Gradient Variants for GPU-accelerated Clusters
Linear solvers are key components in any software platform for scientific and engineering computing. The solution of large and sparse linear systems lies at the core of physics-driven numerical simulations relying on partial differential equations (PDEs) and often represents a significant bottleneck in datadriven procedures, such as scientific machine learning. In this paper, we present an efficient implementation of the preconditioned s-step Conjugate Gradient (CG) method, originally proposed by Chronopoulos and Gear in 1989, for large clusters of Nvidia GPU-accelerated computing nodes. The method, often referred to as communication-reduced or communication-avoiding CG, reduces global synchronizations and data communication steps compared to the standard approach, enhancing strong and weak scalability on parallel computers. Our main contribution is the design of a parallel solver that fully exploits the aggregation of low-granularity operations inherent to the s-step CG method to leverage the high throughput of GPU accelerators. Additionally, it applies overlap between data communication and computation in the multi-GPU sparse matrix-vector product. Experiments on classic benchmark datasets, derived from the discretization of the Poisson PDE, demonstrate the potential of the method.
Open AccessCommunication-reduced Conjugate Gradient Variants for GPU-accelerated Clusters
Linear solvers are key components in any software platform for scientific and engineering computing. The solution of large and sparse linear systems lies at the core of physics-driven numerical simulations relying on partial differential equations (PDEs) and often represents a significant bottleneck in datadriven procedures, such as scientific machine learning. In this paper, we present an efficient implementation of the preconditioned s-step Conjugate Gradient (CG) method, originally proposed by Chronopoulos and Gear in 1989, for large clusters of Nvidia GPU-accelerated computing nodes. The method, often referred to as communication-reduced or communication-avoiding CG, reduces global synchronizations and data communication steps compared to the standard approach, enhancing strong and weak scalability on parallel computers. Our main contribution is the design of a parallel solver that fully exploits the aggregation of low-granularity operations inherent to the s-step CG method to leverage the high throughput of GPU accelerators. Additionally, it applies overlap between data communication and computation in the multi-GPU sparse matrix-vector product. Experiments on classic benchmark datasets, derived from the discretization of the Poisson PDE, demonstrate the potential of the method.
- Open Access
- 9 March 2024
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 80 (10) , 13533-13556
Alya toward exascale: algorithmic scalability using PSCToolkit
In this paper, we describe an upgrade of the Alya code with up-to-date parallel linear solvers capable of achieving reliability, efficiency and scalability in the computation of the pressure field at each time step of the numerical procedure for solving a Large Eddy Simulation formulation of the incompressible Navier–Stokes equations. We developed a software module in the Alya’s kernel to interface the libraries included in the current version of , a framework for the iterative solution of sparse linear systems, on parallel distributed-memory computers, by Krylov methods coupled to Algebraic MultiGrid preconditioners. The Toolkit has undergone various extensions within the EoCoE-II project with the primary goal of facing the exascale challenge. Results on a realistic benchmark for airflow simulations in wind farm applications show that the solvers significantly outperform the original versions of the Conjugate Gradient method available in the Alya’s kernel in terms of scalability and parallel efficiency and represent a very promising software layer to move the Alya code toward exascale.
- 9 March 2024
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 80 (10) , 13533-13556
Open AccessAlya toward exascale: algorithmic scalability using PSCToolkit
In this paper, we describe an upgrade of the Alya code with up-to-date parallel linear solvers capable of achieving reliability, efficiency and scalability in the computation of the pressure field at each time step of the numerical procedure for solving a Large Eddy Simulation formulation of the incompressible Navier–Stokes equations. We developed a software module in the Alya’s kernel to interface the libraries included in the current version of , a framework for the iterative solution of sparse linear systems, on parallel distributed-memory computers, by Krylov methods coupled to Algebraic MultiGrid preconditioners. The Toolkit has undergone various extensions within the EoCoE-II project with the primary goal of facing the exascale challenge. Results on a realistic benchmark for airflow simulations in wind farm applications show that the solvers significantly outperform the original versions of the Conjugate Gradient method available in the Alya’s kernel in terms of scalability and parallel efficiency and represent a very promising software layer to move the Alya code toward exascale.
- Open Access
Alya towards Exascale: Algorithmic Scalability using PSCToolkit
In this paper, we describe an upgrade of the Alya code with up-to-date parallel linear solvers capable of achieving reliability, efficiency and scalability in the computation of the pressure field at each time step of the numerical procedure for solving a Large Eddy Simulation formulation of the incompressible Navier-Stokes equations. We developed a software module in Alya's kernel to interface the libraries included in the current version of PSCToolkit, a framework for the iterative solution of sparse linear systems on parallel distributed-memory computers by Krylov methods coupled to Algebraic MultiGrid preconditioners. The Toolkit has undergone various extensions within the EoCoE-II project with the primary goal of facing the exascale challenge. Results on a realistic benchmark for airflow simulations in wind farm applications show that the PSCToolkit solvers significantly outperform the original versions of the Conjugate Gradient method available in the Alya's kernel in terms of scalability and parallel efficiency and represent a very promising software layer to move the Alya code towards exascale.
Open AccessAlya towards Exascale: Algorithmic Scalability using PSCToolkit
In this paper, we describe an upgrade of the Alya code with up-to-date parallel linear solvers capable of achieving reliability, efficiency and scalability in the computation of the pressure field at each time step of the numerical procedure for solving a Large Eddy Simulation formulation of the incompressible Navier-Stokes equations. We developed a software module in Alya's kernel to interface the libraries included in the current version of PSCToolkit, a framework for the iterative solution of sparse linear systems on parallel distributed-memory computers by Krylov methods coupled to Algebraic MultiGrid preconditioners. The Toolkit has undergone various extensions within the EoCoE-II project with the primary goal of facing the exascale challenge. Results on a realistic benchmark for airflow simulations in wind farm applications show that the PSCToolkit solvers significantly outperform the original versions of the Conjugate Gradient method available in the Alya's kernel in terms of scalability and parallel efficiency and represent a very promising software layer to move the Alya code towards exascale.
- Open Access
- 19 July 2023
- Published by Wiley in Numerical Linear Algebra with Applications
- Vol. 31 (1)
Why diffusion‐based preconditioning of Richards equation works: Spectral analysis and computational experiments at very large scale
We consider here a cell‐centered finite difference approximation of the Richards equation in three dimensions, averaging for interface values the hydraulic conductivity , a highly nonlinear function, by arithmetic, upstream and harmonic means. The nonlinearities in the equation can lead to changes in soil conductivity over several orders of magnitude and discretizations with respect to space variables often produce stiff systems of differential equations. A fully implicit time discretization is provided by backward Euler one‐step formula; the resulting nonlinear algebraic system is solved by an inexact Newton Armijo–Goldstein algorithm, requiring the solution of a sequence of linear systems involving Jacobian matrices. We prove some new results concerning the distribution of the Jacobians eigenvalues and the explicit expression of their entries. Moreover, we explore some connections between the saturation of the soil and the ill conditioning of the Jacobians. The information on eigenvalues justifies the effectiveness of some preconditioner approaches which are widely used in the solution of Richards equation. We also propose a new software framework to experiment with scalable and robust preconditioners suitable for efficient parallel simulations at very large scales. Performance results on a literature test case show that our framework is very promising in the advance toward realistic simulations at extreme scale.
- 19 July 2023
- Published by Wiley in Numerical Linear Algebra with Applications
- Vol. 31 (1)
Open AccessWhy diffusion‐based preconditioning of Richards equation works: Spectral analysis and computational experiments at very large scale
We consider here a cell‐centered finite difference approximation of the Richards equation in three dimensions, averaging for interface values the hydraulic conductivity , a highly nonlinear function, by arithmetic, upstream and harmonic means. The nonlinearities in the equation can lead to changes in soil conductivity over several orders of magnitude and discretizations with respect to space variables often produce stiff systems of differential equations. A fully implicit time discretization is provided by backward Euler one‐step formula; the resulting nonlinear algebraic system is solved by an inexact Newton Armijo–Goldstein algorithm, requiring the solution of a sequence of linear systems involving Jacobian matrices. We prove some new results concerning the distribution of the Jacobians eigenvalues and the explicit expression of their entries. Moreover, we explore some connections between the saturation of the soil and the ill conditioning of the Jacobians. The information on eigenvalues justifies the effectiveness of some preconditioner approaches which are widely used in the solution of Richards equation. We also propose a new software framework to experiment with scalable and robust preconditioners suitable for efficient parallel simulations at very large scales. Performance results on a literature test case show that our framework is very promising in the advance toward realistic simulations at extreme scale.
- Open Access
- 14 July 2023
- Published by Elsevier in Computers & Mathematics with Applications
- Vol. 144, 290-305
Automatic coarsening in Algebraic Multigrid utilizing quality measures for matching-based aggregations
- 14 July 2023
- Published by Elsevier in Computers & Mathematics with Applications
- Vol. 144, 290-305
Open AccessAutomatic coarsening in Algebraic Multigrid utilizing quality measures for matching-based aggregations