6 citations · 11 across the 5 of their papers we have counts for
6 papers
MG-GNN: Multigrid Graph Neural Networks for Learning Multilevel Domain Decomposition Methods
Ali Taghibakhshi, Nicolas Nytko, Tareq Uz Zaman +3
Domain decomposition methods (DDMs) are popular solvers for discretized systems of partial differential equations (PDEs), with one-level and multilevel variants. These solvers rely…
Generalizing Lloyd's algorithm for graph clustering
Tareq Zaman, Nicolas Nytko, Ali Taghibakhshi +3
Clustering is a commonplace problem in many areas of data science, with applications in biology and bioinformatics, understanding chemical structure, image segmentation, building r…
Generalizing Reduction-Based Algebraic Multigrid
Tareq Zaman, Nicolas Nytko, Ali Taghibakhshi +3
Algebraic Multigrid (AMG) methods are often robust and effective solvers for solving the large and sparse linear systems that arise from discretized PDEs and other problems, relyin…
Optimized Sparse Matrix Operations for Reverse Mode Automatic Differentiation
Nicolas Nytko, Ali Taghibakhshi, Tareq Uz Zaman +3
Sparse matrix representations are ubiquitous in computational science and machine learning, leading to significant reductions in compute time, in comparison to dense representation…
Learning Interface Conditions in Domain Decomposition Solvers
Ali Taghibakhshi, Nicolas Nytko, Tareq Zaman +3
Domain decomposition methods are widely used and effective in the approximation of solutions to partial differential equations. Yet the optimal construction of these methods requir…
Coarse-Grid Selection Using Simulated Annealing
Tareq. U. Zaman, Scott P. MacLachlan, Luke N. Olson +1
Multilevel techniques are efficient approaches for solving the large linear systems that arise from discretized partial differential equations and other problems. While geometric m…