This document describes a software package which implements a parallel hybrid (direct/iterative) linear solver based on the Schur complement method for solving a general sparse linear system of equations. The package is named parallel domain decomposition Schur complement based linear solver, or PDSLin in short. We give a brief description of the algorithm, installation, calling sequences, and data structures of PDSLin. Email: ic.yamazaki@gmail.com Email: {xsli, egng}@lbl.gov This research was supported in part by the Director, Office of Science, Office of Advanced Scientific Computing Research, of the U.S. DOE under Contract No. DE-AC02-05CH11231. This document was prepared as an account of work sponsored by the United States Government. While this document is believed to contain correct information, neither the United States Government nor any agency thereof, nor the Regents of the University of California, nor any of their employees, makes any warranty, express or implied, or assumes any legal responsibility for the accuracy, completeness, or usefulness of any information, apparatus, product, or process disclosed, or represents that its use would not infringe privately owned rights. Reference herein to any specific commercial product, process, or service by its trade name, trademark, manufacturer, or otherwise, does not necessarily constitute or imply its endorsement, recommendation, or favoring by the United States Government or any agency thereof, or the Regents of the University of California. The views and opinions of authors expressed herein do not necessarily state or reflect those of the United States Government or any agency thereof or the Regents of the University of California.
[1]
Xiaoye S. Li,et al.
On techniques to improve robustness and scalability of the Schur complement method
,
2010
.
[2]
William Gropp,et al.
Efficient Management of Parallelism in Object-Oriented Numerical Software Libraries
,
1997,
SciTools.
[3]
Yousef Saad,et al.
A Flexible Inner-Outer Preconditioned GMRES Algorithm
,
1993,
SIAM J. Sci. Comput..
[4]
Vipin Kumar,et al.
A Parallel Algorithm for Multilevel Graph Partitioning and Sparse Matrix Ordering
,
1998,
J. Parallel Distributed Comput..
[5]
Xiaoye S. Li,et al.
SuperLU Users'' Guide
,
1997
.
[6]
James Demmel,et al.
SuperLU_DIST: A scalable distributed-memory sparse direct solver for unsymmetric linear systems
,
2003,
TOMS.
[7]
Barry Smith,et al.
PETSc (Portable, Extensible Toolkit for Scientific Computation)
,
2011,
Encyclopedia of Parallel Computing.
[8]
Iain S. Duff,et al.
The Design and Use of Algorithms for Permuting Large Entries to the Diagonal of Sparse Matrices
,
1999,
SIAM J. Matrix Anal. Appl..
[9]
James Demmel,et al.
A Supernodal Approach to Sparse Partial Pivoting
,
1999,
SIAM J. Matrix Anal. Appl..
[10]
Vivek Sarin,et al.
Domain Decomposition
,
2011,
Encyclopedia of Parallel Computing.
[11]
Yousef Saad,et al.
Iterative methods for sparse linear systems
,
2003
.