Pasqua D'Ambra

Dr. Pasqua D'Ambra

orcid

Research Focus & Metrics

Academic Career Length

32Years (1995-Present)

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

Representative Publications

View All Publications
1 April 2013 in Computing and Visualization in Science
Verified
Journal Article
Closed access
PDF file
PDPasqua D'Ambra
Pasqua D'Ambra
PVPanayot S. Vassilevski
Panayot S. Vassilevski

18 June 2018 in ACM Transactions on Mathematical Software
Verified
Journal Article
Open access
PDF file
PDPasqua D'Ambra
Pasqua D'Ambra
SFSalvatore Filippone
Salvatore Filippone
PVPanayot S. Vassilevski
Panayot S. Vassilevski
This article has two main objectives: one is to describe some extensions of an adaptive Algebraic Multigrid (AMG) method of the form previously proposed by the first and third authors, and a second one is to present a new software framework, named BootCMatch , which implements all the components needed to build and apply the described adaptive AMG both as a stand-alone solver and as a preconditioner in a Krylov method. The adaptive AMG presented is meant to handle general symmetric and positive definite (SPD) sparse linear systems, without assuming any a priori information of the problem and its origin; the goal of adaptivity is to achieve a method with a prescribed convergence rate. The presented method exploits a general coarsening process based on aggregation of unknowns, obtained by a maximum weight matching in the adjacency graph of the system matrix. More specifically, a maximum product matching is employed to define an effective smoother subspace (complementary to the coarse space), a process referred to as compatible relaxation, at every level of the recursive two-level hierarchical AMG process. Results on a large variety of test cases and comparisons with related work demonstrate the reliability and efficiency of the method and of the software.

1 January 2021 in SIAM Journal on Scientific Computing
Verified
Journal Article
Closed access
PDPasqua D'Ambra
Pasqua D'Ambra
FDFabio Durastante
Fabio Durastante
SFSalvatore Filippone
Salvatore Filippone
Linear solvers for large and sparse systems are a key element of scientific applications, and their efficient implementation is necessary to harness the computational power of current computers. Al...

13 February 2007 in Applicable Algebra in Engineering, Communication and Computing
Verified
Journal Article
Closed access
PDF file
ABAlfredo Buttari
Alfredo Buttari
PDPasqua D'Ambra
Pasqua D'Ambra
DSDaniela di Serafino
Daniela di Serafino
SFSalvatore Filippone
Salvatore Filippone

20 October 2019 in Numerical Linear Algebra with Applications
Verified
Journal Article
Closed access
PDF file
PDPasqua D'Ambra
Pasqua D'Ambra
PVPanayot S. Vassilevski
Panayot S. Vassilevski

19 June 2023 in IEEE Transactions on Parallel and Distributed Systems
Verified
Journal Article
Closed access
MBMassimo Bernaschi
Massimo Bernaschi
ACAlessandro Celestini
Alessandro Celestini
FVFlavio Vella
Flavio Vella
PDPasqua D'Ambra
Pasqua D'Ambra
We present and release in open source format a sparse linear solver which efficiently exploits heterogeneous parallel computers. The solver can be easily integrated into scientific applications that need to solve large and sparse linear systems on modern parallel computers made of hybrid nodes hosting Nvidia Graphics Processing Unit (GPU) accelerators. The work extends previous efforts of some of the authors in the exploitation of a single GPU accelerator and proposes an implementation, based on the hybrid MPI-CUDA software environment, of a Krylov-type linear solver relying on an efficient Algebraic MultiGrid (AMG) preconditioner already available in the BootCMatchG library. Our design for the hybrid implementation has been driven by the best practices for minimizing data communication overhead when multiple GPUs are employed, yet preserving the efficiency of the GPU kernels. Strong and weak scalability results of the new version of the library on well-known benchmark test cases are discussed. Comparisons with the Nvidia AmgX solution show a speedup, in the solve phase, up to 2.0x.