Mesh and solver co-adaptation in finite element methods for anisotropic problems

Numerical Methods for Partial Differential Equations

Volumn 21, Issue 4, 2005, Pages 859-874

  Du, Qiang ^a,b   Huang, Zhaohui ^c   Wang, Desheng ^d,e  

^a PENNSYLVANIA STATE UNIVERSITY   (United States)

^b CHINESE ACADEMY OF SCIENCES   (China)

^c INSTITUTE OF GEOLOGY AND GEOPHYSICS   (China)

^d XIANGTAN UNIVERSITY   (China)

^e SWANSEA UNIVERSITY   (United Kingdom)

Author keywords

Anisotropic meshing; Finite element; Iterative solver; Joint co adaptation

Indexed keywords

EID: 23144459384     PISSN: 0749159X     EISSN: None     Source Type: Journal    
DOI: 10.1002/num.20072     Document Type: Article

References (44)

1. 1 I. Babuaska and A. K. Aziz, On the angle condition in the finite method, SIAM J Numer Anal 13 (1976), 214–226.
2. 2 R. Bank, Mesh smoothing using a posteriori estimates, SIAM J Numer Anal 34 (1997), 979–997.
3. 3 M. Berzins, A solution‐based triangular and tetrahedral mesh quality indicator, SIAM J Sci Comput 19 (1998), 2051–2069.
4. 4 M. Berzins, Mesh quality: a function of geometry, error estimates or both? Proc 7th International Meshing Roundtable 15 (1999), 236–247.
5. 5 P. Ciarlet, Finite element methods for elliptic equations, North‐Holland, 1975.
6. 6 E. D'Azevedo and B. Simpson, On optimal triangular meshes for minimizing the gradient error, Numerische Mathematik 59 (1991), 321–348.
7. 7 S. Rippa, Long and thin triangles can be good for linear interpolation, SIAM J Numer Anal 29 (1992), 257–270.
8. 8 J. Shewchuk, What is a good linear finite element? Interpolation, conditioning, anisotropy and quality measures, CS report, UC Berlekey.
9. 9 N. Amenta, M. Bern, and D. Eppstein, Optimal point placement for mesh smoothing, J Algorithms 30 (1999), 302–322.
10. 10 G. Buscaglia and E. Dari, Anisotropic mesh optimization and its application in adaptivity, Int J Num Methods Engrg 40 (1997), 4119–4136.
11. 11 Q. Du and D. Wang, Tetrahedral mesh generation and optimization based on CVTs, Int J Numer Methods Engrg 56 (2003), 1355–1373.
12. 12 H. Borouchaki and P. Frey, Adaptive triangular‐quadrilateral mesh generation, Int J Numer Methods Eng 41 (1998), 915–934.
13. 13 H. Borouchaki, P. L. George, F. Hecht, P. Laug, and E. Saltel, Delaunay mesh generation governed by metric specifications Part I, Algorithms 25 (1997), 61–83.
14. 14 P. L. George and H. Borouchak, Delaunay triangulation and meshing, Application to finite elements methods, Hermès, Paris, 1998.
15. 15 J. Thompson, B. K. Soni, and N. P. Weatherill, Handbook of grid generation, CRC Press LLC, 1999.
16. 16 A. Bowyer, Computing Dirichlet tessellations, Computer J 24 (2) (1981), 162–166.
17. 17 D. Watson, Computing the n‐dimensional Delaunay tessellation with applications to Voronoi polytopes, Comput J 24 (1981), 167–172.
18. 18 Q. Du and D. Wang, Constrained boundary recovery for three dimensional Delaunay triangulation, Int J Numer Meth Eng 61 (2004), 1471–1500.
19. 19 F. Bossen and P. Heckbert, A pliant method for anisotropic mesh generation, Proc 5th International Meshing Roundtable, 1996, pp 63–74.
20. 20 M. J. Castro‐Diaz, F. Hecht, and B. Mohammadi, New programs in anisotropic grid adaptation for inviscid and viscous flows simulations, Proc 4th International Meshing Roundtable, 1993, pp 73–85.
21. 21 Q. Du and D. Wang, Anisotropi centroidal Voronoi tessellations and their applications, SIAM J Sci Comp, 2004, to appear.
22. 22 R. Garimella and M. S. Shephard, Boundary layer meshing for viscous flows in complex domain, Proc 7th International Meshing Roundtable, 1998, pp 107–118.
23. 23 J. Krause, N. Strecker, and W. Fichtner, Boundary‐sensitive mesh generation using an offsetting technique, Int J Num Methods Engrg 49 (2000), 51–59.
24. 24 J. Li, S. Teng, and A. Ungor, Biting ellipses to generate anisotropic mesh, Proc 8th International Meshing Roundtable, Lake Tahoe, CA, 1999, pp 97–109.
25. 25 D. Mavriplis, Directional coarsening and smoothing for anisotropic Navier‐Stokes problems, Elect Trans Numer Anal 6 (1997), 182–197.
26. 26 P. L. George, Gamanic3d, Adaptive anisotropic tetrahedral mesh generator, Technical Report, INRIA, 2002.
27. 27 S. Yamakawa and K. Shimada, Anisotropic tetrahedral meshing via bubble packing and advancing front, Int J Num Method Engrg 57 (2003), 1923–1942.
28. 28 N. Hitschfeld, L. Villablanca, J. Krause, and M. Rivara, Improving the quality of meshes for the simulation of semiconductor devices using Lepp‐based algorithms, Int J Num Methods Eng 58 (2003), 333–347.
29. 29 M. C. Rivara and P. Inostroza, Using longest‐side bisection techniques for the automatic refinement of Delaunay triangulations, Int J Numer Method Engrg 40 (1997), 581–597.
30. 30 J. Shewchuk, Delaunay Refinement Mesh Generation, Ph.D. Thesis. Computer Science Dept Carnegie Mellon University, 1997.
31. 31 M. Adams, Evaluations of the three unstructured multigrid methods in 3D finite element problems in solid mechanics, Int J Numer Method Eng 55 (2002), 519–534.
32. 32 S. Borm and R. Hiptmair, Analysis of tensor product multigrid, Numerical Algorithms 26 (2001), 219–234.
33. 33 W. Hackbusch, The frequency decomposition multigrid method, part I: Application to anisotropic equations, Numer Math 56 (1989), 229–245.
34. 34 D. Mavriplis, Multigrid strategies for viscous flow solvers on anisotropic unstructured meshes, NASA/CR‐1998‐206910, 1998.
35. 35 W. Mulder, A high resolution Euler solver based on multigrid semi‐coarsening and defect correction, J Comput Phys 100 (1992), 91–104.
36. 36 Y. Saad, Iterative methods for sparse linear systems, PWS Publishing Company, 1996.
37. 37 M. Brezina, A. Cleary, R. Falgout, V. Henson, J. Jones, T. Manteuffel, S. McCormick, and J. Ruge, Algebraic multigrid based on element interpolation, SIAM J Sci Comp 22 (2000), 1570–1592.
38. 38 T. Chan, L. Zikatanov, and J. Xu, An agglomeration multigrid method for unstructured grids, Cont Math 218 (1998), 67–81.
39. 39 J. Ruge and K. Stuben, Algebraic multigrid, in Multigrid methods, Fronties in applied mathematics, Philadelphia, SIAM, 1987, pp 73–130.
40. 40 U. Trottenberg, C. W. Oosterlee, and A. Schuller, Multigrid, Academic Press, 2000.
41. 41 P. Vanek, M. Brezina, and J. Mandel, Convergence of albegraic multigrid based on smoothed aggregation, Numer Math 88 (2001), 559–579.
42. 42 Q. Chang and Z. Huang, Efficient algebraic multigrid algorithms and their convergence, SIAM J Sci Comput 24 (2002), 597–618.
43. 43 Z. Huang, G. Lei, and X. Liu, High‐order PCG method soling complex systems, Chinese J Comput Phys 17 (2000), 401–406.
44. 44 Z. Huang and Q. Chang, Gauss‐Seidel‐type multigrid methods, J Comput Math 21 (2003), 421–434.