Monomial augmentation guidelines for RBF-FD from accuracy versus computational time perspective

From MaRDI portal
Publication:1996005

DOI10.1007/S10915-020-01401-YzbMATH Open1466.65213arXiv1909.01126OpenAlexW3131419467MaRDI QIDQ1996005FDOQ1996005

G. Kosec, Mitja Jančič, Jure Slak

Publication date: 2 March 2021

Published in: Journal of Scientific Computing (Search for Journal in Brave)

Abstract: Local meshless methods using RBFs augmented with monomials have become increasingly popular, due to the fact that they can be used to solve PDEs on scattered node sets in a dimension-independent way, with the ability to easily control the order of the method, but at a greater cost to execution time. We analyze this ability on a Poisson problem with mixed boundary conditions in 1D, 2D and 3D, and reproduce theoretical convergence orders practically, also in a dimension-independent manner, as demonstrated with a solution of Poisson's equation in an irregular 4D domain. The results are further combined with theoretical complexity analyses and with conforming execution time measurements, into a study of accuracy vs. execution time trade-off for each dimension. Optimal regimes of order for given target accuracy ranges are extracted and presented, along with guidelines for generalization.


Full work available at URL: https://arxiv.org/abs/1909.01126







Cites Work


Cited In (5)

Uses Software





This page was built for publication: Monomial augmentation guidelines for RBF-FD from accuracy versus computational time perspective

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1996005)