A fan-in algorithm for distributed sparse numerical factorization
SIAM Journal on Scientific and Statistical Computing
Task scheduling for parallel sparse Cholesky factorization
International Journal of Parallel Programming
Parallel algorithms for sparse linear systems
SIAM Review
A mapping algorithm for parallel sparse Cholesky factorization
SIAM Journal on Scientific Computing
An efficient block-oriented approach to parallel sparse Cholesky factorization
SIAM Journal on Scientific Computing
Modification of the minimum-degree algorithm by multiple elimination
ACM Transactions on Mathematical Software (TOMS)
SIAM Journal on Scientific Computing
An Approximate Minimum Degree Ordering Algorithm
SIAM Journal on Matrix Analysis and Applications
Highly Scalable Parallel Algorithms for Sparse Matrix Factorization
IEEE Transactions on Parallel and Distributed Systems
The Multifrontal Solution of Indefinite Sparse Symmetric Linear
ACM Transactions on Mathematical Software (TOMS)
Computer Solution of Large Sparse Positive Definite
Computer Solution of Large Sparse Positive Definite
Improved load distribution in parallel sparse cholesky factorization
Proceedings of the 1994 ACM/IEEE conference on Supercomputing
Sparse Matrix Ordering with SCOTCH
HPCN Europe '97 Proceedings of the International Conference and Exhibition on High-Performance Computing and Networking
Proceedings of the 11 IPPS/SPDP'99 Workshops Held in Conjunction with the 13th International Parallel Processing Symposium and 10th Symposium on Parallel and Distributed Processing
IPDPS '00 Proceedings of the 15 IPDPS 2000 Workshops on Parallel and Distributed Processing
A Mapping and Scheduling Algorithm for Parallel Sparse Fan-In Numerical Factorization
Euro-Par '99 Proceedings of the 5th International Euro-Par Conference on Parallel Processing
Sparse gaussian elimination on high-performance computers
Sparse gaussian elimination on high-performance computers
Adapting a parallel sparse direct solver to architectures with clusters of SMPs
Parallel Computing - Special issue: Parallel and distributed scientific and engineering computing
Parallel and fully recursive multifrontal sparse Cholesky
Future Generation Computer Systems - Special issue: Selected numerical algorithms
Hybrid scheduling for the parallel solution of linear systems
Parallel Computing - Parallel matrix algorithms and applications (PMAA'04)
Bézier surfaces and finite elements for MHD simulations
Journal of Computational Physics
Algorithm 887: CHOLMOD, Supernodal Sparse Cholesky Factorization and Update/Downdate
ACM Transactions on Mathematical Software (TOMS)
Dynamic Supernodes in Sparse Cholesky Update/Downdate and Triangular Solves
ACM Transactions on Mathematical Software (TOMS)
An all-speed relaxation scheme for interface flows with surface tension
Journal of Computational Physics
Partitioning and blocking issues for a parallel incomplete factorization
PARA'06 Proceedings of the 8th international conference on Applied parallel computing: state of the art in scientific computing
Reducing the I/O volume in an out-of-core sparse multifrontal solver
HiPC'07 Proceedings of the 14th international conference on High performance computing
Reducing the I/O Volume in Sparse Out-of-core Multifrontal Methods
SIAM Journal on Scientific Computing
Design of a Multicore Sparse Cholesky Factorization Using DAGs
SIAM Journal on Scientific Computing
PPAM'05 Proceedings of the 6th international conference on Parallel Processing and Applied Mathematics
Applying parallel direct solver techniques to build robust high performance preconditioners
PARA'04 Proceedings of the 7th international conference on Applied Parallel Computing: state of the Art in Scientific Computing
Advances in Data Analysis and Classification
Scalable domain decomposition preconditioners for heterogeneous elliptic problems
SC '13 Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis
Journal of Computational Physics
Amesos2 and Belos: Direct and iterative solvers for large sparse linear systems
Scientific Programming
| Hi-index | 0.02 |
Solving large sparse symmetric positive definite systems of linear equations is a crucial and time-consuming step, arising in many scientific and engineering applications. The block partitioning and scheduling problem for sparse parallel factorization without pivoting is considered. There are two major aims to this study: the scalability of the parallel solver, and the compromise between memory overhead and efficiency. Parallel experiments on a large collection of irregular industrial problems validate our approach.