Abstract
We present a randomized O(n loglog n) time algorithm for the construction of a separator tree decomposition for well-shaped meshes in two and three dimensions. Our algorithm takes O(n log log n) time which improves the previous algorithms that need O(n log n) time. We use techniques from probability theory, computational geometry, and graph theory. Our algorithm has applications in the solution of sparse linear systems and 3D point location.
Supported in part by an NSF CAREER award (CCR-9502540). Part of this work was done while the author was at Department of Mathematics and Lab. for Computer Science, Massachusetts Institute of Technology, Cambridge, MA 02139 and Xerox PARC.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
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, Springer-Verlag, 56 pp 31–56, 1993.
N. Alon and J. H. Spencer and P. Erdös. The Probabilistic Method, Wiley, 1992.
M. Bern and D. Eppstein. Mesh generation and optimal triangulation, in Computing in Euclidean Geometry, World Scientific, pp 23–89, 1992.
M. Bern, D. Eppstein, and J. R. Gilbert. Provably good mesh generation. In 31st FOCS, pages 231–241. IEEE, 1990.
T. F. Chan and B. Smith. Domain decomposition and multigrid algorithms for elliptic problems on unstructured meshes. Contemporary Mathematics, 1–14, 1993.
B. Chazelle. Cutting hyerplanes for divide and conquer. Disc, and Comput. Geom., 9:145–158, 1991.
K. Clarkson, D. Eppstein, G. L. Miller, C. Sturtivant, and S.-H. Teng. Approximating center points with iterated Radon points. In 9th ACM SoCG, pages 91–98, 1993.
H. Edelsbrunner. Algorithms in Combinatorial Geometry. Springer-Verlag, NY, 1987.
I. Fried. Condition of finite element matrices generated from nonuniform meshes. AIAA J., 10:219–221, 1972.
A. M. Frieze, G. L. Miller, and S.-H. Teng. Separator based divide and conquer in computational geometry. In SPAA, ACM, pages 420–430, 1992.
J. A. George. Nested dissection of a regular finite element mesh. SIAM J. Numerical Analysis, 10:345–363, 1973.
A. George and J. W. H. Liu. Computer Solution of Large Sparse Positive Definite Systems. Prentice-Hall, 1981.
J. R. Gilbert and R. E. Tarjan. The analysis of a nested dissection algorithm. Numerische Mathematik, 50(4):377–404, 1987.
J. R. Gilbert, G. L. Miller, and S.-H. Teng. Geometric mesh partitioning: Implementation and experiments. SIAM SISC, to appear 1996.
M. Goodrich. Planar separators and parallel polygon triangulation. In the 24 ACM STOC, 507–516. 1994.
T. Hagerup and C. Rüb. A guided tour of Chernoff bounds. IPL, 33:305–308, 1990.
W. Hoeffding. Probability inequalities for sums of bounded random variables. Amer. Stat. Assoc. J., 13–29, 1963.
P. Klein, S. Rao, M. Rauch, and S. Subramanian. Faster shortest-path algorithms for planar graphs. In the 26 ACM STOC, 27–37. 1994.
R. J. Lipton, D. J. Rose, and R. E. Tarjan. Generalized nested dissection. SIAM J. on NA, 16:346–358, 1979.
R. J. Lipton and R. E. Tarjan. A separator theorem for planar graphs. SIAM J. of Appl. Math., 36:177–189, April 1979.
J. W. H. Liu. A compact row storage scheme for cholesky factors using elimination trees. ACM Trans, on Math. Softw., 12:127–148, 1986.
J. W. H. Liu. The role of elimination trees in sparse factorization. SIAM J. Matrix Anal. Appl., 11:134–173, 1990.
G. L. Miller, S.-H. Teng, W. Thurston, and S. A. Vavasis. Automatic mesh partitioning. Sparse Matrix Computations: Graph Theory Issues and Algorithms, Springer-Verlag, 56 pp 57–84, 1993.
G. Strang and G. J. Fix. An Analysis of the Finite Element Method. Prentice-Hall, 1973.
R. E. Tarjan. Data Structures and Network Algorithms. SIAM, 1985.
S.-H. Teng. Points, Spheres, and Separators: a unified geometric approach to graph partitioning. PhD thesis, 1991. CMU-CS-91-184.
S.-H. Teng. Geometric approaches to hierarchical and adaptive computing with applications to multigrid and domain decomposition. In Fifth SIAM Applied Linear Algebra, 51–57, 1994.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Teng, SH. (1996). Fast separator decomposition for finite element meshes. In: Cai, JY., Wong, C.K. (eds) Computing and Combinatorics. COCOON 1996. Lecture Notes in Computer Science, vol 1090. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61332-3_152
Download citation
DOI: https://doi.org/10.1007/3-540-61332-3_152
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61332-9
Online ISBN: 978-3-540-68461-9
eBook Packages: Springer Book Archive