2020
DOI: 10.48550/arxiv.2003.03132
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

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

Abstract: 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 e… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

2
13
0

Year Published

2020
2020
2021
2021

Publication Types

Select...
3

Relationship

2
1

Authors

Journals

citations
Cited by 3 publications
(15 citation statements)
references
References 26 publications
2
13
0
Order By: Relevance
“…We noted in [17] that the X-points are supposed to be distributed such that the internodal distance is as uniform as possible, since the Lebesgue constants associated with the cardinal functions then stay fairly small. On the other hand the evaluation point set does not influence the magnitude of the Lebesgue constants but is instead important for the implicit integration that occurs when solving a discretized system of equations in the least-squares sense [17]. Thus the constraints for placing the evaluation points are far more forgiving.…”
Section: The Point Setsmentioning
confidence: 99%
See 3 more Smart Citations
“…We noted in [17] that the X-points are supposed to be distributed such that the internodal distance is as uniform as possible, since the Lebesgue constants associated with the cardinal functions then stay fairly small. On the other hand the evaluation point set does not influence the magnitude of the Lebesgue constants but is instead important for the implicit integration that occurs when solving a discretized system of equations in the least-squares sense [17]. Thus the constraints for placing the evaluation points are far more forgiving.…”
Section: The Point Setsmentioning
confidence: 99%
“…which are discrete inner products, to continuous inner products plus a first order integration error [17]. Secondly, the factor h −1 is used to impose the Dirichlet condition in a weak sense such that the matrix D h is nonsingular: this is a classical approach in those finite element methods which use a solution space that does not exactly satisfy the Dirichlet condition.…”
Section: The Unfitted Discretization Of a Pdementioning
confidence: 99%
See 2 more Smart Citations
“…This is an open problem not only for the method of this paper but also for all previous unsymmetric local meshless (RBF-based or else) methods. See [6,42] for recent attempts to tackle a similar problem in least squares settings for the RBF-FD method.…”
Section: Error and Stabilitymentioning
confidence: 99%