Compact moving least squares: An optimization framework for generating high-order compact meshless discretizations

Abstract

A generalization of the optimization framework typically used in moving least squares is presented that provides high-order approximation while maintaining compact stencils and a consistent treatment of boundaries. The approach, which we refer to as compact moving least squares, resembles the capabilities of compact finite differences but requires no structure in the underlying set of nodes. An efficient collocation scheme is used to demonstrate the capabilities of the method to solve elliptic boundary value problems in strong form stably without the need for an expensive weak form. The flexibility of the approach is demonstrated by using the same framework to both solve a variety of elliptic problems and to generate implicit approximations to derivatives. Finally, an efficient preconditioner is presented for the steady Stokes equations, and the approach's efficiency and high order of accuracy is demonstrated for domains with curvi-linear boundaries.

Asymptotically compatible meshfree discretization of state-based peridynamics for linearly elastic composite materials

“…For the governing equations, we will obtain a block structured matrix with respect to the displacements and dilitation. We solve this system with a Schur-complement preconditioner described in a previous work [18]. While an in-depth study of fast solvers for these problems is beyond the scope of this study, we note that the above strategy yields a roughly O(N logN ) scaling for problems with moderate Poisson ratio (i.e.…”

A compatible high-order meshless method for the Stokes equations with applications to suspension flows

“…where α i j are coefficients obtained from the solution to Equation 10. Details of how these coefficients are calculated can be found in our previous works [52,53]. Unlike standard finite Figure 1: A local primal-dual grid complex induced by a point x i and its ε-neighborhood N ε i .…”

A conservative lubrication dynamics method for the simulation of dense non-colloidal suspensions with particle spin

“…To deploy DNS of the suspension in a brute force manner, significantly high computational effort and resources are requiblack to adapt the mesh for moving boundaries and for mesh refinement and coarsening, which does eventually limit the system size and the time scales of the simulation. This is true also for the methods based on Lagrangian description of the solvent such as the Smoothed Particle Hydrodynamics (SPH) [14,15,16,17,18,19], if no proper treatment of the near-field hydrodynamic interaction is consideblack.…”