Fast approximation of the discrete Gauss transform in higher dimensions

dc.contributor.author	Griebel, Michael
dc.contributor.author	Wissel, Daniel
dc.date.accessioned	2024-08-26T13:44:14Z
dc.date.available	2024-08-26T13:44:14Z
dc.date.issued	10.2011
dc.identifier.uri	https://hdl.handle.net/20.500.11811/11959
dc.description.abstract	We present a novel approach for the fast approximation of the discrete Gauss transform in higher dimensions. The algorithm is based on the dual-tree technique and introduces a new Taylor series expansion. It compares favorably to existing methods especially when it comes to higher dimensions and a broad range of bandwidths. Numerical results with different datasets in up to 62 dimensions demonstrate its performance.	en
dc.format.extent	25
dc.language.iso	eng
dc.relation.ispartofseries	INS Preprints ; 1111
dc.rights	In Copyright
dc.rights.uri	http://rightsstatements.org/vocab/InC/1.0/
dc.subject	Gauss transform
dc.subject	fast approximation algorithms
dc.subject	high-dimensional
dc.subject.ddc	510 Mathematik
dc.subject.ddc	518 Numerische Analysis
dc.title	Fast approximation of the discrete Gauss transform in higher dimensions
dc.type	Preprint
dc.publisher.name	Institut für Numerische Simulation (INS)
dc.publisher.location	Bonn
dc.rights.accessRights	openAccess
dc.relation.doi	https://doi.org/10.1007/s10915-012-9626-3
ulbbn.pubtype	Zweitveröffentlichung
dcterms.bibliographicCitation.url	https://ins.uni-bonn.de/publication/preprints

The following license files are associated with this item: