Through the recent improvements toward exascale supercomputer systems, huge computations can be performed in reasonable times by using massively parallelized operations. …
Add the full text or supplementary notes for the publication here using Markdown formatting.
Add the full text or supplementary notes for the publication here using Markdown formatting.
Add the full text or supplementary notes for the publication here using Markdown formatting.
Add the full text or supplementary notes for the publication here using Markdown formatting.
Task-based programming models have been widely studied in the context of dense linear algebra, but remains less studied for the more complex sparse solvers. In this talk, we will …
In this talk, we adress the Block Low-Rank (BLR) clustering problem, to cluster unknowns within separators appearing during the factorization of sparse matrices. We show that …
Add the full text or supplementary notes for the publication here using Markdown formatting.
Solving sparse linear systems is a problem that arises in many scientific applications, and sparse direct solvers are a time consuming and key kernel for those applications and …
Add the full text or supplementary notes for the publication here using Markdown formatting.