@article{JiangParkRabczuk,
  author    = {Jiang, Jin-Wu and Park, Harold S. and Rabczuk, Timon},
  title     = {Enhancing the mass sensitivity of graphene nanoresonators via nonlinear oscillations: The effective strain mechanism},
  series = {Nanotechnology},
  journal   = {Nanotechnology},
  abstract  = {Enhancing the mass sensitivity of graphene nanoresonators via nonlinear oscillations: The effective strain mechanism},
  subject      = {Angewandte Mathematik},
  language  = {en}
}
@article{ChenRabczukLiuetal.,
  author    = {Chen, Lei and Rabczuk, Timon and Liu, G.R. and Zeng, K.Y. and Kerfriden, Pierre and Bordas, St{\´e}phane Pierre Alain},
  title     = {Extended finite element method with edge-based strain smoothing (ESm-XFEM) for linear elastic crack growth},
  series = {Computer Methods in Applied Mechanics and Engineering},
  journal   = {Computer Methods in Applied Mechanics and Engineering},
  doi       = {10.1016/j.cma.2011.08.013},
  abstract  = {This paper presents a strain smoothing procedure for the extended finite element method (XFEM). The resulting "edge-based" smoothed extended finite element method (ESm-XFEM) is tailored to linear elastic fracture mechanics and, in this context, to outperform the standard XFEM. In the XFEM, the displacement-based approximation is enriched by the Heaviside and asymptotic crack tip functions using the framework of partition of unity. This eliminates the need for the mesh alignment with the crack and re-meshing, as the crack evolves. Edge-based smoothing (ES) relies on a generalized smoothing operation over smoothing domains associated with edges of simplex meshes, and produces a softening effect leading to a close-to-exact stiffness, "super-convergence" and "ultra-accurate" solutions. The present method takes advantage of both the ES-FEM and the XFEM. Thanks to the use of strain smoothing, the subdivision of elements intersected by discontinuities and of integrating the (singular) derivatives of the approximation functions is suppressed via transforming interior integration into boundary integration. Numerical examples show that the proposed method improves significantly the accuracy of stress intensity factors and achieves a near optimal convergence rate in the energy norm even without geometrical enrichment or blending correction.},
  subject      = {Angewandte Mathematik},
  language  = {en}
}
@article{ChauDinhZiLeeetal.,
  author    = {Chau-Dinh, T. and Zi, Goangseup and Lee, P.S. and Song, Jeong-Hoon and Rabczuk, Timon},
  title     = {Phantom-node method for shell models with arbitrary cracks},
  series = {Computers \& Structures},
  journal   = {Computers \& Structures},
  doi       = {10.1016/j.compstruc.2011.10.021},
  abstract  = {A phantom-node method is developed for three-node shell elements to describe cracks. This method can treat arbitrary cracks independently of the mesh. The crack may cut elements completely or partially. Elements are overlapped on the position of the crack, and they are partially integrated to implement the discontinuous displacement across the crack. To consider the element containing a crack tip, a new kinematical relation between the overlapped elements is developed. There is no enrichment function for the discontinuous displacement field. Several numerical examples are presented to illustrate the proposed method.},
  subject      = {Angewandte Mathematik},
  language  = {en}
}
@article{AreiasRabczukDiasdaCostaetal.,
  author    = {Areias, Pedro and Rabczuk, Timon and Dias-da-Costa, D. and Piresh, E.B.},
  title     = {Implicit solutions with consistent additive and multiplicative components},
  series = {Finite Elements in Analysis and Design},
  journal   = {Finite Elements in Analysis and Design},
  doi       = {10.1016/j.finel.2012.03.007},
  pages     = {15 -- 31},
  abstract  = {This work describes an algorithm and corresponding software for incorporating general nonlinear multiple-point equality constraints in a implicit sparse direct solver. It is shown that direct addressing of sparse matrices is possible in general circumstances, circumventing the traditional linear or binary search for introducing (generalized) constituents to a sparse matrix. Nested and arbitrarily interconnected multiple-point constraints are introduced by processing of multiplicative constituents with a built-in topological ordering of the resulting directed graph. A classification of discretization methods is performed and some re-classified problems are described and solved under this proposed perspective. The dependence relations between solution methods, algorithms and constituents becomes apparent. Fracture algorithms can be naturally casted in this framework. Solutions based on control equations are also directly incorporated as equality constraints. We show that arbitrary constituents can be used as long as the resulting directed graph is acyclic. It is also shown that graph partitions and orderings should be performed in the innermost part of the algorithm, a fact with some peculiar consequences. The core of our implicit code is described, specifically new algorithms for direct access of sparse matrices (by means of the clique structure) and general constituent processing. It is demonstrated that the graph structure of the second derivatives of the equality constraints are cliques (or pseudo-elements) and are naturally included as such. A complete algorithm is presented which allows a complete automation of equality constraints, avoiding the need of pre-sorting. Verification applications in four distinct areas are shown: single and multiple rigid body dynamics, solution control and computational fracture.},
  subject      = {Angewandte Mathematik},
  language  = {en}
}