In this paper we propose a new stable and accurate approximation technique
which is extremely effective for interpolating large scattered data
sets. The Partition of Unity (PU) method is performed considering
Radial Basis Functions (RBFs) as local approximants and using locally
supported weights. In particular, the approach consists in computing,
for each \PU\ subdomain, a stable basis. Such technique, taking
advantage of the local scheme, leads to a significant benefit in
terms of stability, especially for flat kernels. Furthermore, an
optimized searching procedure is applied to build the local stable
bases, thus rendering the method more efficient.
%0 Journal Article
%1 cavoretto2016partition
%A Cavoretto, Roberto
%A De Marchi, Stefano
%A De Rossi, Alessandra
%A Perracchione, Emma
%A Santin, Gabriele
%D 2016
%J Applied Numerical Mathematics
%K from:mhartmann ians imported vorlaeufig
%R 10.1016/j.apnum.2016.07.005
%T Partition of unity interpolation using stable kernel-based techniques
%U http://dx.doi.org/10.1016/j.apnum.2016.07.005
%X In this paper we propose a new stable and accurate approximation technique
which is extremely effective for interpolating large scattered data
sets. The Partition of Unity (PU) method is performed considering
Radial Basis Functions (RBFs) as local approximants and using locally
supported weights. In particular, the approach consists in computing,
for each \PU\ subdomain, a stable basis. Such technique, taking
advantage of the local scheme, leads to a significant benefit in
terms of stability, especially for flat kernels. Furthermore, an
optimized searching procedure is applied to build the local stable
bases, thus rendering the method more efficient.
@article{cavoretto2016partition,
abstract = {In this paper we propose a new stable and accurate approximation technique
which is extremely effective for interpolating large scattered data
sets. The Partition of Unity (PU) method is performed considering
Radial Basis Functions (RBFs) as local approximants and using locally
supported weights. In particular, the approach consists in computing,
for each \{PU\} subdomain, a stable basis. Such technique, taking
advantage of the local scheme, leads to a significant benefit in
terms of stability, especially for flat kernels. Furthermore, an
optimized searching procedure is applied to build the local stable
bases, thus rendering the method more efficient.},
added-at = {2018-07-20T10:54:45.000+0200},
author = {Cavoretto, Roberto and De Marchi, Stefano and De Rossi, Alessandra and Perracchione, Emma and Santin, Gabriele},
biburl = {https://puma.ub.uni-stuttgart.de/bibtex/20e27505c1c32bbce6754aa22c0deedd9/mathematik},
doi = {10.1016/j.apnum.2016.07.005},
interhash = {13cf5c640ea3065dd8bff9d26fe8a600},
intrahash = {0e27505c1c32bbce6754aa22c0deedd9},
journal = {Applied Numerical Mathematics},
keywords = {from:mhartmann ians imported vorlaeufig},
owner = {santinge},
timestamp = {2019-12-18T14:37:55.000+0100},
title = {Partition of unity interpolation using stable kernel-based techniques},
url = {http://dx.doi.org/10.1016/j.apnum.2016.07.005},
year = 2016
}