PaStiX: A high-performance parallel direct solver for sparse symmetric positive definite systems

Parallel Computing

Volumn 28, Issue 2, 2002, Pages 301-321

  Henon P ^a   Ramet, P ^a   Roman, J ^a  

^a UNIVERSITÉ BORDEAUX 1   (France)

Author keywords

High performance computing; Parallel sparse Cholesky factorization; Static partitioning and scheduling

Indexed keywords

LINEAR EQUATIONS; MATRIX ALGEBRA; PROBLEM SOLVING; SCHEDULING;

SPARSE SYMMETRIC POSITIVE DEFINITE SYSTEMS;

PARALLEL PROCESSING SYSTEMS;

EID: 0036467470     PISSN: 01678191     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-8191(01)00141-7     Document Type: Article

References (34)

1. An approximate minimum degree ordering algorithm
2. Memory management issues in sparse multifrontal methods on multiprocessors
3. Multifrontal parallel distributed symmetric and unsymmetric solvers
4. Analysis, tuning and comparison of two general sparse solvers for distributed memory computers
5. The fan-both family of column-based distributed Cholesky factorization algorithms
6. A fan-in algorithm for distributed sparse numerical factorization
7. A compute-ahead fan-in scheme for parallel sparse matrix factorization
8. A comparison of three column based distributed sparse factorization schemes
9. Some stable methods for calculating inertia and solving symmetric linear systems
10. Algorithmique et calculs de complexité pour un solveur de type dissections embôtées
11. Multifrontal sparse solvers in message passing and data parallel environments - A comparative study
12. Sparse numerical linear algebra: Direct methods and preconditioning
13. The multifrontal solution of indefinite sparse symmetric linear equations
14. The multifrontal solution of unsymmetric sets of linear equations
15. Task scheduling for parallel sparse Cholesky factorization
16. Highly scalable parallel algorithms for sparse matrix factorization
17. Parallel algorithms for sparse linear systems
18. A mapping and scheduling algorithm for parallel sparse fan-in numerical factorization
19. PaSTiX: A parallel sparse direct solver based on a static scheduling for mixed 1D/2D block distributions
20. A scalable sparse direct solver using static pivoting
21. Modification of the minimum-degree algorithm by multiple elimination
22. Sparse matrix ordering with scotch
23. Hybridizing nested dissection and halo approximate minimum degree for efficient sparse matrix ordering
24. A mapping algorithm for parallel sparse Cholesky factorization
25. Performance of panel and block approaches to sparse Cholesky factorization on the iPSC/860 and Paragon multicomputers
26. An evaluation of left-looking, right-looking, and multifrontal approaches to sparse cholesky factorization on hierarchical-memory machines
27. An efficient block-oriented approach to parallel sparse Cholesky factorization
28. Improved load distribution in parallel sparse Cholesky factorization
29. Efficient sparse LU factorization with left-right looking strategy on shared memory multiprocessors