Higher order meshless schemes applied to the finite element method in elliptic problems. (1st February 2019)

• Record Type: Journal Article
• Authors: Milewski, Sławomir; Putanowicz, Roman
• Is Part Of: Computers & mathematics with applications. Volume 77:issue 3(2019)
• Page Start: 779
• Page End: 802
• Publication Date: 2019-02-01
• Subjects: Finite element method -- Meshless methods -- Meshless finite difference method -- Higher order approximation -- Elliptic problems; Electronic data processing -- Periodicals; Mathematics -- Data processing -- Periodicals; 510.28541
• DOI: 10.1016/j.camwa.2018.10.016
• Languages: English
• ISSNs: 0898-1221

Abstract

Abstract: This paper presents selected approximation techniques, typical for the meshless finite difference method (MFDM), although applied to the finite element method (FEM). Finite elements with standard or hierarchical shape functions are coupled with higher order meshless schemes, based upon the correction terms of a simple difference operator. Those terms consist of higher order derivatives, which are evaluated by means of the appropriate formulas composition as well as a numerical solution, which corresponds to the primary interpolation order, assigned to element shape functions. Correction terms modify the right-hand sides of algebraic FE equations only, yielding an iterative procedure. Therefore, neither re-generation of the stiffness matrix nor introduction of any additional nodes and/or degrees of freedom is required. Such improved FE-MFD solution approach allows for the optimal application of advantages of both methods, for instance, a high accuracy of the nodal FE solution and a derivatives' super-convergence phenomenon at arbitrary domain points, typical for the meshless FDM. Existing and proposed higher order techniques, applied in the FEM, are compared with each other in terms of the solution accuracy, algorithm efficiency and computational complexity. In order to examine the considered algorithms, numerical results of several two-dimensional benchmark elliptic problems are presented. Both the accuracy of a solution and the solution's derivatives as well as their convergence rates, evaluated on irregular and structured meshes as well as arbitrarily irregular adaptive clouds of nodes, are taken into account.