Research & software
Sparse linear algebra and parallel algorithms
My work connects sparse linear algebra and combinatorial algorithms to high-performance implementations and scientific applications.
01 / Sparse computation
Sparse matrices,
tensors, and solvers
At NVIDIA, I primarily work on our next-generation iterative solvers (cuISS), but I also frequently collaborate with cuDSS and cuSPARSE teams.
My broader research includes parallel sparse matrix multiplication, sparse matrix-vector multiplication, sparse tensors, distributed data structures, and communication-avoiding algorithms. A recurring goal is to reduce data movement while exposing parallelism across cores, GPUs, and distributed-memory systems.
These methods support scientific computing, graph analysis, and parallel algorithms for machine learning, including communication-efficient graph neural network training.
Related publications →