Doctoral Showcase Archive

Hardware-Aware Matrix-Free Algorithms for Accelerating Large-Scale Finite-Element Simulations on Distributed CPU and GPU Architectures


Author: Gourab Panigrahi (Indian Institute of Science)

Advisor: Phani Motamarri (Indian Institute of Science)

Abstract: Large-scale simulations governed by partial differential equations reduce, after finite-element (FE) discretization, to two kernels: operator action on large blocks of vectors inside eigensolvers, and the solution of Poisson or Helmholtz systems inside linear solvers. Both are limited by data movement rather than floating-point throughput, and the traditional assembled sparse-matrix and cell-matrix strategies scale poorly at high polynomial order, the first bound by memory traffic, the second by an operation count that grows as the sixth power of the order.

This dissertation develops hardware-aware matrix-free algorithms that evaluate operator actions on the fly through sum factorization, batched over the multivector dimension. The contributions are batched FE Helmholtz matrix-multivector products, using even-odd decomposition and SIMD vectorization on CPUs and fused register-blocked kernels on GPUs, a matrix-free Kohn-Sham density functional theory (DFT) Hamiltonian action covering nonlocal projectors, real and complex arithmetic and inline constraint handling on AVX2/AVX-512/SVE CPUs and on GPUs with tensor cores and reduced-precision ghost exchange, a distributed-memory GPU fast-diagonalization solver that inverts the FE Laplacian exactly at O(N^(4/3)) FLOPs, and a device-native fused conjugate-gradient solver with a Chebyshev-Jacobi p-multigrid preconditioner.

Measured inside DFT-FE against existing baselines on Summit, Frontier, Fugaku, Polaris, Pravega and Aurora, the operator actions run 2.6x–5.8x faster than cell-matrix. The fused solve runs 5.86x faster than deal.II on 384 Aurora GPUs, and p-multigrid holds it at 5–7 iterations across polynomial orders. On tensor-product meshes one exact solve is 34x–3,186x faster than p-multigrid. The algorithms assume nothing specific to DFT and carry over to higher-order FE applications.


Thesis Canvas: pdf



Back to Doctoral Showcase Archive Listing