Tobias Ribizel
Tobias Ribizel
This adds a dockerfile that can be used to build all of Ginkgo, including a few development tools. My long-term goal is to keep an updated version of this container...
I just accidentally built a `.mtx` with 0-based indices, which caused the application to crash. I think we might be able to catch this kind of issue earlier without performance...
Logger has a polymorphic_object_create_started/completed event, but it only works based on `PolymorphicObject::create_default`, not any other functions like the one provided by `EnableCreateMethod`. To change this, we could add another overload...
We need an SpGEMM algorithm that stores some lookup information and can recompute the matrix product with updated values, but fixed sparsity pattern. The easiest approach would probably be to...
We need a way to update the transpose of a matrix with new values, but fixed sparsity pattern. Under the hood, this is nothing but a permutation on the values,...
We need a way to update solvers and preconditioners carrying state beyond just the system matrix (like triangular solvers, ILU(T) etc.) with changed values, but fixed sparsity pattern. ### Design...
We need a way to allow updating values in a format-agnostic way to enable updating `distributed::Matrix` entries independent of the internally used formats. I have two approaches in mind: 1....
We already have our own triangular solver kernels, extending them to a Gauß-Seidel kernel should be straightforward.
Our current supervariable agglomeration employed in BlockJacobi is sequential and very naive. I think we could significantly improve upon them by using some simple parallel heuristics. We could precompute the...
Probably based on the naive CUDA fallback kernel for triangular solves and relaxed atomics, we can build a triangular solver and factorization algorithm for DPC++.