Pith. sign in

REVIEW

Convergence Analysis of Meshfree Approximation Schemes

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1107.6038 v1 pith:2NU3DULF submitted 2011-07-29 math.NA cs.NA

Convergence Analysis of Meshfree Approximation Schemes

classification math.NA cs.NA
keywords analysisconvergenceapproximationschemeschemessobolevbasisboundary
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

This work is concerned with the formulation of a general framework for the analysis of meshfree approximation schemes and with the convergence analysis of the Local Maximum-Entropy (LME) scheme as a particular example. We provide conditions for the convergence in Sobolev spaces of schemes that are n-consistent, in the sense of exactly reproducing polynomials of degree less or equal to n, and whose basis functions are of rapid decay. The convergence of the LME in a locally Sobolev space follows as a direct application of the general theory. The analysis shows that the convergence order is linear in h, a measure of the density of the point set. The analysis also shows how to parameterize the LME scheme for optimal convergence. Because of the convex approximation property of LME, its behavior near the boundary is singular and requires additional analysis. For the particular case of polyhedral domains we show that, away from a small singular part of the boundary, any Sobolev function can be approximated by means of the LME scheme. With the aid of a capacity argument, we further obtain approximation results with truncated LME basis functions in H1 and for spatial dimension d > 2.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.