Overlap Splines and Meshless Finite Difference Methods

06/04/2023
by   Oleg Davydov, et al.
0

We consider overlap splines that are defined by connecting the patches of piecewise functions via common values at given finite sets of nodes, without using any partitions of the computational domain. It is shown that some classical finite difference methods can be interpreted as collocation with overlap splines. Moreover, several versions of the meshless finite difference methods, such as the RBF-FD method, are equivalent to the collocation or discrete least squares with overlap splines, for appropriately chosen patches.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/21/2023

Computational Electromagnetics with the RBF-FD Method

One of the most popular methods employed in computational electromagneti...
research
08/10/2021

A Note on Squares in Binary Words

We consider words over a binary alphabet. A word w is overlap-free if it...
research
02/08/2020

A new generalization of edge overlap to weighted networks

Finding the strength of an edge in a network has always been a big deman...
research
04/30/2019

Overlap Algebras: a constructive look at complete Boolean algebras

The notion of a complete Boolean algebra, although completely legitimate...
research
11/16/2020

Polynomial-time Tests for Difference Terms in Idempotent Varieties

We consider the following practical question: given a finite algebra A i...
research
02/13/2018

Hierarchical Overlap Graph

Given a set of finite words, the Overlap Graph (OG) is a complete weight...
research
11/09/2022

Complexity of solving a system of difference constraints with variables restricted to a finite set

Fishburn developed an algorithm to solve a system of m difference constr...

Please sign up or login with your details

Forgot password? Click here to reset