Sparse

Towards a recursive graph bipartitioning algorithm for well balanced domain decomposition

Scheduling and memory optimizations for sparse direct solver on multi-core/multi-gpu duster systems

The ongoing hardware evolution exhibits an escalation in the number, as well as in the heterogeneity, of computing resources. The pressure to maintain reasonable levels of performance and portability forces application developers to leave the …

Etude de la factorisation directe hétŕogène et de la factorisation incomplt̀e sur solveur PaStiX appliqu'ś `d̀es syst`es̀ issus de probl`em ̀du CEA/CESTA

An improved recursive graph bipartitioning algorithm for well balanced domain decomposition

In the context of hybrid sparse linear solvers based on domain decomposition and Schur complement approaches, getting a domain decomposition tool leading to a good balancing of both the internal node set size and the interface node set size for all …

Distributed sparse matrix factorization on top of tasks based runtime systems

Toward parallel scalable linear solvers suited for large scale hierarchical parallel platforms

In this talk we will discuss the current and future research activities on the design of parallel scalable linear systems for large scale problems that range from dense linear algebra, to parallel sparse direct solver and hybrid iterative-direct …

An improved recursive graph bipartitioning algorithm for well balanced domain decomposition

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 accuracy and performance is less sensitive to the distribution of …

Fast direct linear solvers for the boundary element method

Nested Dissection with Balanced Halo