### Refine

#### Has Fulltext

- no (118) (remove)

#### Document Type

- Article (117)
- Conference Proceeding (1)

#### Institute

#### Keywords

- Angewandte Mathematik (118) (remove)

The upper limit of the thermal conductivity and the mechanical strength are predicted for the polyethylene chain, by performing the ab initio calculation and applying the quantum mechanical non-equilibrium Green’s function approach. Specially, there are two main findings from our calculation: (1) the thermal conductivity can reach a high value of 310 Wm−1 K−1 in a 100 nm polyethylene chain at room temperature and the thermal conductivity increases with the length of the chain; (2) the Young’s modulus in the polyethylene chain is as high as 374.5 GPa, and the polyethylene chain can sustain 32.85%±0.05% (ultimate) strain before undergoing structural phase transition into gaseous ethylene.

This paper presents a novel numerical procedure based on the framework of isogeometric analysis for static, free vibration, and buckling analysis of laminated composite plates using the first-order shear deformation theory. The isogeometric approach utilizes non-uniform rational B-splines to implement for the quadratic, cubic, and quartic elements. Shear locking problem still exists in the stiffness formulation, and hence, it can be significantly alleviated by a stabilization technique. Several numerical examples are presented to show the performance of the method, and the results obtained are compared with other available ones.

We perform both classical molecular dynamics simulations and beam model calculations to investigate the Young's modulus of kinked silicon nanowires (KSiNWs). The Young's modulus is found to be highly sensitive to the arm length of the kink and is essentially inversely proportional to the arm length. The mechanism underlying the size dependence is found to be the interplay between the kink angle potential and the arm length potential, where we obtain an analytic relationship between the Young's modulus and the arm length of the KSiNW. Our results provide insight into the application of this novel building block in nanomechanical devices.

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.

Meshfree methods (MMs) such as the element free Galerkin (EFG)method have gained popularity because of some advantages over other numerical methods such as the finite element method (FEM). A group of problems that have attracted a great deal of attention from the EFG method community includes the treatment of large deformations and dealing with strong discontinuities such as cracks. One efficient solution to model cracks is adding special enrichment functions to the standard shape functions such as extended FEM, within the FEM context, and the cracking particles method, based on EFG method. It is well known that explicit time integration in dynamic applications is conditionally stable. Furthermore, in enriched methods, the critical time step may tend to very small values leading to computationally expensive simulations. In this work, we study the stability of enriched MMs and propose two mass-lumping strategies. Then we show that the critical time step for enriched MMs based on lumped mass matrices is of the same order as the critical time step of MMs without enrichment. Moreover, we show that, in contrast to extended FEM, even with a consistent mass matrix, the critical time step does not vanish even when the crack directly crosses a node.

Isogeometric finite element analysis has become a powerful alternative to standard finite elements due to their flexibility in handling complex geometries. One major drawback of NURBS based isogeometric finite elements is their less effectiveness of local refinement. In this study, we present an alternative to NURBS based isogeometric finite elements that allow for local refinement. The idea is based on polynomial splines and exploits the flexibility of T-meshes for local refinement. The shape functions satisfy important properties such as non-negativity, local support and partition of unity. We will demonstrate the efficiency of the proposed method by two numerical examples.

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.