3 citations · 7 across the 4 of their papers we have counts for
4 papers · 1 filter
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…
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…
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…
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…