# zbMATH — the first resource for mathematics

The natural element method in solid mechanics. (English) Zbl 0940.74078
The authors present applications of the natural element method (NEM) to boundary value problems in two-dimensional small displacement elastostatics. The discrete model of the domain $$\Omega$$ consists of a set of distinct nodes $$N$$ and a polygonal description of the boundary $$\delta\Omega$$. In the NEM, the trial and test functions are constructed using natural neighbour interpolants. These interpolants are based on the Voronoi tesselation of the set of nodes $$N$$. The interpolants are $$C^\infty$$ smooth everywhere, except at the nodes where they are $$C^0$$. The NEM interpolant is strictly linear between adjacent nodes on the boundary of the convex hull. The authors also describe a methodology to model material discontinuities and nonconvex bodies (cracks) using NEM. A standard displacement-based Galerkin procedure is used to obtain the discrete system of linear equations. The authors present applications of NEM to various problems in solid mechanics, which include the patch test, gradient problems, bimaterial interface and a static crack problem. Excellent agreement with exact (analytical) solutions is obtained. The potential applications to other classes of problems – crack growth, plates and large deformations – are possible.

##### MSC:
 74S30 Other numerical methods in solid mechanics (MSC2010) 74S05 Finite element methods applied to problems in solid mechanics
Triangle
Full Text:
##### References:
 [1] ’Natural neighbor finite elements’, Int. Conf. on Hydraulic Engineering Software, Hydrosoft Proc., Vol. 2, Computational Mechanics Publications, 1994, pp. 291-297. [2] Braun, Nature 376 pp 655– (1995) · doi:10.1038/376655a0 [3] Monaghan, Comput. Phys. Commun. 48 pp 89– (1988) · Zbl 0673.76089 · doi:10.1016/0010-4655(88)90026-4 [4] Nayroles, Comput. Mech. 10 pp 307– (1992) · Zbl 0764.65068 · doi:10.1007/BF00364252 [5] Belytschko, Int. J. Numer. Meth. Engng. 37 pp 229– (1994) · Zbl 0796.73077 · doi:10.1002/nme.1620370205 [6] Sulsky, Comput. Meth. Appl. Mech. Engng. 118 pp 179– (1994) · doi:10.1016/0045-7825(94)90112-0 [7] Liu, Int. J. Numer. Meth. Engng. 20 pp 1081– (1995) · Zbl 0881.76072 · doi:10.1002/fld.1650200824 [8] Oñate, Comput. Meth. Appl. Mech. Engng. 139 pp 315– (1996) · Zbl 0894.76065 · doi:10.1016/S0045-7825(96)01088-2 [9] Melenk, Comput. Meth. Appl. Mech. Engng. 139 pp 289– (1996) · Zbl 0881.65099 · doi:10.1016/S0045-7825(96)01087-0 [10] Duarte, Comput. Meth. Appl. Mech. Engng. 139 pp 237– (1996) · Zbl 0918.73328 · doi:10.1016/S0045-7825(96)01085-7 [11] Belytschko, Comput. Meth. Appl. Mech. Engng. 139 pp 3– (1996) · Zbl 0891.73075 · doi:10.1016/S0045-7825(96)01078-X [12] Sibson, Math. Proc. Cambridge Philos. Soc. 87 pp 151– (1980) · Zbl 0466.52010 · doi:10.1017/S0305004100056589 [13] ’A brief description of natural neighbor interpolation’, in (ed.), Interpreting Multivariate Data, Wiley, Chichester, 1981, pp. 21-36. [14] ’Scattered data interpolation in three or more variables’, in and (eds.), Mathematical Methods in Computer Aided Geometric Design, Academic Press, San Diego, 1989, pp. 1-34. · doi:10.1016/B978-0-12-460515-2.50005-6 [15] Watson, Geobyte 2 pp 12– (1987) [16] Watson, Pattern Recognition 21 pp 63– (1988) · doi:10.1016/0031-3203(88)90072-6 [17] ’Surface interpolation, spatial adjacency and GIS’, in (ed.), Three Dimensional Applications in Geographical Information Systems, Taylor and Francis, London, 1989, pp. 21-35. [18] Farin, Comput. Aided Geom. Des. 7 pp 281– (1990) · Zbl 0728.65013 · doi:10.1016/0167-8396(90)90036-Q [19] ’An implementation of natural neighbor interpolation in three dimensions’, Master’s Thesis, Brigham Young University, 1992. [20] Contouring: A Guide to the Analysis and Display of Spatial Data, Pergamon Press, Oxford, 1992. [21] Traversoni, Numer. Algorithms 5 pp 63– (1993) · Zbl 0798.65014 · doi:10.1007/BF02109284 [22] ’Properties of local coordinates based on Dirichlet tessellations’, in and (eds.), Geometric Modelling, Vol. 8, Springer, Wien, 1993, pp. 227-239. · Zbl 0852.68093 · doi:10.1007/978-3-7091-6916-2_15 [23] Nngridr: An implementation of natural neighbor interpolation, David Watson, Claremont, WA, Australia, 1994. [24] ’Natural neighbor interpolation on the sphere’, in and (eds.), Wavelets, Images and Surface Fitting, Peters, A.K., Wellesley, MA, 1994, pp. 67-74. · Zbl 0817.65006 [25] and , ’Plume characterization with natural neighbor interpolation’, Proc. GEOENVIRONMENT 2000, Geotechnical Engineering and Environmental Engineering Divisions/ASCE, New York, NY, 1995, 331-345. [26] Robinson, IEEE Trans. Commun. 43 pp 2095– (1995) · doi:10.1109/26.387450 [27] Braun, Geophys. J. Int. 122 pp 837– (1995) · doi:10.1111/j.1365-246X.1995.tb06841.x [28] and , ’Finite element simulation of shallow waters using natural neighbors techniques’, In Computational Methods in Surface Flows and Transport Problems: Internation Conference on Computational Methods in Water Resources, Vol. 2, 1996, 239-245. [29] Voronoi, J. Reine Angew. Math. 134 pp 198– (1908) [30] Delaunay, Izv. Akad. Nauk SSSR, Otdelenie Matematicheskih i Estestvennyh Nauk 7 pp 793– (1934) [31] ’Computational Geometry’, Ph.D. Thesis, Department of Computer Science, Yale University, New Haven, CT, 1978. [32] and , Computational Geometry: An Introduction, Springer, New York, NY, 1985. · doi:10.1007/978-1-4612-1098-6 [33] Computational Geometry in C, Cambridge University Press, Cambridge, 1994. · Zbl 0816.68124 [34] ’A two-dimensional interpolation function for irregularly spaced points’, ACM National Conf., 1968, pp. 517-524. [35] Lancaster, Math. Comput. 37 pp 141– (1981) · doi:10.1090/S0025-5718-1981-0616367-1 [36] ’Interpolation and smoothing of scattered data by radial basis functions’, Master’s Thesis, Tel Aviv University, 1984. [37] ’Radial basis functions for multivariable interpolation’, Algorithms for Approximations, Clarendon Press, Oxford, 1987, pp. 143-168. [38] Hardy, J. Geophys. Res. 76 pp 1905– (1971) · doi:10.1029/JB076i008p01905 [39] Babuška, SIAM J. Numer. Anal. 13 pp 214– (1976) · Zbl 0324.65046 · doi:10.1137/0713021 [40] Green, Comput. J. 21 pp 168– (1978) · Zbl 0377.52001 · doi:10.1093/comjnl/21.2.168 [41] Voronoi (Thiessen) Polygons, Geo Books, Norwich, U.K., 1986. [42] and , Spatial Tessellations: Concepts and Applications of Voronoi Diagrams, Wiley, Chichester, England, 1992. · Zbl 0877.52010 [43] Aurenhammer, ACM Trans. Math. Software 23 pp 469– (1996) [44] ’Software for C1 surface interpolation’, in (ed.), Mathematical Software III, Vol. 3, Academic Press, New York, N.Y., 1977. [45] Brown, Inform. Process. Lett. 9 pp 223– (1979) · Zbl 0424.68036 · doi:10.1016/0020-0190(79)90074-7 [46] Bowyer, Comput. J. 24 pp 162– (1981) · doi:10.1093/comjnl/24.2.162 [47] Watson, Comput. J. 24 pp 167– (1981) · doi:10.1093/comjnl/24.2.167 [48] Lee, Int. J. Comput. Inform. Sci. 9 pp 219– (1980) · Zbl 0441.68047 · doi:10.1007/BF00977785 [49] Fortune, Algorithmica 2 pp 153– (1987) · Zbl 0642.68079 · doi:10.1007/BF01840357 [50] ’Triangle: Engineering a 2D Quality Mesh Generator and Delaunay Triangulator’, First Workshop on Applied Computational Geometry, Association for Computing Machinery, New York, May 1996, pp. 124-133. [51] Triangle: A Two-Dimensional Quality Mesh Generator and Delaunay Triangulator, School of Computer Science, Carnegie Mellon University, Pittsburgh, PA 15213, 1996b. Available at http://www.cs.cmu.edu/quake/triangle.html. [52] Show Me: A Display Program for Meshes and More, School of Computer Science, Carnegie Mellon University, Pittsburgh, PA 15213, 1996a. Available at http//www.cs.cmu.edu/quake/showme.html. [53] and , Qhull (Computer Program), The Geometry Center, University of Minnesota, 1300 South Second Street, Minneapolis, MN 55454, 1994. Available at http://www.geom.umn.edu/software/qhull/. [54] Barber, ACM Trans. Math. Software 22 pp 469– (1996) · Zbl 0884.65145 · doi:10.1145/235815.235821 [55] Computational Geometry: An Introduction Through Randomized Algorithms, Prentice-Hall, Englewood Cliffs, N.J., 1994. [56] ’Voronoi diagrams and Delaunay triangulations’, in and (eds.), Computing in Euclidean Geometry, Lecture Notes Series on Computing, Vol. 1, World Scientific, Singapore, 1995, pp. 193-233. · doi:10.1142/9789814355858_0006 [57] and , ’Mesh generation and optimal triangulation’, in and (eds.), Computing in Euclidean Geometry, Lecture Notes Series on Computing, Vol. 1, World Scientific, Singapore, 1995, pp. 23-90. · doi:10.1142/9789814355858_0002 [58] The Finite Element Method, Englewood Cliffs, Prentice-Hall, N.J., 1987. [59] Ahuja, IEEE Trans. Pattern Anal. Mach. Intell. 4 pp 336– (1982) · doi:10.1109/TPAMI.1982.4767255 [60] and , ’A building method for hierarchical covering spheres of a given set of points’, in and (eds.), Curves and Surfaces, Academic Press, Boston, MA, 1991, pp. 457-460. · doi:10.1016/B978-0-12-438660-0.50074-1 [61] Lasserre, J. Optimiz. Theory Appl. 39 pp 363– (1983) · Zbl 0487.52006 · doi:10.1007/BF00934543 [62] Mackinnon, Int. J. Numer. Meth. Eng. 24 pp 393– (1987) · Zbl 0602.73065 · doi:10.1002/nme.1620240209 [63] Cordes, Comput. Meth. Appl. Mech. Engng. 139 pp 75– (1996) · Zbl 0918.73331 · doi:10.1016/S0045-7825(96)01080-8 [64] Lo, Int. J. Numer. Meth. Engng. 28 pp 2695– (1989) · Zbl 0723.73085 · doi:10.1002/nme.1620281113 [65] Borgers, Comput. Math. Appl. 20 pp 45– (1990) · Zbl 0711.65122 · doi:10.1016/0898-1221(90)90347-M [66] Lyness, J. Inst. Math. Appl. 15 pp 19– (1975) · Zbl 0297.65018 · doi:10.1093/imamat/15.1.19 [67] Dunavant, Int. J. Numer. Meth. Engng. 21 pp 1129– (1985) · Zbl 0589.65021 · doi:10.1002/nme.1620210612 [68] , and , ’Triangular elements in plate bending. Conforming and non-conforming solutions’, Proc. 1st Conf. on Matrix Methods in Structural Mechanics, Wright-Patterson AFB, 1965. [69] and , ’Experience with the patch test for convergence of finite elements’, in (ed.), The Mathematical Foundations of the Finite Element Method with Applications to Partial Differential Equations, Academic Press, New York, 1972. [70] Felippa, Int. J. Numer. Meth. Engng. 38 pp 199– (1995) · Zbl 0822.73067 · doi:10.1002/nme.1620380204 [71] and , An Analysis of the Finite Element Method, Prentice-Hall, Englewood Cliffs, N.J., 1973. [72] Approximate Calculation of Multiple Integrals, Prentice-Hall, Englewood Cliffs, N.J., 1971. · Zbl 0379.65013 [73] Cools, J. Comput. Appl. Math. 23 pp 1– (1997) [74] Cools, ACM Trans. Math. Software 19 pp 309– (1997) [75] and , Theory of Elasticity, 3rd edn, McGraw Hill, New York, 1970. [76] and , Finite Element Analysis, Wiley, New York, 1991. [77] Micromechanics of Defects in Solids, Martinus Nijhoff, The Hague, Netherlands, 1987. · doi:10.1007/978-94-009-3489-4 [78] Moran, Engng. Fracture. Mech. 27 pp 615– (1987) · doi:10.1016/0013-7944(87)90155-X [79] and , The Stress Analysis of Cracks Handbook, Del Research Corporation, St. Louis, MO, 1977.
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.