Thomas Grützmacher

An alternative would also be to not just use 1D Block index, but 2D (with the 2nd dimension only used when we exceed the limit for `blockDim.x`). However, that would...

I think it would be better if we had a kernel call to `make_srow` and call the kernel that matches the executor where the matrix is stored. Just using `make_srow`...

@fritzgoebel All dependencies for this PR are merged. Can you rebase it, so we can properly review it?

Hello @klausbu, thank you for your interest in Ginkgo. 1. The fastest way to import a linear System or a matrix in general in Ginkgo is with `Array::view`. You can...

> ABS() means in this context to convert negative vector elements into positive ones We are currently working on a `get_absolute()` implementation that computes the absolute of each vector. That...

In general, we are currently discussing on how to improve our tutorials and wiki-page, so newcomers have an easy to follow path learning about the Ginkgo interface and capabilities.

@klausbu All currently usable solvers can be found here: https://ginkgo-project.github.io/ginkgo/doc/develop/group__solvers.html We do not have a MPI implementation of Ginkgo, we focus on node level parallelism (using the CPU and GPU...

I just added that (Issue #639). @tcojean is actually currently exploring this possibility. However, it is possible that it does not improve performance over a single GPU because pretty much...

I fully agree, I also dislike the copy semantic that the current `gko::range` has. My plan was to deprecate the whole `gko::range` and everything in the namespace `gko::accessor` and replace...

I definitively volunteer to do this, but it might take a couple of months until I am ready to do it.