A least squares radial basis function finite difference method with improved stability properties

03/06/2020
by   Igor Tominec, et al.
0

Localized collocation methods based on radial basis functions (RBFs) for elliptic problems appear to be non-robust in the presence of Neumann boundary conditions. In this paper we overcome this issue by formulating the RBF-generated finite difference method in a discrete least-squares setting instead. This allows us to prove high-order convergence under node refinement and to numerically verify that the least-squares formulation is more accurate and robust than the collocation formulation. The implementation effort for the modified algorithm is comparable to that for the collocation method.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

03/05/2021

An unfitted radial basis function generated finite difference method applied to thoracic diaphragm simulations

The thoracic diaphragm is the muscle that drives the respiratory cycle o...
07/15/2020

An unfitted RBF-FD method in a least-squares setting for elliptic PDEs on complex geometries

Radial basis function generated finite difference (RBF-FD) methods for P...
11/30/2019

WLS-ENO Remap: Superconvergent and Non-Oscillatory Weighted Least Squares Data Transfer on Surfaces

Data remap between non-matching meshes is a critical step in multiphysic...
10/08/2019

Error Bounds for a Least Squares Meshless Finite Difference Method on Closed Manifolds

We present an error bound for a least squares version of the kernel base...
04/14/2020

Adaptive radial basis function generated finite-difference (RBF-FD) on non-uniform nodes using p—refinement

Radial basis functions-generated finite difference methods (RBF-FDs) hav...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.