![]() |
![]() |

![]() | ![]() |
Solving large sparse symmetric positive definite systems Ax=b of linear equations is a crucial and time-consuming step, arising in many scientific and engineering applications.
This work is a research scope of the new INRIA project (UR Futurs).
PaStiX is a scientific library that provides a high performance solver for very large sparse linear systems based on direct and ILU(k) iterative methods.
Many factorization algorithms are implemented with simple or double precision (real or complex): LLt (Cholesky), LDLt (Crout) and LU with static pivoting (for non symetric matrices but with symetric structures).
The library PaStiX uses the graph partitioning and sparse matrix block ordering package SCOTCH.
PaStiX is based on efficient static scheduling and memory management to solve problems with more than 10 millions unknowns.
An available version of PaStiX is currently developped.
PaStiX uses the standard BLAS, LAPACK, and MPI library calls for its functionality. Tuned versions of these libraries are recommended to get good performance out of PaStiX. Public domain vanilla implementations of BLAS and LAPACK routines are available on the web. A public domain implementation of MPI standard is available at MPICH site .
