scispace - formally typeset
Open AccessJournal ArticleDOI

Imposing essential boundary conditions in mesh-free methods

TLDR
This paper presents a general overview on the existing techniques to enforce essential boundary conditions in Galerkin based mesh-free methods and special attention is paid to the mesh- free coupling with finite elements for the imposition of prescribed values and to methods based on a modification of theGalerkin weak form.
About
This article is published in Computer Methods in Applied Mechanics and Engineering.The article was published on 2004-03-26 and is currently open access. It has received 426 citations till now. The article focuses on the topics: Discontinuous Galerkin method & Boundary knot method.

read more

Citations
More filters
Journal ArticleDOI

Isogeometric analysis : CAD, finite elements, NURBS, exact geometry and mesh refinement

TL;DR: In this article, the concept of isogeometric analysis is proposed and the basis functions generated from NURBS (Non-Uniform Rational B-Splines) are employed to construct an exact geometric model.
Journal ArticleDOI

The extended/generalized finite element method: An overview of the method and its applications

TL;DR: An overview of the extended/generalized finite element method (GEFM/XFEM) with emphasis on methodological issues is presented in this article, which enables accurate approximation of solutions that involve jumps, kinks, singularities, and other locally non-smooth features within elements.
Journal ArticleDOI

Review: Meshless methods: A review and computer implementation aspects

TL;DR: This manuscript is to give a practical overview of meshless methods (for solid mechanics) based on global weak forms through a simple and well-structured MATLAB code, to illustrate the discourse.
Journal ArticleDOI

An Isogeometric design-through-analysis methodology based on adaptive hierarchical refinement of NURBS, immersed boundary methods, and T-spline CAD surfaces

TL;DR: It is shown that hierarchical refinement considerably increases the flexibility of this approach by adaptively resolving local features of NURBS, which combines full analysis suitability of the basis with straightforward implementation in tree data structures and simple generalization to higher dimensions.
Journal ArticleDOI

Local maximum-entropy approximation schemes : a seamless bridge between finite elements and meshfree methods

TL;DR: A one‐parameter family of approximation schemes that bridges continuously two important limits: Delaunay triangulation and maximum‐entropy (max‐ent) statistical inference are presented.
References
More filters
Journal ArticleDOI

Element‐free Galerkin methods

TL;DR: In this article, an element-free Galerkin method which is applicable to arbitrary shapes but requires only nodal data is applied to elasticity and heat conduction problems, where moving least-squares interpolants are used to construct the trial and test functions for the variational principle.
Journal ArticleDOI

Unified Analysis of Discontinuous Galerkin Methods for Elliptic Problems

TL;DR: In this paper, a framework for the analysis of a large class of discontinuous Galerkin methods for second-order elliptic problems is provided, which allows for the understanding and comparison of most of the discontinuous methods that have been proposed over the past three decades.
Journal ArticleDOI

Meshless methods: An overview and recent developments

TL;DR: Meshless approximations based on moving least-squares, kernels, and partitions of unity are examined and it is shown that the three methods are in most cases identical except for the important fact that partitions ofunity enable p-adaptivity to be achieved.
Journal ArticleDOI

Reproducing kernel particle methods

TL;DR: A new continuous reproducing kernel interpolation function which explores the attractive features of the flexible time-frequency and space-wave number localization of a window function is developed and is called the reproducingkernel particle method (RKPM).
Journal ArticleDOI

On the existence, uniqueness and approximation of saddle-point problems arising from lagrangian multipliers

Franco Brezzi
TL;DR: In this paper, the authors describe a fitting for hose end fittings that is suitable for use in conjunction with a cross-linked polyethylene hose or pipe, where a body incorporating a nipple adapted for insertion in a pipe end and a clamping ring normally retained on the body and adapted for clamping action about the outer surface of said pipe end is described.
Related Papers (5)
Frequently Asked Questions (13)
Q1. What is the advantage of Nitsche’s method?

The great advantage of Nitsche’s method is that parametric tuning can be done with only one scalar parameter β, in front of the difficult choice of the interpolation space for the Lagrange multiplier. 

If the penaltyparameter is constant, or proportional to h−1, the boundary error dominates and the optimal convergence rate is lost as h goes to zero. 

For increasing values, β plays the role of a penalty parameter, giving more weight to the verification of the boundary condition and, therefore, affecting to the solution in the rest of the domain. 

Transformation methods are usually employed in transient problems, or evolution problems, and transformation matrices are computedonly once. 

By introducing an extension of the dilation parameter at each particle, the mesh-free shape functions can be forced to verify the Kronecker delta property at the boundary [10]. 

For instance, in contact problems the interest of a finite element surface mesh is obvious and the advantage of enriching the area close to the boundary is crucial both for precision and large deformations. 

The discretization of the multiplier λ must be accurate enough in order to obtain an acceptable solution, but the resulting system of equations turns out to be singular if the number of Lagrange multipliers λi is too large. 

Given a set of particles xi in the domain Ω ⊂ Rn, mesh-less methods are based in a functional interpolation of the formu(x) ' uρ(x) = ∑ i Nρi (x)ui. 

This is the case of discretization (c) which corresponds to double the density of collocation points along the essential boundary. 

That is,u = arg min v∈H1(Ω)Π(v) + 12 β∫Γd(v − ud)2 dΓ. (18)The penalty parameter β is a positive scalar constant that must be large enough in order to impose the essential boundary condition with the desired accuracy. 

A simple 2D linear elasticity problem shows the major difficulties in the practical choice of the interpolation of the multiplier in particular situations. 

The solution of problem (6) can also be obtained as the solution of a minimization problem with constraints: “u minimizes the energy functionalΠ(v) = 12∫Ω ∇v · ∇v dΩ−∫Ω vf dΩ−∫Γn vgn dΓ, (12)and verifies the essential boundary conditions.” 

Nitsche’s weak form of this linear elasticity problem is∫Ω ε(v) : σ(u) dΩ−∫Γd(v ·n)(n ·σ(u) ·n) dΓ− ∫Γd(u ·n)(n ·σ(v) ·n) dΓ+ β ∫Γd(v · n)(u · n) dΓ = − ∫Γdgd(n · σ(v) · n) dΓ + β ∫Γdgd(v · n) dΓfor all v ∈ [H1(Ω)]nsd, where ε(v) is the strain tensor associated to the dis-placement v, and β is a large enough constant which ensures the coercivity of the bilinear form.