{'fraction_non_alphanumeric': 0.02426837972876517, 'fraction_numerical': 0.0028551034975017845, 'mean_word_length': 5.839024390243902, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Local maximum‐entropy approximation schemes: a seamless bridge between finite elements and meshfree methods

We present a one‐parameter family of approximation schemes, which we refer to as local maximum‐entropy approximation schemes, that bridges continuously two important limits: Delaunay triangulation and maximum‐entropy (max‐ent) statistical inference. Local max‐ent approximation schemes represent a compromise—in the sense of Pareto optimality—between the competing objectives of unbiased statistical inference from the nodal data and the definition of local shape functions of least width. Local max‐ent approximation schemes are entirely defined by the node set and the domain of analysis, and the shape functions are positive, interpolate affine functions exactly, and have a weak Kronecker‐delta property at the boundary. Local max‐ent approximation may be regarded as a regularization, or thermalization, of Delaunay triangulation which effectively resolves the degenerate cases resulting from the lack or uniqueness of the triangulation. Local max‐ent approximation schemes can be taken as a convenient basis for the numerical solution of PDEs in the style of meshfree Galerkin methods. In test cases characterized by smooth solutions we find that the accuracy of local max‐ent approximation schemes is vastly superior to that of finite elements. Copyright © 2005 John Wiley & Sons, Ltd.