Sparse direct solvers play a vital role in large-scale high performance scientific and engineering computations. Existing distributed sparse direct methods employ the multifrontal/supernodal patterns to aggregate columns of near-identical forms and to exploit dense basic linear algebra subprograms (BLAS) for computation. However, such data layout may bring more unevenness when the structure of the input matrix is not ideal, and using dense BLAS may waste many floating point operations on zero fill-ins, accordingly. We in this paper propose a new sparse direct solver called PanguLU. Unlike the multifrontal/supernodal layout, our work relies on simpler regular 2D blocking and stores the blocks in their sparse forms to avoid any extra fill-i...
Many large scale scientific simulations involve the time evolution of systems modelled as Partial Di...
International audienceIn this talk we will discuss our research activities on the design of parallel...
International audienceAmong the preprocessing steps of a sparse direct solver, reordering and block ...
Sparse direct solvers play a vital role in large-scale high performance scientific and engineering c...
In this paper, we present the main algorithmic features in the software package SuperLU{_}DIST, a di...
International audienceIn the context of solving sparse linear systems, an ordering process partition...
In this paper, we present the main algorithmic features in the software package SuperLU_DIST, a dis...
It is important to have a fast, robust and scalable algorithm to solve a sparse linear system AX=B. ...
The original publication is available at www.springerlink.comInternational audienceA wide class of g...
International audienceIn this talk, we describe a preliminary fast direct solver using HODLR library...
TOPS is providing high-performance, scalable sparse direct solvers, which have had significant impac...
In this paper, we present the main algorithmic features in the software package SuperLU DIST, a dis...
International audienceDirect methods for the solution of sparse systems of linear equations of the f...
This paper provides a comprehensive study and comparison of two state-of-the-art direct solvers for ...
Parallel computing a b s t r a c t A block tridiagonal matrix is factored with minimal fill-in using...
Many large scale scientific simulations involve the time evolution of systems modelled as Partial Di...
International audienceIn this talk we will discuss our research activities on the design of parallel...
International audienceAmong the preprocessing steps of a sparse direct solver, reordering and block ...
Sparse direct solvers play a vital role in large-scale high performance scientific and engineering c...
In this paper, we present the main algorithmic features in the software package SuperLU{_}DIST, a di...
International audienceIn the context of solving sparse linear systems, an ordering process partition...
In this paper, we present the main algorithmic features in the software package SuperLU_DIST, a dis...
It is important to have a fast, robust and scalable algorithm to solve a sparse linear system AX=B. ...
The original publication is available at www.springerlink.comInternational audienceA wide class of g...
International audienceIn this talk, we describe a preliminary fast direct solver using HODLR library...
TOPS is providing high-performance, scalable sparse direct solvers, which have had significant impac...
In this paper, we present the main algorithmic features in the software package SuperLU DIST, a dis...
International audienceDirect methods for the solution of sparse systems of linear equations of the f...
This paper provides a comprehensive study and comparison of two state-of-the-art direct solvers for ...
Parallel computing a b s t r a c t A block tridiagonal matrix is factored with minimal fill-in using...
Many large scale scientific simulations involve the time evolution of systems modelled as Partial Di...
International audienceIn this talk we will discuss our research activities on the design of parallel...
International audienceAmong the preprocessing steps of a sparse direct solver, reordering and block ...