DeepAI AI Chat

Selection of Sparse Sets of Influence for Meshless Finite Difference Methods

08/05/2019

∙

by Oleg Davydov, et al.

∙

Universität Gießen

∙

∙

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.

page 1

page 2

page 3

page 4

∙ 02/13/2022

Improved Stencil Selection for Meshless Finite Difference Methods in 3D

We introduce a geometric stencil selection algorithm for Laplacian in 3D...

0 Oleg Davydov, et al. ∙

∙ 06/24/2020

Approximation with Conditionally Positive Definite Kernels on Deficient Sets

Interpolation and approximation of functionals with conditionally positi...

0 Oleg Davydov, et al. ∙

∙ 04/29/2019

Algorithmic approach to strong consistency analysis of finite difference approximations to PDE systems

For a wide class of polynomially nonlinear systems of partial differenti...

0 Vladimir P. Gerdt, et al. ∙

∙ 11/25/2018

Chordal Graphs in Triangular Decomposition in Top-Down Style

In this paper, we first prove that when the associated graph of a polyno...

0 Chenqi Mou, et al. ∙

∙ 01/12/2022

Sparse trace tests

We establish how the coefficients of a sparse polynomial system influenc...

0 Taylor Brysiewicz, et al. ∙

∙ 09/21/2018

New bounds and efficient algorithm for sparse difference resultant

Let P={P_0,P_1,...,P_n} be a generic Laurent transformally essential sys...

0 Chun-Ming Yuan, et al. ∙

∙ 07/26/2023

Costate Convergence with Legendre-Lobatto Collocation for Trajectory Optimization

This paper introduces a new method of discretization that collocates bot...

0 José Garrido, et al. ∙