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.
2015
Proceedings of the 15th International Conference on Computational and Mathematical Methods in Science and Engineering
978-84-617-2230-3
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.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11577/3167968
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus ND
  • ???jsp.display-item.citation.isi??? ND
social impact