Preconditioning Schur complement systems of highly-indefinite linear systems for a parallel hybrid solver

Numerical Mathematics

Volumn 3, Issue 3, 2010, Pages 352-366

  Yamazaki, I ^a   Li, X S ^a   Ng, E G ^a  

^a LAWRENCE BERKELEY NATIONAL LABORATORY   (United States)

Author keywords

Matrix preprocessing; Preconditioning; Schur complement method

Indexed keywords

EID: 80052217003     PISSN: 10048979     EISSN: 20797338     Source Type: Journal    
DOI: 10.4208/nmtma.2010.33.5     Document Type: Article

References (20)

1. Center for Extended MHD Modeling (CEMM). http://w3.pppl.gov/cemm/.
2. Community Petascale Project for Accelerator Science and Simulation (ComPASS). https://compass.fnal.gov.
3. M. Benzi, J. Haws, and M. Tuma. Preconditioning highly indefinite and nonsymmetric matrices. SIAMJ. Sci. Comput, 22(4):1333-1353, 2000.
4. C. Chevalier and F. Pellegrini. PT-Scotch. Parallel Computing, 34(6-8):318-331, 2008.
5. I. Duff. Developments in matching and scaling algorithms. In 6th international congress on industrial and applied mathematics, 2007.
6. I. Duff and J. Koster. The design and use of algorithms for permuting large entries to the diagonal of sparse matrices. SIAMJ. Matrix Anal. Appl, 20(4):889-901, 1999. (Pubitemid 129330049)
7. J. Gaidamour and P. Hènon. HIPS: a parallel hybrid direct/iterative solver based on a schur complement. In Proc. PMAA, 2008.
8. L. Giraud, A. Haidar, and L. T. Watson. Parallel scalability study of hybrid preconditioners in three dimensions. Parallel Computing, 34:363-379, 2008.
9. M. Halappanavar, F. Bobrian, and A. Pothen. A parallel half-approximation algorithm for the weighted matching problem. In SIAM conference on Computational Science and Engineering, 2009.
10. P. Hènon and Y. Saad. A parallel multilevel ilu factorization based on a hierarchical graph decomposition. SIAMJ. Sci. Comput, 28(6):2266-2293, 2006. (Pubitemid 350150413)
11. Karypis Lab, Digital Technology Center, Department of Computer Science and Engineering, University of Minesota. METIS - Serial Graph Partitioning and Fill-reducing Matrix Ordering. http://glaros.dtc.umn.edu/gkhome/metis/metis.
12. Karypis Lab, Digital Technology Center, Department of Computer Science and Engineering, University of Minesota. ParMETIS - Parallel Graph Partitioning and Fill-reducing Matrix Ordering. http://glaros.dtc.umn.edu/gkhome/metis/ parmetis/overview.
13. Laboratoire Bordelais de Recherche en Informatique (LaBRI). SCOTCH - Software package and libraries for graph, mesh and hypergraph partitioning, static mapping, and parallel and sequential sparse matrix block ordering. http://www.labri.fr/perso/pelegrin/scotch/.
14. L-Q. Lee, Z. Li, C.-K. Ng, and K. Ko. Omega3P: A parallel finite-element eigenmode analysis code for accelerator cavities. Technical Report SLAC-PUB-13529, Stanford Linear Accelerator Center, 2009.
15. X. Li and J. Demmel. SuperLU-DIST: A scalable distributed-memory sparse direct solver for unsymmetric linear systems. ACM Trans. Mathematical Software, 29(2):110-140, 2003. (Pubitemid 40001447)
16. Mathematics and Computer Science Division, Argonne National Laboratory. The portable, extensible, toolkit for scientific computation (PETSc). www.mcs.anl.gov/petsc.
17. M. Olschowka and A. Neumaier. A new pivoting strategy for gaussian elimination. Linear Algebra Appl., 240:131-151, 1996. (Pubitemid 126362926)
18. J. Riedy. Auctions for distributed (and possibly parallel) matchings. In CERFACS algorithm team meeting, 2008.
19. Y. Saad. SPARSKIT: A basic tool kit for sparse matrix computations. Technical Report RIACS-90-20, Research Institute for Advanced Computer Science, 1990.
20. B. Smith, P. Bjorstad, and W. Gropp. Domain Decomposition. Parallel Multilevel Methods for Elliptic Partial Differential Equations. Cambridge University Press, New York, 1996.