Refine
Document Type
- Article (135)
- Conference Proceeding (1)
Institute
- Institut für Strukturmechanik (ISM) (136) (remove)
Keywords
- Angewandte Mathematik (118)
- Strukturmechanik (117)
- Stochastik (17)
- Finite-Elemente-Methode (4)
- Wärmeleitfähigkeit (4)
- Biodiesel (2)
- Bruchmechanik (2)
- Elastizität (2)
- Fehlerabschätzung (2)
- Maschinelles Lernen (2)
- OA-Publikationsfonds2018 (2)
- Optimierung (2)
- Transfer learning (2)
- ANN modeling (1)
- Activation function (1)
- Angewandte Informatik (1)
- Architektur <Informatik> (1)
- Artificial Intelligence (1)
- Batterie (1)
- Bornitrid (1)
- Chirurgie (1)
- Collocation method (1)
- Computer Science Models in Engineering; Multiscale and Multiphysical Models; Scientific Computing (1)
- Computerunterstütztes Verfahren (1)
- Deep learning (1)
- Domain Adaptation (1)
- Druckluft (1)
- Energiespeicherung (1)
- Feststoff (1)
- Graphen (1)
- Graphene (1)
- Kaverne (1)
- Kollokationsmethode (1)
- MDLSM method (1)
- Mechanische Eigenschaft (1)
- MoS2 (1)
- Modellierung (1)
- Molekülstruktur (1)
- Multi-objective Evolutionary Optimization, Elitist Non- Dominated Sorting Evolution Strategy (ENSES), Sandwich Structure, Pareto-Optimal Solutions, Evolutionary Algorithm (1)
- NURBS (1)
- NURBS geometry (1)
- Nanomechanik (1)
- Nanopore (1)
- Nanoporöser Stoff (1)
- Nanoribbons, thermal conductivity (1)
- Navier–Stokes equations (1)
- Neuronales Lernen (1)
- Peridynamik (1)
- Physikalische Eigenschaft (1)
- Potential problem (1)
- Riss (1)
- Schubspannung (1)
- Stahlbau (1)
- Steifigkeit (1)
- Werkstoff (1)
- biodiesel (1)
- deep learning (1)
- diesel engines (1)
- energy form (1)
- energy, exergy (1)
- explicit time integration (1)
- extreme learning machine (1)
- machine learning (1)
- mathematical modeling (1)
- molecular dynamics (1)
- nanoreinforced composites (1)
- neural architecture search (1)
- peridynamics (1)
- randomized spectral representation (1)
- response surface methodology (1)
- support vector machine (1)
- variational principle (1)
- weak form (1)
The node moving and multistage node enrichment adaptive refinement procedures are extended in mixed discrete least squares meshless (MDLSM) method for efficient analysis of elasticity problems. In the formulation of MDLSM method, mixed formulation is accepted to avoid second-order differentiation of shape functions and to obtain displacements and stresses simultaneously. In the refinement procedures, a robust error estimator based on the value of the least square residuals functional of the governing differential equations and its boundaries at nodal points is used which is inherently available from the MDLSM formulation and can efficiently identify the zones with higher numerical errors. The results are compared with the refinement procedures in the irreducible formulation of discrete least squares meshless (DLSM) method and show the accuracy and efficiency of the proposed procedures. Also, the comparison of the error norms and convergence rate show the fidelity of the proposed adaptive refinement procedures in the MDLSM method.
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.
The point collocation method of finite spheres (PCMFS) is used to model the hyperelastic response of soft biological tissue in real time within the framework of virtual surgery simulation. The proper orthogonal decomposition (POD) model order reduction (MOR) technique was used to achieve reduced-order model of the problem, minimizing computational cost. The PCMFS is a physics-based meshfree numerical technique for real-time simulation of surgical procedures where the approximation functions are applied directly on the strong form of the boundary value problem without the need for integration, increasing computational efficiency. Since computational speed has a significant role in simulation of surgical procedures, the proposed technique was able to model realistic nonlinear behavior of organs in real time. Numerical results are shown to demonstrate the effectiveness of the new methodology through a comparison between full and reduced analyses for several nonlinear problems. It is shown that the proposed technique was able to achieve good agreement with the full model; moreover, the computational and data storage costs were significantly reduced.
This paper proposes an adaptive atomistic- continuum numerical method for quasi-static crack growth. The phantom node method is used to model the crack in the continuum region and a molecular statics model is used near the crack tip. To ensure self-consistency in the bulk, a virtual atom cluster is used to model the material of the coarse scale. The coupling between the coarse scale and fine scale is realized through ghost atoms. The ghost atom positions are interpolated from the coarse scale solution and enforced as boundary conditions on the fine scale. The fine scale region is adaptively enlarged as the crack propagates and the region behind the crack tip is adaptively coarsened. An energy criterion is used to detect the crack tip location. The triangular lattice in the fine scale region corresponds to the lattice structure of the (111) plane of an FCC crystal. The Lennard-Jones potential is used to model the atom–atom interactions. The method is implemented in two dimensions. The results are compared to pure atomistic simulations; they show excellent agreement.