| Date | Speaker | Topic |
|---|---|---|
| M Jan. 19 | Martin Luther King Day | |
| M Jan. 26 | No seminar | |
| M Feb. 2 | Hari Sundar (Tufts) | Title: Scalable Graph Partitioning for Adaptive Mesh Refinement Abstract: Mesh partitioning is critical for scalable distributed PDE solvers. Traditional methods like spatial ordering and multi-level graph partitioning have significant tradeoffs between partition quality and parallel scalability. We present AMRaCut, a distributed-parallel mesh partitioner that bridges this gap using parallel label propagation and graph diffusion. It operates mostly locally on initial partitions, limiting inter-process communications to neighboring processes. This locality is especially effective in AMR, where mesh evolves dynamically with mostly local changes. AMRaCut achieves 5-10x speedups over multi-level partitioners (ParMETIS, PT-Scotch) while producing partitions of comparable quality and minimized boundaries. Its efficiency is comparable to sorting-based methods like space-filling curves. AMRaCut maintains maximum partition load within 2x of optimal, sufficient for distributed scalability. We verify that AMRaCut is effective in downstream tasks by evaluating a Finite Element Model SpMV operation. Despite the 2x imbalance, AMRaCut partitions perform on par with parMETIS/PT-Scotch partitions, outperforming spatially ordered partitions. |
| M Feb. 9 | Saeed Mehraban (Tufts) | Title: Quantum computational complexity over continuous variables Abstract: While the standard theory of quantum computing is formulated using discrete variable degrees of freedom such as electron spins, or the polarization of light, many degrees of freedom, such as electromagnetic amplitudes, or position and momentum of a particle, are described using continuous variables in infinite-dimensional Hilbert spaces. In recent years, quantum computing involving physical systems with continuous degrees of freedom has attracted significant interest. However, a well-defined quantum complexity theory for these bosonic computations over infinite-dimensional Hilbert spaces is missing. In this presentation I will explain challenges and opportunities in defining a theory of quantum complexity over continuous degrees of freedom. |
| Th Feb. 19 | ||
| M Feb. 23 | Matthias Chung (Emory) | |
| M Mar. 2 | Yahong Yang (Georgia Tech) | |
| M Mar. 9 | Lucas Onisk (Emory) | |
| M Mar. 16 | Spring Break | |
| M Mar. 23 | Keaton Hamm | |
| M Mar. 30 | Christopher Criscitiello (UPenn) | |
| M Apr. 6 | Chris Vales (Dartmouth) | |
| M Apr. 13 | HanQin Cai (UCF) | |
| M Apr. 20 | Patriots’ Day | |
| M Apr. 27 | Abhijit Chowdhary (Tufts) |