Maximum-weighted matching strategies and the application to symmetric indefinite systems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3732 LNCS, Issue , 2006, Pages 808-817

  Röllin, Stefan ^a   Schenk, Olaf ^b  

^a ETH ZURICH   (Switzerland)

^b UNIVERSITY OF BASEL   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

BLOCK CODES; COMPUTER SCIENCE; INFORMATION TECHNOLOGY; LINEAR SYSTEMS; MATRIX ALGEBRA; NUMERICAL ANALYSIS; PROBLEM SOLVING;

DIRECT LINEAR SOLVERS; MAXIMUM-WEIGHTED MATCHING STRATEGIES; NUMERICAL PREPROCESSING METHODS; SYMMETRIC MAXIMUM-WEIGHTED MATCHING STRATEGIES;

COMPUTATIONAL METHODS;

EID: 33745303963     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11558958_97     Document Type: Conference Paper

References (10)

1. M. Benzi, J.C. Haws, and M. Tuma. Preconditioning highly indefinite and nonsymmetric matrices. SIAM J. Scientific Computing, 22(4): 1333-1353, 2000.
2. E. D. Dolan and J.J. Moré. Benchmarking optimization software with performance profiles. Mathematical Programming, 91(2):201-213, 2002.
3. I. S. Duff. MA57 - a code for the solution of sparse symmetric definite and indefinite systems. ACM Transactions on Mathematical Software, 30(2): 118-144, June 2004.
4. I. S. Duff and J. R. Gilbert. Maximum-weighted matching and block pivoting for symmetric indefinite systems. In Abstract book of Householder Symposium XV, June 17-21, 2002.
5. I. S. Duff und J. Koster. On algorithms for permuting large entries to the diagonal of a sparse matrix. SIAM J. Matrix Analysis and Applications, 22(4):973-996, 2001.
6. I. S. Duff and S. Pralet. Strategies for scaling and pivoting for sparse symmetric indefinite problems. Technical Report TR/PA/04/59, CERFACS, Toulouse, France, 2004.
7. Nicholas I. M. Gould and Jennifer A. Scott. A numerical evaluation of HSL packages for the direct solution of large sparse, symmetric linear systems of equations. ACM Transactions on Mathematical Software, 30(3):300 - 325, September 2004
8. A. Gupta and L. Ying. On algorithms for finding maximum matchings in bipartite graphs. Technical Report RC 21576 (97320), IBM T. J. Watson Research Center, Yorktown Heights, NY, October 25, 1999.
9. G. Karypis and V. Kumar, A fast and high quality multilevel scheme for partitioning Irregular graphs. SIAM J. Scientific Computing, 20(1):359-392, 1998.
10. O. Schenk and K. Gärtner. On fast factorization pivoting methods for sparse symmetric indefinite systems. Technical Report CS-2004-004, Department of Computer Science, University of Basel, 2004. Submitted.