Support-graph preconditioners

SIAM Journal on Matrix Analysis and Applications

Volumn 27, Issue 4, 2006, Pages 930-951

  Bern, Marshall ^a   Gilbert, John R ^b   Hendrickson, Bruce ^c   Nguyen, Nhat ^d   Toledo, Sivan ^e  

^a PALO ALTO RESEARCH CENTER   (United States)

^b University of California   (United States)

^c SANDIA NATIONAL LABORATORIES   (United States)

^d RAYTHEON COMPANY   (United States)

^e TEL AVIV UNIVERSITY   (Israel)

Author keywords

Combinatorial preconditioners; Modified incomplete factorizations; Support preconditioners; Support theory; Supporttree preconditioners

Indexed keywords

COMBINATORIAL PRECONDITIONERS; MODIFIED INCOMPLETE FACTORIZATIONS; SUPPORT PRECONDITIONERS; SUPPORT THEORY; SUPPORT TREE PRECONDITIONERS;

COMBINATORIAL MATHEMATICS; COMPUTATION THEORY; MATRIX ALGEBRA;

GRAPH THEORY;

EID: 33750170652     PISSN: 08954798     EISSN: 10957162     Source Type: Journal    
DOI: 10.1137/S0895479801384019     Document Type: Conference Paper

References (20)

1. O. AXELSSON, Iterative Solution Methods, Cambridge University Press, Cambridge, UK, 1994.
2. R. BEAUWENS, Upper eigenvalue bounds for pencils of matrices, Linear Algebra Appl., 62 (1984), pp. 87-104.
3. R. BEAUWENS, Approximate factorizations with modified S/P consistently ordered M-factors, Numer. Linear Algebra Appl., 1 (1994), pp. 3-17.
4. E. G. BOMAN, D. CHEN, B. HENDRICKSON, AND S. TOLEDO, Maximum-weight-basis preconditioners, Numer. Linear Algebra Appl., 11 (2004), pp. 695-721.
5. E. G. BOMAN AND B. HENDRICKSON, Support theory for preconditioning, SIAM J. Matrix Anal. Appl., 25 (2003), pp. 694-717.
6. D. CHEN AND S. TOLEDO, Vaidya's preconditioners: Implementation and experimental study, Electron. Trans. Numer. Anal., 16 (2003), pp. 30-49.
7. T. H. CORMEN, C. E. LEISERSON, AND R. L. RIVEST, Introduction to Algorithms, MIT Press, Cambridge, MA, 1989.
8. U. ELSNER, Graph Partitioning: A Survey, Technical report SPB393/97-27, Technische Universität Chemnitz, Chemnitz, Germany, 1997.
9. K. D. GREMBAN, G. L. MILLER, AND M. ZAGHA, Performance evaluation of a new parallel preconditioner in Proceedings of the 9th International Parallel Processing Symposium, Santa Barbara, CA, 1995, IEEE, Computer Society Press, Los Alamitos, CA, 1995, pp. 65-69.
10. K. D. GREMBAN, Combinatorial Preconditioners for Sparse, Symmetric, Diagonally Dominant Linear Systems, Ph.D. thesis, Carnegie Mellon University, Pittsburgh, PA., 1996.
11. S. GUATTERY, Graph Embedding Techniques for Bounding Condition Numbers of Incomplete Factor Preconditioners, Technical report ICASE 97-47, NASA Langley Research Center, Hampton, VA, 1997.
12. I. GUSTAFSSON, A class of first-order factorization methods, BIT, 18 (1978), pp. 142-156.
13. V. E. HOWLE AND S. A. VAVASIS, An iterative method for solving complex-symmetric systems arising in electrical power modeling, SIAM J. Matrix Anal. Appl., 26 (2005), pp. 1150-1178.
14. B. M. MAGGS, G. L. MILLER, O. PAREKH, R. RAVI, AND S. LEUNG MAVERICK WOO, Finding effective support-tree preconditioners, in Proceedings of the 17th ACM Symposium on Parallel Algorithms and Architectures, Las Vegas, NV, 2005.
15. Y. NOTAY, Solving positive (semi)definite linear systems by preconditioned iterative methods, in Preconditioned Conjugate Gradient Methods, Lecture Notes in Math. 1457, Springer-Verlag, New York, 1990, pp. 105-125.
16. Y. NOTAY, Conditioning analysis of modified block incomplete factorizations, Linear Algebra Appl., 154-156 (1991), pp. 711-722.
17. Y. NOTAY, Conditioning of Stieltjes matrices by S/P consistently ordered approximate factorizations, Appl. Numer. Math., 10 (1992), pp. 381-396.
18. J. H. REIF, Efficient approximate solution of sparse linear systems, Comput. Math. Appl., 36 (1998), pp. 37-58 (see also an errata in 38 (1999), p. 141).
19. 1.31), in Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science, Washington, DC, 2003, pp. 416-427.
20. P. M. VAIDYA, Solving Linear Equations with Symmetric Diagonally Dominant Matrices by Constructing Good Preconditioners, manuscript, 1991.