...
首页> 外文期刊>Computer Methods in Applied Mechanics and Engineering >An inherently consistent reproducing kernel gradient smoothing framework toward efficient Galerkin meshfree formulation with explicit quadrature
【24h】

An inherently consistent reproducing kernel gradient smoothing framework toward efficient Galerkin meshfree formulation with explicit quadrature

机译:一个固有的,一致的,可重现的内核梯度平滑框架,适用于具有明确正交的高效Galerkin无网格公式

获取原文
获取原文并翻译 | 示例
           

摘要

A reproducing kernel gradient smoothing framework with explicit quadrature rules is proposed for efficient Galerkin meshfree formulation. In this framework, the meshfree smoothed gradients are formulated via a reproducing kernel representation of the standard gradients of field variables. It is interesting to find that this reproducing kernel construction of smoothed gradients of meshfree shape functions enables an identical satisfaction of the integration constraint derived from Galerkin meshfree formulation. In other words, the integration consistency is an inherent property of the proposed reproducing kernel gradient smoothing methodology regardless of integration schemes. Consequently, without violation of the integration constraint, the conventional normal low order Gauss quadrature rules in finite element analysis now can be used to properly integrate the meshfree stiffness matrix simply through replacing the standard meshfree gradients with the reproducing kernel smoothed gradients at Gauss points. In order to efficiently compute the reproducing kernel smoothed gradients, a set of explicit quadrature rules referring to 2D triangular and 3D tetrahedral integration cells are systematically developed. The total number of sample points associated with these quadrature rules is minimized from a global point of view through introducing an equivalent number of sample points, which implies as many as sample points are shared by neighboring integration cells. The proposed methodology recovers the stabilized conforming nodal integration when linear basis function is employed, while the focus of the present work is multidimensional higher order basis functions such as quadratic and cubic ones. Superior convergence, accuracy as well as efficiency performances of the proposed reproducing kernel gradient smoothing framework are thoroughly demonstrated by a series of numerical examples. (C) 2019 Elsevier B.V. All rights reserved.
机译:提出了具有显式正交规则的再生核梯度平滑框架,以实现有效的Galerkin无网格公式。在此框架中,无网格的平滑梯度是通过场变量标准梯度的再生核表示来制定的。有趣的是,这种无网格形状函数的平滑梯度的重现内核构造可以使从Galerkin无网格公式得出的积分约束完全相同。换句话说,与集成方案无关,集成一致性是所提出的再现内核梯度平滑方法的固有特性。因此,在不违反积分约束的情况下,现在只需将标准无网格渐变替换为高斯点处的可再生内核平滑渐变,即可将有限元分析中常规的常规低阶高斯正交规则用于正确地集成无网格刚度矩阵。为了有效地计算再现核平滑梯度,系统地开发了一组涉及2D三角形和3D四面体积分单元的显式正交规则。从全局的角度来看,通过引入等效数量的采样点,可以将与这些正交规则关联的采样点的总数减到最少,这意味着相邻积分单元将共享尽可能多的采样点。当采用线性基函数时,所提出的方法恢复了稳定的一致节点积分,而本工作的重点是多维高阶基函数,例如二次函数和三次函数。通过一系列数值示例,充分证明了所提出的再现内核梯度平滑框架的优异收敛性,准确性以及效率性能。 (C)2019 Elsevier B.V.保留所有权利。

著录项

相似文献

  • 外文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号