Network


Latest external collaboration on country level. Dive into details by clicking on the dots.

Hotspot


Dive into the research topics where N. Sukumar is active.

Publication


Featured researches published by N. Sukumar.


Computer Methods in Applied Mechanics and Engineering | 2001

MODELING HOLES AND INCLUSIONS BY LEVEL SETS IN THE EXTENDED FINITE-ELEMENT METHOD

N. Sukumar; David L. Chopp; Nicolas Moës; Ted Belytschko

A methodology to model arbitrary holes and material interfaces (inclusions) without meshing the internal boundaries is proposed. The numerical method couples the level set method (S. Osher, J.A. Sethian, J. Comput. Phys. 79 (1) (1988) 12) to the extended finite-element method (X-FEM) (N. Moes, J. Dolbow, T. Belytschko, Int. J. Numer. Methods Engrg. 46 (1) (1999) 131). In the X-FEM, the finite-element approximation is enriched by additional functions through the notion of partition of unity. The level set method is used for representing the location of holes and material interfaces, and in addition, the level set function is used to develop the local enrichment for material interfaces. Numerical examples in two-dimensional linear elastostatics are presented to demonstrate the accuracy and potential of the new technique.


International Journal for Numerical Methods in Engineering | 2000

Extended finite element method for three‐dimensional crack modelling

N. Sukumar; N. Mos; B. Moran; Ted Belytschko

An extended finite element method (X-FEM) for three-dimensional crack modelling is described. A discontinuous function and the two-dimensional asymptotic crack-tip displacement fields are added to the finite element approximation to account for the crack using the notion of partition of unity. This enables the domain to be modelled by finite elements with no explicit meshing of the crack surfaces. Computational geometry issues associated with the representation of the crack and the enrichment of the finite element approximation are discussed. Stress intensity factors (SIFs) for planar three-dimensional cracks are presented, which are found to be in good agreement with benchmark solutions. Copyright


International Journal for Numerical Methods in Engineering | 2000

Arbitrary branched and intersecting cracks with the extended finite element method

Christophe Daux; Nicolas Moës; John E. Dolbow; N. Sukumar; Ted Belytschko

SUMMARY Extensions of a new technique for the nite element modelling of cracks with multiple branches, multiple holes and cracks emanating from holes are presented. This extended nite element method (X-FEM) allows the representation of crack discontinuities and voids independently of the mesh. A standard displacementbased approximation is enriched by incorporating discontinuous elds through a partition of unity method. A methodology that constructs the enriched approximation based on the interaction of the discontinuous geometric features with the mesh is developed. Computation of the stress intensity factors (SIF) in dierent examples involving branched and intersecting cracks as well as cracks emanating from holes are presented to demonstrate the accuracy and the robustness of the proposed technique. Copyright ? 2000 John Wiley & Sons, Ltd.


International Journal for Numerical Methods in Engineering | 1998

THE NATURAL ELEMENT METHOD IN SOLID MECHANICS

N. Sukumar; B. Moran; Ted Belytschko

The application of the Natural Element Method (NEM) 1; 2 to boundary value problems in two-dimensional small displacement elastostatics is presented. The discrete model of the domain consists of a set of distinct nodes N, and a polygonal description of the boundary @. In the Natural Element Method, the trial and test functions are constructed using natural neighbour interpolants. These interpolants are based on the Voronoi tessellation of the set of nodes N. The interpolants are smooth (C 1 ) everywhere, except at the nodes where they are C 0 . In one-dimension, NEM is identical to linear nite elements. The NEM interpolant is strictly linear between adjacent nodes on the boundary of the convex hull, which facilitates imposition of essential boundary conditions. A methodology to model material discontinuities and non-convex bodies (cracks) using NEM is also described. A standard displacement-based Galerkin procedure is used to obtain the discrete system of linear equations. Application of NEM to various problems in solid mechanics, which include, the patch test, gradient problems, bimaterial interface, and a static crack problem are presented. Excellent agreement with exact (analytical) solutions is obtained, which exemplies the accuracy and robustness of NEM and suggests its potential application in the context of other classes of problems|crack growth, plates, and large deformations to name a few. ? 1998 John Wiley & Sons, Ltd.


International Journal for Numerical Methods in Engineering | 2001

Natural neighbour Galerkin methods

N. Sukumar; B. Moran; A. Yu Semenov; V. V. Belikov

SUMMARY Natural neighbour co-ordinates (Sibson co-ordinates) is a well-known interpolation scheme for multivariate data tting and smoothing. The numerical implementation of natural neighbour co-ordinates in a Galerkin method is known as the natural element method (NEM). In the natural element method, natural neighbour co-ordinates are used to construct the trial and test functions. Recent studies on NEM have shown that natural neighbour co-ordinates, which are based on the Voronoi tessellation of a set of nodes, are an appealing choice to construct meshless interpolants for the solution of partial dierential equations. In Belikov et al. (Computational Mathematics and Mathematical Physics 1997; 37(1):9{15), a new interpolation scheme (non-Sibsonian interpolation) based on natural neighbours was proposed. In the present paper, the nonSibsonian interpolation scheme is reviewed and its performance in a Galerkin method for the solution of elliptic partial dierential equations that arise in linear elasticity is studied. A methodology to couple nite elements to NEM is also described. Two signicant advantages of the non-Sibson interpolant over the Sibson interpolant are revealed and numerically veried: the computational eciency of the non-Sibson algorithm in 2-dimensions, which is expected to carry over to 3-dimensions, and the ability to exactly impose essential boundary conditions on the boundaries of convex and non-convex domains. Copyright ? 2001 John Wiley & Sons, Ltd.


Engineering Fracture Mechanics | 2003

Extended finite element method and fast marching method for three-dimensional fatigue crack propagation

N. Sukumar; David L. Chopp; B. Moran

A numerical technique for planar three-dimensional fatigue crack growth simulations is proposed. The new technique couples the extended finite element method (X-FEM) to the fast marching method (FMM). In the X-FEM, a discontinuous function and the two-dimensional asymptotic crack-tip displacement fields are added to the finite element approximation to account for the crack using the notion of partition of unity. This enables the domain to be modeled by finite elements with no explicit meshing of the crack surfaces. The initial crack geometry is represented by level set functions, and subsequently signed distance functions are used to compute the enrichment functions that appear in the displacement-based finite element approximation. The FMM in conjunction with the Paris crack growth law is used to advance the crack front. Stress intensity factors for planar three-dimensional cracks are computed, and fatigue crack growth simulations for planar cracks are presented. Good agreement between the numerical results and theory is realized.


Archives of Computational Methods in Engineering | 2006

Recent advances in the construction of polygonal finite element interpolants

N. Sukumar; E.A. Malsch

SummaryThis paper is an overview of recent developments in the construction of finite element interpolants, which areC0-conforming on polygonal domains. In 1975, Wachspress proposed a general method for constructing finite element shape functions on convex polygons. Only recently has renewed interest in such interpolants surfaced in various disciplines including: geometric modeling, computer graphics, and finite element computations. This survey focuses specifically on polygonal shape functions that satisfy the properties of barycentric coordinates: (a) form a partition of unity, and are non-negative; (b) interpolate nodal data (Kronecker-delta property), (c) are linearly complete or satisfy linear precision, and (d) are smooth within the domain. We compare and contrast the construction and properties of various polygonal interpolants—Wachspress basis functions, mean value coordinates, metric coordinate method, natural neighbor-based coordinates, and maximum entropy shape functions. Numerical integration of the Galerkin weak form on polygonal domains is discussed, and the performance of these polygonal interpolants on the patch test is studied.


Archives of Computational Methods in Engineering | 2003

Overview and recent advances in natural neighbour galerkin methods

Elías Cueto; N. Sukumar; B. Calvo; M.A. Martínez; J. Cegoñino; M. Doblaré

SummaryIn this paper, a survey of the most relevant advances in natural neighbour Galerkin methods is presented. In these methods (also known as natural element methods, NEM), the Sibson and the Laplace (non-Sibsonian) interpolation schemes are used as trial and test functions in a Galerkin procedure. Natural neighbour-based methods have certain unique features among the wide family of so-called meshless methods: a well-defined and robust approximation with no user-defined parameters on non-uniform grids, and the ability to exactly impose essential (Dirichlet) boundary conditions are particularly noteworthy.A comprehensive review of the method is conducted, including a description of the Sibson and the Laplace interpolants in two- and three-dimensions. Application of the NEM to linear and non-linear problems in solid as well as fluid mechanics is studied. Other issues that are pertinent to the vast majority of meshless methods, such as numerical quadrature, imposing essential boundary conditions, and the handling of secondary variables are also addressed. The paper is concluded with some benchmark computations that demonstrate the accuracy and the key advantages of this numerical method.


International Journal of Engineering Science | 2003

Fatigue crack propagation of multiple coplanar cracks with the coupled extended finite element/fast marching method

David L. Chopp; N. Sukumar

A numerical technique for modeling fatigue crack propagation of multiple coplanar cracks is presented. The proposed method couples the extended finite element method (X-FEM) [Int. J. Numer. Meth. Engng. 48 (11) (2000) 1549] to the fast marching method (FMM) [Level Set Methods & Fast Marching Methods: Evolving Interfaces in Computational Geometry, Fluid Mechanics, Computer Vision, and Materials Science, Cambridge University Press, Cambridge, UK, 1999]. The entire crack geometry, including one or more cracks, is represented by a single signed distance (level set) function. Merging of distinct cracks is handled naturally by the FMM with no collision detection or mesh reconstruction required. The FMM in conjunction with the Paris crack growth law is used to advance the crack front. In the X-FEM, a discontinuous function and the two-dimensional asymptotic crack-tip displacement fields are added to the finite element approximation to account for the crack using the notion of partition of unity [Comput. Meth. Appl. Mech. Engng. 139 (1996) 289]. This enables the domain to be modeled by a single fixed finite element mesh with no explicit meshing of the crack surfaces. In an earlier study [Engng. Fract. Mech. 70 (1) (2003) 29], the methodology, algorithm, and implementation for three-dimensional crack propagation of single cracks was introduced. In this paper, simulations for multiple planar cracks are presented, with crack merging and fatigue growth carried out without any user-intervention or remeshing.


symposium on geometry processing | 2008

Maximum entropy coordinates for arbitrary polytopes

Kai Hormann; N. Sukumar

Barycentric coordinates can be used to express any point inside a triangle as a unique convex combination of the triangles vertices, and they provide a convenient way to linearly interpolate data that is given at the vertices of a triangle. In recent years, the ideas of barycentric coordinates and barycentric interpolation have been extended to arbitrary polygons in the plane and general polytopes in higher dimensions, which in turn has led to novel solutions in applications like mesh parameterization, image warping, and mesh deformation. In this paper we introduce a new generalization of barycentric coordinates that stems from the maximum entropy principle. The coordinates are guaranteed to be positive inside any planar polygon, can be evaluated efficiently by solving a convex optimization problem with Newtons method, and experimental evidence indicates that they are smooth inside the domain. Moreover, the construction of these coordinates can be extended to arbitrary polyhedra and higher‐dimensional polytopes.

Collaboration


Dive into the N. Sukumar's collaboration.

Top Co-Authors

Avatar

S. E. Mousavi

University of California

View shared research outputs
Top Co-Authors

Avatar
Top Co-Authors

Avatar

John E. Pask

Lawrence Livermore National Laboratory

View shared research outputs
Top Co-Authors

Avatar

B. Moran

Northwestern University

View shared research outputs
Top Co-Authors

Avatar
Top Co-Authors

Avatar

Nicolas Moës

École centrale de Nantes

View shared research outputs
Top Co-Authors

Avatar

Alireza Tabarraei

University of North Carolina at Charlotte

View shared research outputs
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Researchain Logo
Decentralizing Knowledge