2009
DOI: 10.1002/nme.2597
|View full text |Cite
|
Sign up to set email alerts
|

Smooth, second order, non‐negative meshfree approximants selected by maximum entropy

Abstract: SUMMARYWe present a family of approximation schemes, which we refer to as second-order maximum-entropy (max-ent) approximation schemes, that extends the first-order local max-ent approximation schemes to second-order consistency. This method retains the fundamental properties of first-order max-ent schemes, namely the shape functions are smooth, non-negative, and satisfy a weak Kronecker-delta property at the boundary. This last property makes the imposition of essential boundary conditions in the numerical so… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

1
80
0

Year Published

2009
2009
2018
2018

Publication Types

Select...
8

Relationship

2
6

Authors

Journals

citations
Cited by 63 publications
(81 citation statements)
references
References 20 publications
1
80
0
Order By: Relevance
“…In [58] this formulation is extended to Stokes flow in two dimensions and three-dimensional incompressible elasticity and its stability is demonstrated through inf-sup numerical tests. High order max-ent schemes [59][60][61][62] would be another option in order to employ richer approximants for the velocities. However, such approximation schemes are not guaranteed to be LBBcompliant if coupled with constant or linear approximants for the pressure.…”
Section: Introductionmentioning
confidence: 99%
“…In [58] this formulation is extended to Stokes flow in two dimensions and three-dimensional incompressible elasticity and its stability is demonstrated through inf-sup numerical tests. High order max-ent schemes [59][60][61][62] would be another option in order to employ richer approximants for the velocities. However, such approximation schemes are not guaranteed to be LBBcompliant if coupled with constant or linear approximants for the pressure.…”
Section: Introductionmentioning
confidence: 99%
“…The above program is convex, smooth and feasible for any spa tial dimension d (as long as x 2 convX), and produces C 1 meshfree non negative functions p a ðxÞ [1]. Moreover, the constraints (con sistency conditions) guarantee solutions that reproduce exactly af fine functions (see [6,7,28,29] for higher order approaches). Duality methods provide an efficient route to solving the optimiza tion problem and computing almost explicitly p a ðxÞ at each evalu ation point x.…”
Section: Maximum Entropy Approximation Schemesmentioning
confidence: 99%
“…The non negativity and first order reproducing conditions endow these approximants with the structure of convex geometry [1], like linear finite ele ment, natural neighbor method [3], subdivision approximants [4], or B Spline and Non Uniform Rational B Splines (NURBS) basis functions [5]. Max ent approximants have been extended to second order [6,7], and to arbitrary order by dropping non negativity [8].…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…Compact support shape functions were then derived using Gaussian weight functions (or priors) in [35], work which was extended in [36] to any weight function (or generalized prior). Firstorder consistent max-ent shape functions [36] were then extended to second order in [37] and higher order in [38] and max-ent was used in [39] for the automatic calculation of the nodal domain of influence within a meshless method.…”
Section: Maximum Entropy Shape Functionsmentioning
confidence: 99%