Corrected discrete least-squares meshless method for simulating free surface flows

被引:10
作者
Shobeyri, G. [1 ]
Afshar, M. H. [1 ,2 ]
机构
[1] Iran Univ Sci & Technol, Civil Eng Fac, Tehran 16846, Iran
[2] Iran Univ Sci & Technol, Envirohydroinformat COE, Tehran 16846, Iran
关键词
Discrete least-squares; Meshless method; Free surface flow; Moving least-squares; Navier-Stokes; PARTICLE SEMIIMPLICIT METHOD; FINITE-ELEMENT-METHOD; WAVES; VOLUME;
D O I
10.1016/j.enganabound.2012.04.013
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
In this paper, a modified version of discrete least-squares meshless (DLSM) method is used to simulate free surface flows with moving boundaries. DLSM is a newly developed meshless approach in which a least-squares functional of the residuals of the governing differential equations and its boundary conditions at the nodal points is minimized with respect to the unknown nodal parameters. The meshless shape functions are also derived using the Moving Least Squares (MLS) method of function approximation. The method is, therefore, a truly meshless method in which no integration is required in the computations. Since the second order derivative of the MLS shape function are known to contain higher errors compared to the first derivative, a modified version of DLSM method referred to as corrected discrete least-squares meshless (corrected DLSM) is proposed in which the second order derivatives are evaluated more accurately and efficiently by combining the first order derivatives of MLS shape functions with a finite difference approximation of the second derivatives. The governing equations of fluid flow (Navier-Stokes) are solved by the proposed method using a two-step pressure projection method in a Lagrangian form. Three benchmark problems namely; dam break, underwater rigid landslide and Scott Russell wave generator problems are used to test the accuracy of the proposed approach. The results show that proposed corrected DLSM can be employed to simulate complex free surface flows more accurately. (c) 2012 Elsevier Ltd. All rights reserved.
引用
收藏
页码:1581 / 1594
页数:14
相关论文
共 50 条
[21]   Discrete mixed subdomain least squares (DMSLS) meshless method with collocation points for modeling dam-break induced flows [J].
Malidareh, Babak Fazli ;
Hosseini, Seyed Abbas ;
Jabbari, Ebrahim .
JOURNAL OF HYDROINFORMATICS, 2016, 18 (04) :702-723
[22]   DISCRETE LEAST SQUARES MESHLESS METHOD FOR MODELING 2D CRACK PROBLEMS [J].
Arzani, H. ;
Mobaraki, M. ;
Torabi, M. .
PARTICLE-BASED METHODS III: FUNDAMENTALS AND APPLICATIONS, 2013, :734-745
[24]   A node enrichment adaptive refinement in Discrete Least Squares Meshless method for solution of elasticity problems [J].
Afshar, M. H. ;
Amani, J. ;
Naisipour, M. .
ENGINEERING ANALYSIS WITH BOUNDARY ELEMENTS, 2012, 36 (03) :385-393
[25]   Adaptive simulation of two dimensional hyperbolic problems by Collocated Discrete Least Squares Meshless method [J].
Afshar, Mohammad Hadi ;
Firoozjaee, Ali Rahmani .
COMPUTERS & FLUIDS, 2010, 39 (10) :2030-2039
[26]   Discrete least squares meshless method with sampling points for the solution of elliptic partial differential equations [J].
Firoozjaee, Ali Rahmani ;
Afshar, Mohammad Hadi .
ENGINEERING ANALYSIS WITH BOUNDARY ELEMENTS, 2009, 33 (01) :83-92
[27]   A trimmed moving total least-squares method for curve and surface fitting [J].
Gu, Tianqi ;
Tu, Yi ;
Tang, Dawei ;
Lin, Shuwen ;
Fang, Bing .
MEASUREMENT SCIENCE AND TECHNOLOGY, 2020, 31 (04)
[28]   A Meshless Local Petrov-Galerkin Shepard and Least-Squares Method Based on Duo Nodal Supports [J].
Zhuang, Xiaoying ;
Cai, Yongchang .
MATHEMATICAL PROBLEMS IN ENGINEERING, 2014, 2014
[29]   A least-squares coupling method between a finite element code and a discrete element code [J].
Christian, Mariotti ;
Francoise, Le Piver ;
Ludovic, Aubry .
INTERNATIONAL JOURNAL FOR NUMERICAL METHODS IN ENGINEERING, 2015, 101 (10) :731-743
[30]   An Improved Discrete Least-Squares/Reduced-Basis Method for Parameterized Elliptic PDEs [J].
Gunzburger, Max ;
Schneier, Michael ;
Webster, Clayton ;
Zhang, Guannan .
JOURNAL OF SCIENTIFIC COMPUTING, 2019, 81 (01) :76-91