We present an algorithm to approximate large dataset by Radial Basis Function (RBF) techniques. The method couples a fast domain decomposition procedure with a localized stabilization method. The resulting algorithm can efficiently deal with large problems and it is robust with respect to the typical instability of kernel methods.
RBF approximation of large datasets by partition of unity and local stabilization
DE MARCHI, STEFANO;SANTIN, GABRIELE
2015
Abstract
We present an algorithm to approximate large dataset by Radial Basis Function (RBF) techniques. The method couples a fast domain decomposition procedure with a localized stabilization method. The resulting algorithm can efficiently deal with large problems and it is robust with respect to the typical instability of kernel methods.
File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
Latex_template_cmmse.pdf
accesso aperto
Tipologia:
Postprint (accepted version)
Licenza:
Accesso gratuito
Dimensione
229.51 kB
Formato
Adobe PDF
|
229.51 kB | Adobe PDF | Visualizza/Apri |
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
