2000 character limit reached
Selection of Sparse Sets of Influence for Meshless Finite Difference Methods
Published 5 Aug 2019 in math.NA and cs.NA | (1908.01567v1)
Abstract: We suggest an efficient algorithm for the selection of sparse subsets of a set of influence for the numerical discretization of differential operators on irregular nodes with polynomial consistency of a given order with the help of the QR decomposition of an appropriately weighted polynomial collocation matrix, and prove that the accuracy of the resulting numerical differentiation formulas is comparable with that of the formulas generated on the original set of influence.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.