Adaptive RBF-multiscale approximation on bounded domains
Federico Lot, Christian Rieger
Abstract
This article addresses adaptivity in the kernel multiscale method. Adaptively compressed kernel multiscale approximations have already been presented and analyzed in (LeGia & Wendland, 2014). The main contribution of this work is to attempt to avoid using function evaluations which will be deleted in the compression step anyways. In order to work with function values, we always work in the Lagrange representation. We still assume to have all function values available to compute error norms, but we do not include those values in our approximations. Finally, we also employ local Lagrange function to further reduce the numerical work.
Create a lesson
Related papers
Graph lattice sums and graph zeta functions for long-range interacting quantum lattice models
Andreas Alexander Buchheit, Andreas Rupp
A numerical benchmark for fluid--structure--contact interaction
Daniele Corti, Jakub Fara, Miguel Angel Fernández et al.
Largest-dihedral-angle bisection algorithm does not preserve mesh regularity for tetrahedral partitions
Sergey Korotov, Jérôme Michaud
A Highly Scalable Quantized Tensor-Train FDTD Framework for the Simulation of Three-Dimensional Electromagnetic Scattering Problems
Daan Vanhaecke, Emile Vanderstraeten, Dries Vande Ginste
Pressure-robustness by commuting interpolation operators for Stokes discretizations with continuous pressures
Philip L. Lederer, Theresa Vock
A Reynolds-Semi-Robust, Globally Divergence-Free HDG Method for the Smagorinsky Model
Shuaijun Liu, Xiaoping Xie