Robust node generation for mesh-free discretizations on irregular domains and surfaces

From MaRDI portal
Publication:4582847

DOI10.1137/17M114090XzbMATH Open1393.68177arXiv1806.02972OpenAlexW2964162159MaRDI QIDQ4582847FDOQ4582847


Authors: Varun Shankar, Robert M. Kirby, A. L. Fogelson Edit this on Wikidata


Publication date: 24 August 2018

Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)

Abstract: We present a new algorithm for the automatic one-shot generation of scattered node sets on irregular 2D and 3D domains using Poisson disk sampling coupled to novel parameter-free, high-order parametric Spherical Radial Basis Function (SBF)-based geometric modeling of irregular domain boundaries. Our algorithm also automatically modifies the scattered node sets locally for time-varying embedded boundaries in the domain interior. We derive complexity estimates for our node generator in 2D and 3D that establish its scalability, and verify these estimates with timing experiments. We explore the influence of Poisson disk sampling parameters on both quasi-uniformity in the node sets and errors in an RBF-FD discretization of the heat equation. In all cases, our framework requires only a small number of "seed" nodes on domain boundaries. The entire framework exhibits O(N) complexity in both 2D and 3D.


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




Recommendations




Cites Work


Cited In (24)

Uses Software





This page was built for publication: Robust node generation for mesh-free discretizations on irregular domains and surfaces

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