Paper-Conference

Fast Algorithms for Dense Linear Algebra

In recent years there has been a resurgence in direct methods to solve linear systems. These methods can have many advantages compared to iterative solvers; in particular their …

c.-dudley

Taking advantage of hybrid systems for sparse direct solvers via task-based runtimes

The ongoing hardware evolution exhibits an es- calation in the number, as well as in the heterogeneity, of computing resources. The pressure to maintain reasonable levels of …

x.-lacoste

Shared Memory Parallelism for 3D Cartesian Discrete Ordinates Solver

Add the full text or supplementary notes for the publication here using Markdown formatting.

s.-moustafa

Towards Domain Decomposition with Balanced Halo

Add the full text or supplementary notes for the publication here using Markdown formatting.

a.-casadei

From hybrid architectures to hybrid solvers

Add the full text or supplementary notes for the publication here using Markdown formatting.

p.-ramet

Work stealing and granularity optimizations for a sparse solver on manycores

Add the full text or supplementary notes for the publication here using Markdown formatting.

x.-lacoste

Augmentation and Deflation in Krylov subspace methods

Add the full text or supplementary notes for the publication here using Markdown formatting.

o.-coulaud

Sparse Linear Algebra over DAG Runtimes

Add the full text or supplementary notes for the publication here using Markdown formatting.

x.-lacoste

Toward a supernodal sparse direct solver over DAG runtimes

The current trend in the high performance computing shows a dramatic increase in the number of cores on the shared memory compute nodes. Algorithms, especially those related to …

g.-bosilca

Sparse direct solver on top of large-scale multicore systems with GPU accelerators

Add the full text or supplementary notes for the publication here using Markdown formatting.

x.-lacoste