Discrete least squares meshless method

Last updated

In mathematics the discrete least squares meshless (DLSM) method is a meshless method based on the least squares concept. The method is based on the minimization of a least squares functional, defined as the weighted summation of the squared residual of the governing differential equation and its boundary conditions at nodal points used to discretize the domain and its boundaries.

Contents

Description

While most of the existing meshless methods need background cells for numerical integration, DLSM did not require a numerical integration procedure due to the use of the discrete least squares method to discretize the governing differential equation. A Moving least squares (MLS) approximation method is used to construct the shape function, making the approach a fully least squares-based approach.

Arzani and Afshar [1] developed the DLSM method in 2006 for the solution of Poisson's equation. Firoozjaee and Afshar [2] proposed the collocated discrete least squares meshless (CDLSM) method to solve elliptic partial differential equations, and studied the effect of the collocation points on the convergence and accuracy of the method. The method can be considered as an extension the earlier method of DLSM by the introduction of a set of collocation points for the calculation of the least squares functional.

CDLSM was later used by Naisipour et al. [3] to solve elasticity problems regarding the irregular distribution of nodal points. Afshar and Lashckarbolok used the CDLSM method for the adaptive simulation of hyperbolic problems. A simple a posteriori error indicator based on the value of the least squares functional and a node moving strategy was used and tested on 1-D hyperbolic problems. Shobeyri and Afshar simulated free surface problems using the DLSM method.

The method was then extended for adaptive simulation of two-dimensional shocked hyperbolic problems by Afshar and Firoozjaee. Also, adaptive node-moving refinement [4] and multi-stage node enrichment adaptive refinement [5] are formulated in the DLSM for the solution of elasticity problems.

Amani, Afshar and Naisipour. [6] proposed mixed discrete least squares meshless (MDLSM) formulation for solution of planar elasticity problems. In this approach, the differential equations governing the planar elasticity problems are written in terms of the stresses and displacements which are approximated independently using the same shape functions. Since the resulting governing equations are of the first order, both the displacement and stress boundary conditions are of the Dirichlet type, which is easily incorporated via a penalty method. Because this is a least squares based algorithm of the MDLSM method, the proposed method does not need to be satisfied by the LadyzhenskayaBabuška–Brezzi (LBB) condition.

Notes

  1. H. Arzani, M.H. Afshar, Solving Poisson’s equation by the discrete least square meshless method, WIT Transactions on Modelling and Simulation 42 (2006) 23–31.
  2. A.R. Firoozjaee, M.H. Afshar, Discrete least squares meshless method with sampling points for the solution of elliptic partial differential equations. Engineering Analysis with Boundary Elements 33 (2009) 83–92.
  3. M. Naisipour, M. H. Afshar, B. Hassani, A.R. Firoozjaee, Collocation Discrete Least Square (CDLS) Method for Elasticity Problems. International Journal of Civil Engineering 7 (2009) 9–18.
  4. M.H.Afshar, M. Naisipour, J. Amani, Node moving adaptive refinement strategy for planar elasticity problems using discrete least squares meshless method, Finite Elements in Analysis and Design, 47, (2011) 1315–1325.
  5. M.H.Afshar, J. Amani, M. Naisipour, A node enrichment adaptive refinement by Discrete Least Squares Meshless method for solution of elasticity problems, Engineering Analysis with Boundary Elements, 36, (2012) 385–393.
  6. J. Amani, M.H.Afshar, M. Naisipour, Mixed Discrete Least Squares Meshless method for planar elasticity problems using regular and irregular nodal distributions, Engineering Analysis with Boundary Elements, 36, (2012) 894–902.

Related Research Articles

Partial differential equation Type of multivariable function

In mathematics, a partial differential equation (PDE) is an equation which imposes relations between the various partial derivatives of a multivariable function.

Structural analysis is the determination of the effects of loads on physical structures and their components. Structures subject to this type of analysis include all that must withstand loads, such as buildings, bridges, aircraft and ships. Structural analysis employs the fields of applied mechanics, materials science and applied mathematics to compute a structure's deformations, internal forces, stresses, support reactions, accelerations, and stability. The results of the analysis are used to verify a structure's fitness for use, often precluding physical tests. Structural analysis is thus a key part of the engineering design of structures.

Numerical methods for partial differential equations is the branch of numerical analysis that studies the numerical solution of partial differential equations (PDEs).

The boundary element method (BEM) is a numerical computational method of solving linear partial differential equations which have been formulated as integral equations, including fluid mechanics, acoustics, electromagnetics, fracture mechanics, and contact mechanics.

Analytic element method

The analytic element method (AEM) is a numerical method used for the solution of partial differential equations. It was initially developed by O.D.L. Strack at the University of Minnesota. It is similar in nature to the boundary element method (BEM), as it does not rely upon discretization of volumes or areas in the modeled system; only internal and external boundaries are discretized. One of the primary distinctions between AEM and BEMs is that the boundary integrals are calculated analytically.

The finite element method (FEM) is a powerful technique originally developed for numerical solution of complex problems in structural mechanics, and it remains the method of choice for complex systems. In the FEM, the structural system is modeled by a set of appropriate finite elements interconnected at discrete points called nodes. Elements may have physical properties such as thickness, coefficient of thermal expansion, density, Young's modulus, shear modulus and Poisson's ratio.

Computational electromagnetics Branch of physics

Computational electromagnetics (CEM), computational electrodynamics or electromagnetic modeling is the process of modeling the interaction of electromagnetic fields with physical objects and the environment.

Meshfree methods Methods in numerical analysis not requiring knowledge of neighboring points

In the field of numerical analysis, meshfree methods are those that do not require connection between nodes of the simulation domain, i.e. a mesh, but are rather based on interaction of each node with all its neighbors. As a consequence, original extensive properties such as mass or kinetic energy are no longer assigned to mesh elements but rather to the single nodes. Meshfree methods enable the simulation of some otherwise difficult types of problems, at the cost of extra computing time and programming effort. The absence of a mesh allows Lagrangian simulations, in which the nodes can move according to the velocity field.

In mathematics, the Trefftz method is a method for the numerical solution of partial differential equations named after the German mathematician Erich Trefftz(de) (1888–1937). It falls within the class of finite element methods.

In the numerical solution of partial differential equations, a topic in mathematics, the spectral element method (SEM) is a formulation of the finite element method (FEM) that uses high degree piecewise polynomials as basis functions. The spectral element method was introduced in a 1984 paper by A. T. Patera. Although Patera is credited with development of the method, his work was a rediscovery of an existing method

Finite element method Numerical method for solving physical or engineering problems

The finite element method (FEM) is a widely used method for numerically solving differential equations arising in engineering and mathematical modeling. Typical problem areas of interest include the traditional fields of structural analysis, heat transfer, fluid flow, mass transport, and electromagnetic potential.

hp-FEM is a general version of the finite element method (FEM), a numerical method for solving partial differential equations based on piecewise-polynomial approximations that employs elements of variable size (h) and polynomial degree (p). The origins of hp-FEM date back to the pioneering work of Barna A. Szabó and Ivo Babuška who discovered that the finite element method converges exponentially fast when the mesh is refined using a suitable combination of h-refinements (dividing elements into smaller ones) and p-refinements. The exponential convergence makes the method a very attractive choice compared to most other finite element methods which only converge with an algebraic rate. The exponential convergence of the hp-FEM was not only predicted theoretically but also observed by numerous independent researchers.

Singular boundary method

In numerical analysis, the singular boundary method (SBM) belongs to a family of meshless boundary collocation techniques which include the method of fundamental solutions (MFS), boundary knot method (BKM), regularized meshless method (RMM), boundary particle method (BPM), modified MFS, and so on. This family of strong-form collocation methods is designed to avoid singular numerical integration and mesh generation in the traditional boundary element method (BEM) in the numerical solution of boundary value problems with boundary nodes, in which a fundamental solution of the governing equation is explicitly known.

In applied mathematics, the boundary particle method (BPM) is a boundary-only meshless (meshfree) collocation technique, in the sense that none of inner nodes are required in the numerical solution of nonhomogeneous partial differential equations. Numerical experiments show that the BPM has spectral convergence. Its interpolation matrix can be symmetric.

In scientific computation and simulation, the method of fundamental solutions (MFS) is a technique for solving partial differential equations based on using the fundamental solution as a basis function. The MFS was developed to overcome the major drawbacks in the boundary element method (BEM) which also uses the fundamental solution to satisfy the governing equation. Consequently, both the MFS and the BEM are of a boundary discretization numerical technique and reduce the computational complexity by one dimensionality and have particular edge over the domain-type numerical techniques such as the finite element and finite volume methods on the solution of infinite domain, thin-walled structures, and inverse problems.

In numerical mathematics, the boundary knot method (BKM) is proposed as an alternative boundary-type meshfree distance function collocation scheme.

In numerical mathematics, the regularized meshless method (RMM), also known as the singular meshless method or desingularized meshless method, is a meshless boundary collocation method designed to solve certain partial differential equations whose fundamental solution is explicitly known. The RMM is a strong-form collocation method with merits being meshless, integration-free, easy-to-implement, and high stability. Until now this method has been successfully applied to some typical problems, such as potential, acoustics, water wave, and inverse problems of bounded and unbounded domains.

The Kansa method is a computer method used to solve partial differential equations. Its main advantage is it is very easy to understand and program on a computer. It is much less complicated than the finite element method. Another advantage is it works well on multi variable problems. The finite element method is complicated when working with more than 3 space variables and time.

The finite point method (FPM) is a meshfree method for solving partial differential equations (PDEs) on scattered distributions of points. The FPM was proposed in the mid-nineties in, and with the purpose to facilitate the solution of problems involving complex geometries, free surfaces, moving boundaries and adaptive refinement. Since then, the FPM has evolved considerably, showing satisfactory accuracy and capabilities to deal with different fluid and solid mechanics problems.

References