On finding approximate supernodes for an efficient ILU(k) factorization
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.
The purpose of this work is to provide a method which exploits the parallel block-wise algorithmic approach used in the framework of high performance sparse direct solvers in order …
Since the last decade, most of the supercomputer architectures are based on cluster of SMP nodes. In those architectures the exchanges between processors are made through shared …
Add the full text or supplementary notes for the publication here using Markdown formatting.
In this paper, we consider a hyperbolic system with multiple time step characteristics. Such a situation arises for example in combustion problems when the acoustic time is small …
Solving large sparse linear systems by iterative methods has often been quite unsatisfactory when dealing with pratical \"industrial\" problems. The main difficulty encountered by …
The purpose of our work is to provide a method which exploits the parallel blockwise algorithmic approach used in the framework of high performance sparse direct solvers in order …
PaStiX is a scientific library that provides a high performance direct supernodal solver for very large sparse linear systems. It relies on a block factorization based on an …
Add the full text or supplementary notes for the publication here using Markdown formatting.