Automatic partitioning techniques for solving partial differential equations on irregular adaptive meshes

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Automatic partitioning techniques for solving partial differential equations on irregular adaptive meshes

Full text

Pdf (927 KB)

Source

International Conference on Supercomputing archive
Proceedings of the 10th international conference on Supercomputing table of contents

Philadelphia, Pennsylvania, United States

Pages: 157 - 164

Year of Publication: 1996

ISBN:0-89791-803-7

Author

Jérôme Galtier

ACAPS Laboratory, McGill University, Montreal, Canada and PRiSM Laboratory, Université de Versailles Saint-Quentin, France

Sponsor

SIGARCH: ACM Special Interest Group on Computer Architecture

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 3, Downloads (12 Months): 12, Citation Count: 1

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/237578.237598 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	Alfred V. Aho , John E. Hopcroft, The Design and Analysis of Computer Algorithms, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1974
	2	Alfred V. Aho , John E. Hopcroft , Jeffrey Ullman , J. D. Ullman , J. E. Hopcroft, Data Structures and Algorithms, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1983
	3	Noga Alon , Paul Seymour , Robin Thomas, Planar Separators, SIAM Journal on Discrete Mathematics, v.7 n.2, p.184-193, May 1994 [doi>10.1137/S0895480191198768]
	4	K. S. Arun , V. B. Rao, Constructive heuristics and lower bounds for graph partitioning based on a principal-components approximation, SIAM Journal on Matrix Analysis and Applications, v.14 n.4, p.991-1015, Oct. 1993 [doi>10.1137/0614066]
	5	B.R. Baliga and S.V. Patankar. Elliptic systems: Finiteelement method ii. In W.J. Minkowycz, E.M. Sparrow, G.E. Schneider, and R.H. Fletcher, editors, Handbook of Numerical Heat Transfer, pages 421-461. John Wiley Sons Inc., 1988.
	6	S. T. Barnard and H. D. Simon. A fast implementation of recursive spectral bisection for partitioning unstructured problems, in R. S. Sincovec et al., editor, Parallel Processing for Scientific Computing, pages 711-718. SIAM, 1993.
	7	David Eppstein, Gary L. Miller, and Shang-Hua Teng. A deterministic linear time algorithm for geometric separators and its applications. Fundamenta Infomaticae, 22:309-329, 1995.
	8	C. Farhat. A simple and efficient automatic fem decomposer. Comp. Struct., 28:579-602, 1988.
	9	C. Farhat and H. D. Simon. TOP/DOMDEC: A software tool for mesh partitioning and parallel processing. 0U- CSSC-93-11, Center for Space Structures and Control, College of engineering, University of Colorado, 1993.
	10	Charbel Farhat and Michel Lesoinne. Automatic partitioning of unstructured meshes for the parallel solution of problems in computational mechanics. Int. J. Numer. Engn, 36:745- 764, 1993.
	11	Jérôme Galtier, Deepness analysis: bringing optimal fronts to triangular finite element method, Proceedings of the first Canada-France conference on Parallel and distributed computing, p.181-196, June 1994, Montreal, Canada
	12	Hillel Gazit and Gary L. Miller. A parallel algorithm for finding a separator in planar graphs. In 28th Annual Symposium on Foundations of Computer Science, pages 238-248, Los Angeles, 1987. iEEE.
	13	Donald E. Knuth, The art of computer programming, volume 3: (2nd ed.) sorting and searching, Addison Wesley Longman Publishing Co., Inc., Redwood City, CA, 1998
	14	Richard J. Lipton and Robert E. Taxjan. A separator theorem for planar graphs. SIAM J. Appl. Math., 36(2):177-189, 1979.
	15	Joseph W. H. Liu, A graph partitioning algorithm by node separators, ACM Transactions on Mathematical Software (TOMS), v.15 n.3, p.198-219, Sept. 1989 [doi>10.1145/66888.66890]
	16	Gary L. Miller , Shang-Hua Teng , Stephen A. Vavasis, A unified geometric approach to graph separators, Proceedings of the 32nd annual symposium on Foundations of computer science, p.538-547, September 1991, San Juan, Puerto Rico [doi>10.1109/SFCS.1991.185417]
	17	Claude Pommerell , Marco Annaratone , Wolfgang Fichtner, A set of new mapping and coloring heuristics for distributed-memory parallel processors, SIAM Journal on Scientific and Statistical Computing, v.13 n.1, p.194-226, Jan. 1992 [doi>10.1137/0913011]
	18	Alex Pothen , Horst D. Simon , Kan-Pu Liou, Partitioning sparse matrices with eigenvectors of graphs, SIAM Journal on Matrix Analysis and Applications, v.11 n.3, p.430-452, Jul. 1990 [doi>10.1137/0611030]
	19	Benoit Duval and Herv~ Guillard. Gestion de maillages tirangulaires d~formables. RR-2272, INRIA-Sophia Antipolis, Projet SINUS, France, 1994.
	20	P. Le Tallec. Domain decomposition method in computational mechanics. Computational Mechanics Advances, 1(2):121-220, 1993.
	21	Stephen A. Vavasis, Automatic domain partitioning in three dimensions, SIAM Journal on Scientific and Statistical Computing, v.12 n.4, p.950-970, July 1991 [doi>10.1137/0912051]
	22	Mihalis Yannakakis. Computing the minimum fill-in is NP- complete. SIAM J. Alg. Disc. Method., 2(1):77-79, 1981.
	23	David M. Young , Tsun-Zee Mai, The search for Omega, Iterative methods for large linear systems, Academic Press Professional, Inc., San Diego, CA, 1990