Combinatorial preconditioners for scalar elliptic finite-element problems

SIAM Journal on Matrix Analysis and Applications

Volumn 31, Issue 2, 2009, Pages 694-720

  Avron, Haim ^a   Chen, Doron ^b   Shklarski, Gil ^a   Toledo, Sivan ^a,c  

^a TEL AVIV UNIVERSITY   (Israel)

^b IBM HAIFA RESEARCH LAB   (Israel)

^c MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Combinatorial preconditioners; Finite elements; Preconditioning; Support preconditioners

Indexed keywords

ALGEBRAIC MULTIGRIDS; APPROXIMATION METHODS; COMBINATORIAL GRAPHS; DIAGONALLY DOMINANT; DIAGONALLY DOMINANT MATRIX; DIRECT SOLVERS; DISCRETIZATIONS; ELEMENT MATRIX; ELLIPTIC PARTIAL DIFFERENTIAL EQUATION; FINITE ELEMENT; ILL-CONDITIONED; PRECONDITIONERS; PRECONDITIONING;

APPROXIMATION THEORY; COMBINATORIAL MATHEMATICS; LINEAR SYSTEMS; PARTIAL DIFFERENTIAL EQUATIONS;

MATRIX ALGEBRA;

EID: 72449196960     PISSN: 08954798     EISSN: 10957162     Source Type: Journal    
DOI: 10.1137/060675940     Document Type: Article

References (49)

1. E. Anderson, Z.Bai, C.Bischof, S. Blackford, J. Demmel, J. Dongarra, J. Du Croz, A. Greenbaum, S. Hammarling, A. McKenney, and D. Sorensen, LAPACK User's Guide, 3rd ed., SIAM, Philadelphia, 1999. Also available online from http://www.netlib.org.
2. H. Avron, E. Ng, and S. Toledo, Using perturbed QR factorizations to solve linear least-squares problems, SIAM J. Sci. Comput., submitted.
3. H. Avron, G. Shklarski, and S. Toledo, On element SDD approximability, Technical report, Tel-Aviv University, Israel, Apr. 2008, http://www.cs.tau.ac. il/-haima/element-approximability.pdf.
4. F. L. Bauer, Optimally scaled matrices, Numer. Math., 5 (1963), pp. 73-87.
5. M. Bern, J. R. Gilbert, B. Hendrickson, N. Nguyen, and S. Toledo, Support-graph preconditioned, SIAM J. Matrix Anal. Appl., 27 (2006), pp. 930-951.
6. D. S. Bernstein, Matrix Mathematics: Theory, Facts, and Formulas with Applications to Linear Systems Theory, Princeton University Press, Princeton, NJ, 2005.
7. E. G. Boman, D. Chen, B. Hendrickson, and S. Toledo, Maximum-weight-basis preconditioners, Numer. Linear Algebra Appl., 11 (2004), pp. 695-721.
8. E. G. Boman and B. Hendrickson, On spanning tree preconditioners, unpublished manuscript, Sandia National Laboratories, 2001.
9. E. G. Boman and B. Hendrickson, Support theory for preconditioning,SIAM J. Matrix Anal. Appl., 25 (2004), pp. 694-717.
10. E. G. Boman, B. Hendrickson, and S. A. Vavasis, Solving elliptic finite element systems in near-linear time with support preconditioners, SIAM J. Numer. Anal., 46 (2008), pp. 3264-3284.
11. R. D. Braatz, Response to Chen and Toledo on "minimizing the Euclidean condition number", private communication, Sept. 2005.
12. R. D. Braatz and M. Morari, Minimizing the Euclidean condition number, SIAM J.Control Optim., 32 (1994), pp. 1763-1768.
13. M. Brezina, A. J. Cleary, R. D. Falgout, V. E. Henso n, J. E. Jones, T. A. Manteuffel, S. F. McCormick, and J. W. Ruge, Algebraic multigrid based on element interpolation (amge), SIAM J. Sci. Comput., 22 (2000), pp. 1570-1 592.
14. T. Chartier, R. D. Falgout, V. E. Henson, J. Jones, T. Manteuffel, S. McCormick, J. Ruge, and P. S. Vassilevski, Spectral AMGe (pAMGe), SIAM J. Sci. Comput., 25 (2003), pp. 1-26.
15. D. Chen and S. Toledo, Vaidya's preconditioners: Implementation and experimental study, Electron. Trans. Numer. Anal., 16 (2003), pp. 30-49.
16. D. Chen and S. Toledo, Combinatorial characterization of the null spaces of symmetric H-matrices, Linear Algebra Appl., 392 (2004), pp. 71-90.
17. P. Co-NCUS, G. H. GOLUB, AND D. P. O'LEARY, A generalized conjugate gradient method for the numerical solution of elliptic partial differential equations, in Sparse Matrix Computations, J. R. Bunch and D. J. Rose, eds., Academic Press, New York, 1976, pp. 309-332.
18. M. Elkin, Y. Emek, D. A. Spielman, and S.-H. Teng, Lower-stretch spanning trees,in Proceedings of the 37th annual ACM symposium on Theory of computing (STOC), Baltimore, MD, 2005, ACM Press, New York, pp. 494-503.
19. A. Frangioni AND C. GENTILE, New preconditioners for KKT systems of network flow problems, SIAM J. Optim., 14 (2004), pp. 894-913.
20. K. D. Gremban, Combinatorial Preconditioners for Sparse, Symmetric, Diagonally Dominant Linear Systems, Ph.D. thesis, School of Computer Science, Carnegie Mellon University, Oct. 1996. Available as Technical Report CMU-CS-96 -123.
21. 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, IEEE Computer Society, 1995, pp. 65-69. A longer ver sion is available as Technical Report CMU-CS-94-205, Carnegie-Mellon University.
22. G. Haase, U. Langer, S. Reitzinger, AND J. Schicho, Algebraic multigrid methods based on element preconditioning, Int. J. Comput. Math., 78 (2001), pp. 575-598.
23. V. E. Henson AND U. M. Yang, BoomerAMG: A parallel algebraic multigrid solver and pre-conditioner, Appl. Numer. Math., 41 (2002), pp. 155- 177.
24. M. HESTENES AND E. STIEFEL, Methods of conjugate gradients for solving linear systems,J. Res. Natl. Bureau Standards, 49 (1952), pp. 409-436.
25. J. J. Júdice, J. Patricio, L. F. Portugal, M. G. C. Resende, and G. Veiga, Astudy of preconditioners for network interior point methods, Comput. Optim. Appl., 24 (2003), pp. 5-35.
26. G. KARYPIS AND V. KUMAR, A fast and high quality multilevel scheme for partitioning irregular graphs, SIAM J. Sci. Comput., 20 (1998), pp. 359-392. (Pubitemid 128689516)
27. 1/6) time, parallel algorithm for solving planar Laplacians, in Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007, New Orleans, LA, January 7-9, 2007, N. Bansal, K. Pruhs, and C. Stein, eds., SIAM, Philadelphia, 2007, pp. 1002-10 11.
28. U. LANGER, S. Reitzinger, AND J. Schicho, Symbolic methods for the element preconditioning technique, Technical report, Johannes Kepler Universitat (JKU) Linz, Jan. 2002.
29. B. M. MAGGS,G.L.MILLER, O. Parekh, R.Ravi, AND S. L. M. Woo, Finding effective support-tree preconditioners, in SPAA '05: Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architec tures, ACM Press, New York, 2005, pp. 176-185.
30. T. MANTEUFFEL, An incomplete factorization technique for positive definite linear systems, Math. Comput., 34 (1980), pp. 473-497.
31. The MathWorks, Matlab version 7.2. software package, Jan. 2006.
32. J. A. MEIJERINK AND H. A. VAN DER Vorst, An iterative solution method for linear systems of which the coefficient matrix is a symmetric M-matrix, Math. Comput., 31 (1977), pp. 148-162.
33. C. C. PAIGE AND M. A. SAUNDERS, Solution of sparse indefinite systems of linear equations, SIAM J. Numer. Anal., 12 (1975), pp. 617-629.
34. P.-O. Persson AND G. STRANG, A simple mesh generator in MATLAB, SIAM Rev., 46 (2004), pp. 329-345.
35. L. Portugal, F. Bastos, J. Júdice, J. Paixao, and T. Terlaky, An investigation of interior-point algorithms for the linear transportation problem, SIAM J. Sci. Comput., 17 (1996), pp. 1202-1223.
36. L. F. Portugal, M. G. C. Resende, G. Veiga, and J. J. J udice, A truncatedprimal-infeasible dual-feasible interior point network flow method, Networks, 35 (2000), pp. 91-108.
37. S. REITZINGER, Algebraic multigrid and element preconditioning I, Technical report, J. Kepler Universität (JKU) Linz, Dec. 1998.
38. M. RESENSE AND G. VEIGA, An efficient implementation of the network interior-point method, in Network Flows and Matching: The First DIMACS Implementation Challenge, D. Johnson and C. McGeoch, eds., DIMACS Series in Discrete Mathematics and Computer Science 12, AMS, New York, 1993.
39. Y. Robert, Regular incomplete factorizations of real positive definite matrices, Linear Algebra Appl., 48 (1982), pp. 105-117.
40. A. Shapiro, Upper bounds for nearly optimal diagonal scaling of matrices, Linear and Multilinear Algebra, 29 (1991), pp. 145-147.
41. G. SHKLARSKI AND S. Toledo, Rigidity in finite-element matrices: Sufficient conditions for the rigidity of structures and substructures, SIAM J. Mat rix Anal. Appl., 30 (2008), pp. 7-40.
42. H. Si, TetGen, A Quality Tetrahedral Mesh Generator and Three-Dimensional Delau-nay Triangulator: Users's Manual for Version 1.4, Jan. 2006, available online from http://tetgen.berlios.de.
43. 1.31), in Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science, Oct. 2003, pp. 416-427.
44. D. A. Spielman and S.-H. Teng, Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems, in STOC ' 04: Proceedings of the thirty-sixth annual ACM symposium on Theory of computing, ACM Press, New York, 2004, pp. 81-90.
45. D. A. Spielman and S.-H. Teng, Nearly-linear time algorithms for preconditioning and solving symmetric, diagonally dominant linear systems, unpublished manuscript available online at http://arxiv.org/abs/cs/0607105, 2006.
46. P. M. Vaidya, Solving linear equations with symmetric diagonally dominant matrices by constructing good preconditioners, unpublished manuscript. A talk based on this manuscript was presented at the IMA Workshop on Graph Theory and Sparse Matrix Computations, Minneapolis, MN, October 1991.
47. A. van DER Sluis, Condition numbers and equilibration of matrices, Numer. Math., 14 (1969), pp. 14-23.
48. R. S. Varga, Saff E. B., and V. Mehrmann, Incomplete factorizations of matrices and connections with H-matrices, SIAM J. Numer. Anal., 17 (1980), pp. 787-793.
49. S. Vavasis, private communication, 2007.