Adaptive refinement of unstructured finite-element meshes

Finite Elements in Analysis and Design

Volumn 25, Issue 1-2 SPEC. ISS., 1997, Pages 41-60

  Jones, Mark T ^a   Plassmann, Paul E ^b  

^a University of Tennessee   (United States)

^b ARGONNE NATIONAL LABORATORY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ADAPTIVE ALGORITHMS; NATURAL SCIENCES COMPUTING; PARALLEL ALGORITHMS;

ADAPTIVE MESH REFINEMENT ALGORITHMS;

FINITE ELEMENT METHOD;

EID: 0031099023     PISSN: 0168874X     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0168-874x(96)00039-x     Document Type: Article

References (40)

1. M. Bern and D. Eppstein, Mesh generation and optimal triangulations, in: D.-Z. Du and K.F. Hwang (eds.) Computing in Euclidean Geometry, World Scientific, Singapore, 2nd end., pp. 47-123, 1995.
2. R.E. Bank, PLTMG: A Software Package for Solving Elliptic Partial Differential Equations. Users' Guide 6.0, SIAM, Philadelphia, Penn., 1990.
3. W.F. Mitchell, Adaptive refinement for arbitrary finite element spaces with hierarchical bases, J. Camp. Appl. Math. 36, pp. 65-78, 1991.
4. L. Chew, Guaranteed-quality triangular meshes, Technical Report TR-89-983, Computer Science Department, Cornell University, 1989.
5. J. Ruppert, A new and simple algorithm for quality 2-dimensional mesh generation, Proc. 4th ACM-SIAM Symp. on Disc. Algorithms, pp. 83-92, 1993.
6. N. Weatherill, O. Hassan, D. Marcum and M. Marchant, Grid generation by the Delaunay triangulation. Von Karman Institute for Fluid Dynamics, 1993-1994 Lecture Series, NASA Ames Research Center, January 1994.
7. L. Demkowicz, J. Oden, W. Rachowicz and O. Hardy, Toward a universal h-p adaptive finite element strategy, part 1. Constrained approximation and data structures, Comput. Methods Appl. Mech. Eng. 77, pp. 79-112, 1989
8. J. Oden, L. Demkowicz, W. Rachowicz and T. Westermann, Toward a universal h-p adaptive finite element strategy, part 2. A posterior error estimation, Comput. Methods Appl. Mech. Eng., 77, pp. 113-180, 1989.
9. W. Rachowicz, J. Oden and L. Demkowicz, Toward a universal h-p adaptive finite element strategy, part 3. Design of h-p meshes, Comput. Methods Appl. Mech. and Engineering 77, pp. 181-212, 1989.
10. J.E. Flaherty, P.J. Paslow, M.S. Shephard and J.D. Vasilakis, Adaptive Methods for Partial Differential Equations, Society for Industrial and Applied Mathematics, Philadelphia, 1989.
11. W.F. Mitchell, A comparison of adpative refinement techniques for elliptic problems, ACM Trans. Math. Software 15, pp. 326-347, 1989.
12. I. Babuška and W.C. Rheinboldt, Error estimates for adaptive finite element computations, SIAM J. Numer. Anal. 15, pp. 736-754, 1978.
13. I. Babuška and A.K. Aziz, On the angle condition in the finite element method, SIAM J. Numer. Anal. 13, pp. 214-226, 1976.
14. I. Fried, Condition of finite element matrices generated from nonuniform meshes, AIAA J. 10, pp. 219-221, 1972.
15. T. Barth, Aspects of unstructured grids and finite-volume solvers for the Euler and Navier-Stokes equations, Von Karman Institute for Fluid Dynamics, Lecture Series 1994-05, NASA Ames Research Center, March 1994.
16. I.G. Rosenberg and F. Stenger, A lower bound on the angles of triangles constructed by bisecting the longest side, Math. Comput. 29, pp. 390-395, 1975.
17. M. Stynes, On faster convergence of the bisection method for all triangles, Math. Comput. 35, pp. 1195-1201, 1980.
18. R.E. Bank, A.H. Sherman and A. Weiser, Refinement algorithms and data structures for regular local mesh refinement, in: R. Stepleman et al. (eds.), Scientific Computing, IMACS/North-Holland, Amsterdam, pp. 3-17, 1983.
19. M.-C. Rivara, Mesh refinement processes based on the generalized bisection of simplices, SIAM J. Numer. Anal. 21, pp. 604-613, 1984.
20. A. Liu and B. Joe, On the shape of tetrahedra from bisection, Math. Comput. 63, pp. 141-154, 1994.
21. A. Liu and B. Joe, Relationship between tetrahedron shape measures, BIT 34, pp. 268-287, 1994.
22. M.-C. Rivara and C. Levin, A 3rd refinement algorithm suitable for adaptive and multi-grid techniques, Comm. Appl. Numer. Methods 8, pp. 281-290, 1992.
23. J. O'Rourke, Computational geometry column 23, Internat. J. Comput. Geom. Appl. 4, pp. 239-242, 1994, Also in SIGACT News 25 (3) pp. 24-27, 1994.
24. J. O'Rourke, Computational geometry column 23, Internat. J. Comput. Geom. Appl. 4, pp. 239-242, 1994, Also in SIGACT News 25 (3) pp. 24-27, 1994.
25. E. Bänsch, Local mesh refinement in 2 and 3 dimensions, Impact Comput. Sci. Eng. 3, pp. 181-191, 1991.
26. A. Liu and B. Joe, Quality local refinement of tetrahedral meshes based on bisection, SIAM J. Sci. Comput. 16, pp. 1269-1291, 1995.
27. M.-C. Rivara, Selective refinement/derefinement algorithms for sequences of nested triangulations. Int. J. Numer. Methods Eng. 28, pp. 2889-2906, 1989.
28. M.T. Jones and P.E. Plassmann, Scalable iterative solution of sparse linear systems, Parallel Comput. 20, pp. 753-773, 1994.
29. M.T. Heath and P. Raghavan, Distributed solution of sparse linear systems. Technical Report UIUCDCS-R-93-1793, University of Illinois, February 1993.
30. P. Raghavan, Distributed sparse Gaussian elimination and orthogonal factorization, SIAM J. Sci. Comput. 16, pp. 1462-1477, 1995.
31. R. Williams, DIME: Distributed Irregular Mesh Environment, California Institute of Technology, 1990.
32. R. Williams, A dynamic solution-adaptive unstructured parallel solver, Report CCSF-21-92, Caltech Concurrent Supercomputing Facilities, California Institute of Technology, Padadena, CA, 1992.
33. M.T. Jones and P.E. Plassmann, Parallel algorithms for adaptive mesh refinement, Preprint MCS-P421-0394, Mathematics and Computer Science Division, Argonne National Laboratory, Argonne, IL, 1994.
34. M.T. Jones and P.E. Plassmann, Computational results for parallel unstructured mesh computations, Comput. Systems Eng. 5, pp. 297-309, 1994.
35. B. Hendrickson and R. Leland, The Chaco user's guide: Version 2.0, Sandia Report SAND94-2692, Sandia National Laboratories, Albuquerque, NM, June 1995.
36. R. Williams, Performance of dynamic load balancing algorithms for unstructured mesh calculations, Concurrency: Practice Experience 3, pp. 457-481, 1991.
37. A. Pothen, H. Simon and K.-P. Liou, Partitioning sparse matrices with eigenvectors of graphs, SIAM J. Matrix Anal. 11, pp. 430-452, 1990.
38. K.D. Devine, J.E. Flaherty, S.R. Wheat and A.B. Maccabe, A massively parallel adaptive finite element method with dynamic load balancing, Technical Report, SAND 93-0936C, Sandia National Labs; Albuquerque, NM, 1993.
39. J. Bell, M. Berger, J. Saltzman and M. Welcome, Three-dimensional adaptive mesh refinement for hyperbolic conservation laws, SIAM. J. Sci. Comput. 15, pp. 127-138, 1994.
40. J.T. Oden and A. Patra, A parallel adaptive strategy for hp finite element computations, Technical Report 94-01, TICAM, University of Texas; Austin, TX, May 1994.