Overview:

Tensors provide a powerful abstraction for expressing algorithms on sparse or dense datasets in their natural variety. Graph algorithms such as betweenness centrality, FFT and bitonic sort, can be succinctly written as tensor operations over a suitable algebraic structure. Solomonik will introduce communication and synchronization cost lower bonds for a general class of tensor algorithms, including sparse iterative methods and matrix factorizations.

Furthermore, Solomonik will present parallel algorithms that achieve minimal cost with respect to these bounds and obtain improved scalability on supercomputers. Additionally, Solomonik will describe new innovations in handling symmetry and sparsity in tensors. Some of the proposed algorithms are deployed in a massively-parallel tensor framework, whose development has been driven by applications in quantum chemistry. Solomonik will show the performance of the framework for algorithmic benchmarks as well as for coupled cluster methods, which model electronic correlation by solving tensor equations.

Bio:

Edgar Solomonik is a postdoctoral fellow at ETH, Zurich working in the field of parallel numerical algorithms.  His research introduced more communication-efficient algorithms for numerical linear algebra and his software for tensor computations has been widely adopted in the field of electronic structure calculations.  He obtained his bachelor's from the University of Illinois, Urbana-Champaign and his Ph.D. from the University of California, Berkeley, both in computer science.  He was the recipient of the U.S. Department of Energy's Computational Science Graduate Fellowship, the David J. Sakrison Memorial Prize, and the ACM-IEEE George Michael HPC Fellowship.