Sparse

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

In the context of solving sparse linear systems, an ordering process partitions the matrix graph to minimize both fill-in and computational cost. We found that the ordering strategy used within supernodes might be enhanced to reduce the number of …

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.

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 …

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

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 …

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

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 …

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