paper-with-me

홈 › Papers

Multiscale scattered data analysis in samplet coordinates

2024-09-23 · Sara Avesani, Rüdiger Kempf, Michael Multerer, Holger Wendland

We study multiscale scattered data interpolation schemes for globally supported radial basis functions with focus on the Mat\'ern class. The multiscale approximation is constructed through a sequence of residual corrections, where radial basis functions with different lengthscale parameters are combined to capture varying levels of detail. We prove that the condition numbers of the the diagonal blocks of the corresponding multiscale system remain bounded independently of the particular level, allowing us to use an iterative solver with a bounded number of iterations for the numerical solution. Employing an appropriate diagonal scaling, the multiscale system becomes well conditioned. We exploit this fact to derive a general error estimate bounding the consistency error issuing from a numerical approximation of the multiscale system. To apply the multiscale approach to large data sets, we suggest to represent each level of the multiscale system in samplet coordinates. Samplets are localized, discrete signed measures exhibiting vanishing moments and allow for the sparse approximation of generalized Vandermonde matrices issuing from a vast class of radial basis functions. Given a quasi-uniform set of $N$ data sites, and local approximation spaces with exponentially decreasing dimension, the samplet compressed multiscale system can be assembled with cost $\mathcal{O}(N \log^2 N)$. The overall cost of the proposed approach is $\mathcal{O}(N \log^2 N)$. The theoretical findings are accompanied by extensive numerical studies in two and three spatial dimensions.

📄 PDF Abstract BibTeX arXiv:2409.14791

Code (0)

등록된 구현이 없습니다.

Methods 이 논문이 사용한 방법론

SET Dynamic Sparse Training method where weight mask is updated randomly periodically
Focus 설명 없음

Similar Papers 제목 키워드 기반

Samplet basis pursuit: Multiresolution scattered data approximation with sparsity constraints

2023-06-16 · Davide Baroli, Helmut Harbrecht, Michael Multerer

We consider scattered data approximation in samplet coordinates with $\ell_1$-regularization. The application of an $\ell_1$-regularization term enforces sparsity of the coefficients with respect to the samplet basis. Sa…

Data CompressionSurface Reconstruction

Multiresolution local smoothness detection in non-uniformly sampled multivariate signals

2025-07-17 · Sara Avesani, Gianluca Giacchi, Michael Multerer arxiv

Inspired by edge detection based on the decay behavior of wavelet coefficients, we introduce a (near) linear-time algorithm for detecting the local regularity in non-uniformly sampled multivariate signals. Our approach q…

Image SegmentationEdge DetectionPoint Clouds

Samplet limits and multiwavelets

2026-04-02 · Gianluca Giacchi, Michael Multerer, Jacopo Quizi arxiv

Samplets are data adapted multiresolution analyses of localized discrete signed measures. They can be constructed on scattered data sites in arbitrary dimension such that they exhibit vanishing moments with respect to an…

Bespoke multiresolution analysis of graph signals

2025-07-25 · Giacomo Elefante, Gianluca Giacchi, Michael Multerer, Jacopo Quizi arxiv

We present a novel framework for discrete multiresolution analysis of graph signals. The main analytical tool is the samplet transform, originally defined in the Euclidean framework as a discrete wavelet-like constructio…

Multiresolution kernel matrix algebra

2022-11-21 · H. Harbrecht, M. Multerer, O. Schenk, Ch. Schwab

We propose a sparse algebra for samplet compressed kernel matrices, to enable efficient scattered data analysis. We show the compression of kernel matrices by means of samplets produces optimally sparse matrices in a cer…