Fast nested dissection for finite element meshes

SIAM Journal on Matrix Analysis and Applications

Volumn 18, Issue 3, 1997, Pages 552-565

  Teng, Shang Hua ^a,b  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b University of Minnesota   (United States)

Author keywords

3D point location; Finite element meshes; Geometric sampling; Hierarchical computing; Multilevel methods; Nested dissection; Separators; Sparse matrix computations; The multigrid

Indexed keywords

EID: 0031527342     PISSN: 08954798     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895479895284282     Document Type: Article

References (36)

1. A. AGRAWAL AND P. KLEIN, Cutting down on fill using nested dissection: Provably good elimination orderings, in Sparse Matrix Computations: Graph Theory Issues and Algorithms, A. George, J. Gilbert, and J. Liu, eds., IMA Volumes in Mathematics and its Applications 56, Springer-Verlag, New York, 1993, pp. 31-56.
2. N. ALON, J. H. SPENCER, AND P. ERDÖS, The Probabilistic Method, John Wiley, New York, 1992.
3. S. T. BARNARD AND H. D. SIMON, A fast multilevel implementation of recursive spectral bisection for partitioning unstructured problems, Concurrency: Practice and Experience, 6 (1994), pp. 101-117.
4. M. BERN AND D. EPPSTEIN, Mesh generation and optimal triangulation, in Computing in Euclidean Geometry, D.-Z. Du and F. Hwang, eds., Lecture Notes Series on Computing, Vol. 1., World Scientific, River Edge, NJ, 1992, pp. 23-89.
5. M. BERN, D. EPPSTEIN, AND J. R. GILBERT, Provably good mesh generation, in 31st Annual Symposium on Foundations of Computer Science, IEEE, St. Louis, MO, 1990, pp. 231-241.
6. T. F. CHAN AND B. SMITH, Domain decomposition and multigrid algorithms for elliptic problems on unstructured meshes, Contemp. Math., 180 (1993), pp. 1-14.
7. B. CHAZELLE, Cutting hyerplanes for divide and conquer, Discrete Comput. Geom., 9 (1991), pp. 145-158.
8. K. CLARKSON, D. EPPSTEIN, G. L. MILLER, C. STURTIVANT, AND S.-H. TENG, Approximating center points with iterated Radon points, in Proc. of 9th ACM Symposium on Computational Geometry, San Diego, CA, 1993, pp. 91-98.
9. H. EDELSBRUNNER, Algorithms in Combinatorial Geometry, Springer-Verlag, New York, 1987.
10. I. FRIED, Condition of finite element matrices generated from nonuniform meshes, AIAA J., 10 (1972), pp. 219-221.
11. A. M. FRIEZE, G. L. MILLER, AND S.-H. TENG, Separator based divide and conquer in computational geometry, in Proc. of the 1992 ACM Symposium on Parallel Algorithms and Architectures, San Diego, CA, 1992, pp. 420-430.
12. J. A. GEORGE, Nested dissection of a regular finite element mesh, SIAM J. Numer. Anal., 10 (1973), pp. 345-363.
13. A. GEORGE AND J. W. H. LIU, Computer Solution of Large Sparse Positive Definite Systems, Prentice-Hall, Englewood Cliffs, NJ, 1981.
14. J. R. GILBERT. Predicting structure in sparse matrix computations, SIAM J. Matrix Anal. Appl., 15 (1994), pp. 62-79.
15. J. R. GILBERT, E. G. NG, AND B. W. PEYTON. An efficient algorithm to compute row and column counts for sparse Cholesky factorization, SIAM J. Matrix Anal. Appl., 15 (1994). pp. 1075-1091.
16. J. R. GILBERT AND R. E. TARJAN, The analysis of a nested dissection algorithm, Numer. Math., 50 (1987), pp. 377-404.
17. J. R. GILBERT, G. L. MILLER, AND S.-H. TENG, Geometric mesh partitioning and nested dissection, in 12th Householder Symposium on Numerical Algebra, Plenary talk, Los Angeles, CA, 1993.
18. J. R. GILBERT, G. L. MILLER, AND S.-H. TENG, Geometric mesh partitioning: Implementation and experiments, SIAM J. Sci. Comput., submitted.
19. M. GOODRICH, Planar separators and parallel polygon triangulation, in Proc. of the 24th Annual ACM Symposium on the Theory of Computing, Montreal, Quebec, Canada, 1994, pp. 507-516.
20. T. HAGERUP AND C. RÜB, A guided tour of Chernoff bounds, Inform. Process. Lett., 33 (1990), pp. 305-308.
21. B. HENDRICKSON AND R. LELAND, A Multilevel Algorithm for Partitioning Graphs, Tech. report 93-1301, Sandia National Labs, Albuquerque, NM, 1993.
22. W. HOEFFDING. Probability inequalities for sums of bounded random variables, Amer. Statist. Assoc. J., 58 (1963), pp. 13-29.
23. G. KARYPIS AND V. KUMAR, A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs, Tech. report 95-035, Department of Computer Science, University of Minnesota, Minneapolis, MN, 1995.
24. B. W. KERNIGIIAN AND S. LIN, An efficient heuristic procedure for partitioning graphs, Bell Sys. Tech. J., 49 (1970), pp. 291-307.
25. P. KLEIN, S. RAO, M. RAUCH, AND S. SUBRAMANIAN Faster shortest-path algorithms for planar graphs, in Proc. of the 26th Annual ACM Symposium on the Theory of Computing, Montreal, Quebec, Canada, 1994, pp. 27-37.
26. R. J. LIPTON, D. J. ROSE, AND R. E. TARJAN, Generalized nested dissection, SIAM J. Numer. Anal., 16 (1979), pp. 346-358.
27. R. J. LIPTON AND R. E. TARJAN, A separator theorem for planar graphs, SIAM J. Appl. Math., 36 (1979), pp. 177-189.
28. J. W. H. LIU, A compact row storage scheme for cholesky factors using elimination trees, ACM Trans. Math. Software, 12 (1986), pp. 127-148.
29. J. W. H. LIU, The role of elimination trees in sparse factorization, SIAM J. Matrix Anal., 11 (1990), pp. 134-173.
30. G. L. MILLER, S.-H. TENG, W. THURSTON, AND S. A. VAVASIS, Automatic mesh partitioning, in Sparse Matrix Computations: Graph Theory Issues and Algorithms, A. George, J. Gilbert, and J. Liu, eds., IMA Volumes in Mathematics and its Applications 56, Springer-Verlag, New York, 1993, pp. 57-84.
31. G. L. MILLER, S.-H. TENG, W. THURSTON, AND S. A. VAVASIS, Geometric separators for finite element meshes, SIAM J. Sci. Comput., 1997, to appear.
32. G. L. MILLER, S.-H. TENG, W. THURSTON, AND S. A. VAVASIS, Separators for sphere-packings and nearest neighborhood graphs, J. ACM, 44 (1997), pp. 1-29.
33. G. STRANG AND G. J. FIX, An Analysis of the Finite Element Method, Prentice-Hall, Englewood Cliffs, NJ, 1973.
34. R. E. TARJAN, Data Structures and Network Algorithms, SIAM, Philadelphia, PA, 1985.
35. S.-H. TENG, Points, Spheres, and Separators: A Unified Geometric Approach to Graph Partitioning, Ph.D. thesis, Carnegie-Mellon University, School of Computer Science, Pittsburgh, PA, 1991.
36. S.-H. TENG, Geometric approaches to hierarchical and adaptive computing, in 5th SIAM Conference on Applied Linear Algebra, SIAM, Philadelphia, PA, 1994, pp. 51-57.