Preconditioners based on strong subgraphs

Electronic Transactions on Numerical Analysis

Volumn 40, Issue , 2013, Pages 225-248

  Duff, Iain S ^a,b   Kaya, Kamer ^b,c  

^a CERFACS   (France)

^b RAL   (United Kingdom)

^c OHIO STATE UNIVERSITY   (United States)

Author keywords

Preconditioners; Sparse matrices; Strong components; Strong subgraphs

Indexed keywords

ITERATIVE METHODS; LINEAR SYSTEMS; MATRIX ALGEBRA;

BLOCK DIAGONAL; BLOCK-DIAGONAL PRECONDITIONER; ITERATION COUNT; NONSINGULAR; PRECONDITIONERS; SPARSE MATRICES; STRONG COMPONENTS; SUBGRAPHS;

GRAPH THEORY;

EID: 84897013530     PISSN: None     EISSN: 10689613     Source Type: Journal    
DOI: None     Document Type: Article

References (27)

1. P. AMESTOY, T. A. DAVIS, AND I. S. DUFF, Algorithm 837: AMD, An approximate minimum degree ordering algorithm, ACM Trans. Math. Software, 30 (2004), pp. 381-388.
2. R. BARRETT, M. BERRY, T. F. CHAN, J. DEMMEL, J. DONATO, J. DONGARRA, V. EIJKHOUT, R. POZO, C. ROMINE, AND H. V. DER VORST, Templates for the Solution of Linear Systems: Building Blocks for Iterative Methods, 2nd ed., SIAM, Philadelphia, 1994.
3. M. BENZI, H. CHOI, AND D. B. SZYLD, Threshold ordering for preconditioning nonsymmetric problems, in Proceedings of the Workshop on Scientific Computing ?97-Hong Kong, G. Golub, S. Lui, F. Luk, and R. Plemmons, eds., Springer, Singapore, 1997, pp. 159-165.
4. M. BENZI, J. C. HAWS, AND M. TŮMA, Preconditioning highly indefinite and nonsymmetric matrices, SIAM J. Sci. Comput., 22 (2000), pp. 1333-1353.
5. H. CHOI AND D. B. SZYLD, Application of threshold partitioning of sparse matrices to Markov chains, in Proceedings of the IEEE International Computer Performance and Dependability Symposium, IPDS?96, Urbana-Champaign, Illinois, September 4-6, 1996, IEEE Computer Society Press, Los Alamitos, CA, 1996, pp. 158-165.
6. E. CUTHILL AND J. MCKEE, Reducing the bandwidth of sparse symmetric matrices, in ACM Procedings of the 24th National Conference, ACM, New York, 1969, pp. 157-172.
7. T. A. DAVIS, Direct Methods for Sparse Linear Systems, SIAM, Philadelphia, 2006.
8. T. A. DAVIS AND Y. HU, The University of Florida sparse matrix collection, ACM Trans. Math. Software, 38 (2011), Art. 1 (25 pages).
9. T. A. DAVIS AND E. P. NATARAJAN, Algorithm 907: KLU, A direct sparse solver for circuit simulation problems, ACM Trans. Math. Software, 37 (2010), Art. 36 (17 pages).
10. T. DAYAR AND W. J. STEWART, Comparison of partitioning techniques for two-level iterative solvers on large, sparse markov chains, SIAM J. Sci. Comput., 21 (2000), pp. 1691-1705.
11. I. S. DUFF AND J. KOSTER, On algorithms for permuting large entries to the diagonal of a sparse matrix, SIAM J. Matrix Anal. Appl., 22 (2001), pp. 973-996.
12. I. S. DUFF AND J. K. REID, An implementation of Tarjan's algorithm for the block triangularization of a matrix, ACM Trans. Math. Software, 4 (1978), pp. 137-147.
13. - Algorithm 529: Permutations to block triangular form [F1], ACM Trans. Math. Software, 4 (1978), pp. 189-192.
14. D. FRITZSCHE, Overlapping and Nonoverlapping Orderings for Preconditioning, PhD Thesis, Dept. ofMathematics, Temple University, Philadelphia, 2010.
15. D. FRITZSCHE, A. FROMMER, AND D. B. SZYLD, Extensions of certain graph-based algorithms for preconditioning, SIAM J. Sci. Comput., 29 (2007), pp. 2144-2161.
16. M. R. GAREY AND D. S. JOHNSON, Computers and Intractability: A Guide to the Theory of NPCompleteness, W. H. Freeman, San Francisco, 1979.
17. F. GAVRIL, Some NP-complete problems on graphs, in Proceedings of the 11th Conference on Information Sciences and Systems, Johns Hopkins University, Baltimore, 1977, pp. 91-95.
18. A. GEORGE, Computer implementation of the finite-element method, PhD Thesis, Department of Computer Science, University of Ilinois at Urbana-Champaign, Urbana-Champaign, IL, 1971.
19. HSL, HSL 2011: A collection of Fortran codes for large scale scientific computation, 2011. http://www.hsl.rl.ac.uk.
20. M. OLSCHOWKA AND A. NEUMAIER, A new pivoting strategy for Gaussian elimination, Linear Algebra Appl., 240 (1996), pp. 131-151.
21. Y. SAAD, ILUT: A dual threshold incomplete ILU factorization, Numer. Linear Algebra Appl., 1 (1994), pp. 387-402.
22. - Iterative Methods for Sparse Linear Systems, 2nd ed., SIAM, Philadelphia, 2003.
23. Y. SAAD AND M. H. SCHULTZ, GMRES: A generalized minimal residual algorithm for solving nonsymmetric linear systems, SIAM J. Sci. Statist. Comput., 7 (1986), pp. 856-869.
24. R. E. TARJAN, Depth-first search and linear graph algorithms, SIAM J. Comput., 1 (1972), pp. 146-160.
25. - A hierarchical clustering algorithm using strong components, Inform. Process. Lett., 14 (1982), pp. 26-29.
26. - An improved algorithm for hierarchical clustering using strong components, Inform. Process. Lett., 17 (1983), pp. 37-41.
27. H. THORNQUIST, E. R. KEITER, R. J. HOEKSTRA, D. M. DAY, AND E. G. BOMAN, A parallel preconditioning strategy for efficient transistor-level circuit simulation, in Proceedings of the 2009 International Conference on Computer-Aided Design (ICCAD?09), ACM, New York, 2009, pp. 410-417.