activity
20182020
most citedApproximate multiplication of nearly sparse matrices with decay in a fully recursive distributed task-based parallel framework

3 citations · 7 across the 4 of their papers we have counts for

collaborators

5 papers

cs.DC2020

The Chunks and Tasks Matrix Library 2.0

Emanuel H. Rubensson, Elias Rudberg, Anastasia Kruchinina +1

We present a C++ header-only parallel sparse matrix library, based on sparse quadtree representation of matrices using the Chunks and Tasks programming model. The library implement…

math.NA2020★ 2 cited

Sparse approximate matrix-matrix multiplication for density matrix purification with error control

Anton G. Artemov, Emanuel H. Rubensson

We propose a method for strict error control in sparse approximate matrix-matrix multiplication. The method combines an error bound and a parameter sweep to select an appropriate t…

math.NA2019★ 3 cited

Approximate multiplication of nearly sparse matrices with decay in a fully recursive distributed task-based parallel framework

Anton G. Artemov

In this paper we consider parallel implementations of approximate multiplication of large matrices with exponential decay of elements. Such matrices arise in computations related t…

math.NA2019★ 2 cited

Parallelization and scalability analysis of inverse factorization using the Chunks and Tasks programming model

Anton G. Artemov, Elias Rudberg, Emanuel H. Rubensson

We present three methods for distributed memory parallel inverse factorization of block-sparse Hermitian positive definite matrices. The three methods are a recursive variant of th…

math.NA2018

Localized inverse factorization

Emanuel H. Rubensson, Anton G. Artemov, Anastasia Kruchinina +1

We propose a localized divide and conquer algorithm for inverse factorization of Hermitian positive definite matrices with localized structure, e.g. exponential…