Luca Pennati
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Luca Pennati has a total of 31 co-authors. Here are the top co-authors by number of shared publications:
- Stefano Markidis
KTH Royal Institute of Technology, Stockholm, Sweden
6 shared publications - Gilbert Netzer
KTH Royal Institute of Technology, Stockholm, Sweden
3 shared publications - Ivy Peng
KTH Royal Institute of Technology
3 shared publications - Erik Marton Åsgrim
KTH, Stockholm, Sweden
2 shared publications - Marco Pasquale
KTH, Stockholm, Sweden
2 shared publications - Ales Podolnik
Institute of Plasma Physics of the CAS, Prague, Czech Republic
1 shared publication
Latest Publications
- Open Access
- 5 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 133-144
Post-Moore Technologies for Plasma Simulation: A Community Roadmap
- 5 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 133-144
Open AccessPost-Moore Technologies for Plasma Simulation: A Community Roadmap
- 23 June 2026
- Published by Springer Nature
- p. 48-63
Not Your Usual FFT: QFT$\rightarrow $FFT via Classical Quantum-Circuit Simulation- 23 June 2026
- Published by Springer Nature
- p. 48-63
Not Your Usual FFT: QFT$\rightarrow $FFT via Classical Quantum-Circuit Simulation- Open Access
- 24 April 2026
- Published by Elsevier in SSRN Electronic Journal
Mass Matrix Assembly on Tensor Cores for Implicit Particle-In-Cell Methods
Matrix-multiply-accumulate (MMA) units, or tensor cores, are now widespread across modern computing architectures. Yet, their use for particle-grid operators remains limited. In implicit particle methods, mass-matrix assembly is a reduction-dominated kernel in which weighted outer products of interpolation weights are accumulated over particle support. We show that this operation can be reformulated exactly, cell by cell, as a sequence of matrix products matched to hardware MMA tiles. The formulation is general with respect to interpolation order and hardware platform, and applies to both scalar mass matrices and the tensorial block mass matrix arising in implicit in the Energy-Conserving Semi-Implicit Method (ECSIM) for Particle-in-Cell simulations. We introduce particle batching and a support-group decomposition for higher-order shape functions whose stencil extends beyond a single cell, specialize the method to first- and second-order B-spline interpolation, and implement it on NVIDIA tensor cores. The resulting kernels achieve up to 3x over optimized conventional implementations and reduce end-to-end ECSIM runtime by 15%.
- 24 April 2026
- Published by Elsevier in SSRN Electronic Journal
Open AccessMass Matrix Assembly on Tensor Cores for Implicit Particle-In-Cell Methods
Matrix-multiply-accumulate (MMA) units, or tensor cores, are now widespread across modern computing architectures. Yet, their use for particle-grid operators remains limited. In implicit particle methods, mass-matrix assembly is a reduction-dominated kernel in which weighted outer products of interpolation weights are accumulated over particle support. We show that this operation can be reformulated exactly, cell by cell, as a sequence of matrix products matched to hardware MMA tiles. The formulation is general with respect to interpolation order and hardware platform, and applies to both scalar mass matrices and the tensorial block mass matrix arising in implicit in the Energy-Conserving Semi-Implicit Method (ECSIM) for Particle-in-Cell simulations. We introduce particle batching and a support-group decomposition for higher-order shape functions whose stencil extends beyond a single cell, specialize the method to first- and second-order B-spline interpolation, and implement it on NVIDIA tensor cores. The resulting kernels achieve up to 3x over optimized conventional implementations and reduce end-to-end ECSIM runtime by 15%.
- Open Access
- 2 March 2026
- Published by Elsevier in Journal of Computational Science
- Vol. 95
Disturbance storm time index prediction with interpretable machine learning
- 2 March 2026
- Published by Elsevier in Journal of Computational Science
- Vol. 95
Open AccessDisturbance storm time index prediction with interpretable machine learning
- Open Access
- 19 February 2026
- Published by Elsevier in SSRN Electronic Journal
Tensor Network Compression for Fully Spectral Vlasov–Poisson Simulation
We propose a numerical method for kinetic plasma simulation in which the phase-space distribution function is represented by a low-rank tensor network with an adaptive level of compression. The Vlasov–Poisson system is advanced using Strang splitting, and each substep is treated spectrally in the corresponding variable. By expressing both the distribution function and the Fourier transform as tensor network objects (state and operator representations), spectral transforms are applied directly in compressed form, enabling time stepping without reconstructing the full phase-space grid. The self-consistent electric field is also computed within the tensor formalism. The charge density is obtained by contracting over velocity degrees of freedom and extracting the zero Fourier mode, which provides the source term for a spectral Poisson solver. We validate the approach on standard benchmarks, including Landau damping and the two-stream instability. Finally, we systematically study how compression parameters, including truncation tolerances and internal ranks (bond dimensions), affect momentum and energy conservation, positivity behavior, robustness to filamentation, and computational cost.
- 19 February 2026
- Published by Elsevier in SSRN Electronic Journal
Open AccessTensor Network Compression for Fully Spectral Vlasov–Poisson Simulation
We propose a numerical method for kinetic plasma simulation in which the phase-space distribution function is represented by a low-rank tensor network with an adaptive level of compression. The Vlasov–Poisson system is advanced using Strang splitting, and each substep is treated spectrally in the corresponding variable. By expressing both the distribution function and the Fourier transform as tensor network objects (state and operator representations), spectral transforms are applied directly in compressed form, enabling time stepping without reconstructing the full phase-space grid. The self-consistent electric field is also computed within the tensor formalism. The charge density is obtained by contracting over velocity degrees of freedom and extracting the zero Fourier mode, which provides the source term for a spectral Poisson solver. We validate the approach on standard benchmarks, including Landau damping and the two-stream instability. Finally, we systematically study how compression parameters, including truncation tolerances and internal ranks (bond dimensions), affect momentum and energy conservation, positivity behavior, robustness to filamentation, and computational cost.
- Open Access
- 25 January 2026
- Published by Association for Computing Machinery (ACM)
- p. 68-80
QPU Micro-Kernels for Stencil Computation
- 25 January 2026
- Published by Association for Computing Machinery (ACM)
- p. 68-80
Open AccessQPU Micro-Kernels for Stencil Computation
- Open Access
- 15 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 1860-1867
An HPC-Inspired Blueprint for a Technology-Agnostic Quantum Middle Layer
- 15 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 1860-1867
Open AccessAn HPC-Inspired Blueprint for a Technology-Agnostic Quantum Middle Layer