research
∙
07/21/2022
Communication Lower Bounds and Optimal Algorithms for Multiple Tensor-Times-Matrix Computation
Multiple Tensor-Times-Matrix (Multi-TTM) is a key computation in algorit...
share
research
∙
05/26/2022
Tight Memory-Independent Parallel Matrix Multiplication Communication Lower Bounds
Communication lower bounds have long been established for matrix multipl...
research
∙
01/06/2022
Efficient Algebraic Two-Level Schwarz Preconditioner For Sparse Matrices
Domain decomposition methods are among the most efficient for solving sp...
research
∙
10/08/2021
Randomized algorithms for rounding in the Tensor-Train format
The Tensor-Train (TT) format is a highly compact low-rank representation...
research
∙
09/13/2021
A Robust Algebraic Multilevel Domain Decomposition Preconditioner For Sparse Symmetric Positive Definite Matrices
Domain decomposition (DD) methods are widely used as preconditioner tech...
research
∙
07/19/2021
A Robust Algebraic Domain Decomposition Preconditioner for Sparse Normal Equations
Solving the normal equations corresponding to large sparse linear least-...
research
∙
01/28/2021
Two-level Nyström–Schur preconditioner for sparse symmetric positive definite matrices
Randomized methods are becoming increasingly popular in numerical linear...
research
∙
11/12/2020
Parallel Algorithms for Tensor Train Arithmetic
We present efficient and scalable parallel algorithms for performing mat...
research
∙
03/12/2020