Jérôme Galtier
- 1.A. V. Aho, J. E. Hopcroft, and J. D. Ullman. The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, Ma., USA, 1976. Google Scholar
Digital Library
- 2.A. V. Aho, J. E. Hopcroft, and J. D. Ullman. Data structures and algorithms. Addison-Wesley, Reading, Ma., USA, 1983. Google ScholarDigital Library
- 3.Noga Alon, Paul Seymour, and Robin Thomas. Planar separators. SIAM d. Discrete Math., 7(2):184-193, 1994. Google ScholarDigital Library
- 4.K. S. Arun and V. B. Bao. Constructive heuristics and lower bounds for graph partitioning based on a principalcomponents approximation. SIAM J. Matrix Anal. AppI., 14(4):991-1015, 1993. Google ScholarDigital Library
- 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.Google Scholar
- 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.Google Scholar
- 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. Google ScholarDigital Library
- 8.C. Farhat. A simple and efficient automatic fem decomposer. Comp. Struct., 28:579-602, 1988.Google ScholarCross Ref
- 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.Google Scholar
- 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.Google ScholarCross Ref
- 11.J~r6me Galtier. Deepness analysis: Bringing optimal fronts to triangular finite element method. In Parallel and Distributed Computing - Theory and Practice, pages 181-196, 1994. Google ScholarDigital Library
- 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.Google ScholarDigital Library
- 13.D. Knuth. The art of computer programming, volume 3, pages 151-152. Addison-Wesley, 1973. Google ScholarDigital Library
- 14.Richard J. Lipton and Robert E. Taxjan. A separator theorem for planar graphs. SIAM J. Appl. Math., 36(2):177-189, 1979.Google ScholarDigital Library
- 15.Joseph W. H. Liu. A graph partitioning algorithm by node separators. A CM Transactions on Mathematical Software, 15(3):198-219, 1989. Google ScholarDigital Library
- 16.Gary L. Miller, Shang-Hua Teng, and Stephen A. Vavasis. A unified geometric approach to graph separators. In Proceedings of the 32nd Annual Symposium on Foundations o} Computer Science, pages 538-547, 1993. Google ScholarDigital Library
- 17.Claude Pommerell, Marco Annaratone, and Wolfgang Fichtner. A set of new mapping and coloring heuristics for distributed-memory parallel processors. SIAM Journal on Scientific and Statistical Computing., 13(1):194-226, January 1992. Google ScholarDigital Library
- 18.Alex Pothen, Horst D. Simon, and Kang-Pu Liou. Partitioning sparse matrices with eigenvectors of graphs. SIAM J. Matrix Anal. Appl., 1(3):430-452, 1990. Google ScholarDigital Library
- 19.Benoit Duval and Herv~ Guillard. Gestion de maillages tirangulaires d~formables. RR-2272, INRIA-Sophia Antipolis, Projet SINUS, France, 1994.Google Scholar
- 20.P. Le Tallec. Domain decomposition method in computational mechanics. Computational Mechanics Advances, 1(2):121-220, 1993.Google Scholar
- 21.Stephen A. Vavasis. Automatic domain partitioning in three dimensions. SIAM J. Sci. Star. Comput., 12(4):950-970, 1991. Google ScholarDigital Library
- 22.Mihalis Yannakakis. Computing the minimum fill-in is NP- complete. SIAM J. Alg. Disc. Method., 2(1):77-79, 1981.Google ScholarCross Ref
- 23.David M. Young and Tsun-Zee Mai. The search for omega. In David M. Young, editor, Iterative Methods for Large Linear Systems, chapter 17, pages 293-311. Academic Press, 1990. Google ScholarDigital Library
Index Terms
- Automatic partitioning techniques for solving partial differential equations on irregular adaptive meshes
Recommendations
Two-dimensional differential transform for partial differential equations
The differential transform is a numerical method for solving differential equations. In this paper, we present the definition and operation of the two-dimensional differential transform. A distinctive feature of the differential transform is its ability ...
Finite difference method for solving fractional differential equations at irregular meshes
AbstractThis paper presents a novel meshless technique for solving a class of fractional differential equations based on moving least squares and on the existence of a fractional Taylor series for Caputo derivatives. A “Generalized Finite ...
A new framework for solving partial differential equations using semi-analytical explicit RK(N)-type integrators
This paper develops a new explicit semi-analytical approach to solving PDEs based on the variation-of-constants formula, or the equivalent integration equation. These new schemes avoid the discretization of spatial derivatives. Therefore, the accuracy ...
Comments