Solving elliptic finite element systems in near-linear time with support preconditioners

SIAM Journal on Numerical Analysis

Volumn 46, Issue 6, 2008, Pages 3264-3284

  Boman, Erik G ^a   Hendrickson, Bruce ^a   Vavasis, Stephen ^b  

^a SANDIA NATIONAL LABORATORIES   (United States)

^b UNIVERSITY OF WATERLOO   (Canada)

Author keywords

Diagonal dominance; Finite elements; Matrix algorithm; Preconditioning; Support graph

Indexed keywords

DIAGONAL DOMINANCE; FINITE ELEMENTS; MATRIX ALGORITHM; PRECONDITIONING; SUPPORT GRAPH;

FINITE ELEMENT METHOD; GRAPH THEORY; LINEAR SYSTEMS; NUMERICAL ANALYSIS; POLYNOMIAL APPROXIMATION;

PROBLEM SOLVING;

EID: 55349087945     PISSN: 00361429     EISSN: None     Source Type: Journal    
DOI: 10.1137/040611781     Document Type: Article

References (23)

1. J. H. ARGYRIS, The natural factor formulation of the stiffness for the matrix displacement method, Comput. Methods Appl. Mech. Engrg., 5 (1975), pp. 97-119.
2. H. AVRON, D. CHEN, G. SHKLARSKI, AND S. TOLEDO, Combinatorial preconditioners for scalar elliptic finite-element problems, preprint, Tel-Aviv University, Tel-Aviv, 2006.
3. O. AXELSSON AND V. A. BARKER, Finite Element Solution of Boundary Value Problems: Theory and Computation, SIAM Press, Philadelphia, 2001.
4. M. BERN, J. R. GILBERT, B. HENDRICKSON, N. NGUYEN, AND S. TOLEDO, Support-graph preconditioners, SIAM J. Matrix Anal. Appl., 27 (2006), pp. 930-951.
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); also available online from http://etna.mcs.kent.edu.
7. D. CHEN AND S. TOLEDO, Combinatorial characterization of the null spaces of symmetric H-matrices, Linear Algebra Appl., 392 (2004), pp. 71-90.
8. R. COOLS, An encyclopaedia of cubature formulas, J. Complexity, 19 (2003), pp. 445-453.
9. 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, New York, NY, 2005, Association for Computing Machinery, pp. 494-503.
10. G. GOLUB AND C. F. VAN LOAN, Matrix Computations, 3rd ed., Johns Hopkins University Press, Baltimore, 1996.
11. K. GREMBAN, Combinatorial Preconditioners for Sparse, Symmetric, Diagonally Dominant Linear Systems, Ph.D. thesis, School of Computer Science, Carnegie-Mellon University, Pittsburg, PA, 1996. Available as Technical Report CMU-CS-96-123.
12. R. GUPTA, Support Graph Preconditioners for Sparse Linear Systems, Master's thesis, Texas A&M University, College Station, TX, 2004. Available online at https://txspace.tamu.edu/bitstream/1969.1/1353/1/etd- tamu-2004C-2-CPSC-Gupta.pdf.
13. I. GUSTAFSSON, An incomplete factorization preconditioning method based on modification of element matrices, BIT, 36 (1996), pp. 86-100.
14. 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.
15. C. JOHNSON, Numerical Solution of Partial Differential Equations by the Finite Element Method, Cambridge University Press, London, 1987.
16. P. KNUPP, Algebraic mesh quality metrics, SIAM J. Sci. Comput., 23 (2001), pp. 193-218.
17. S. A. MITCHELL AND S. A. VAVASIS, Quality mesh generation in higher dimensions, SIAM J. Comput., 29 (2000), pp. 1334-1370.
18. T. PHILLIPS AND G. MILLER, private communication, 2005.
19. J. R. SHEWCHUK, Triangle: Engineering a 2D quality mesh generator and Delaunay triangulator, in Applied Computational Geometry: Towards Geometric Engineering, Lecture Notes Comput. Sci. 1148, M. C. Lin and D. Manocha, eds., Springer, Berlin, 1996, pp. 203-222. From the First ACM Workshop on Applied Computational Geometry.
20. D. A. SPIELMAN AND S.-H. TENG, Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems, in Proceedings of the 36th Annual ACM Symposium on Theory of Computing, ACM Press, New York, NY, 2004, pp. 81-90.
21. S. VAVASIS, A Bernstein-Bézier sufficient condition for invertibility of polynomial mappings, http://arxiv.org/abs/cs.NA/0308021 (2003).
22. S. A. VAVASIS, Stable finite elements for problems with wild coefficients, SIAM J. Numer. Anal., 33 (1996), pp. 890-916.
23. M. WANG AND V. SARIN, Parallel support graph preconditions, in High Performance Computing - HiPC 2006, Lecture Notes Comput. Sci. 4297, Y. Roberts, M. Parashas, R. Badrinath, and V. Prasanna, eds., Springer, Berlin, 2006, pp. 387-398.