MMMichael Multerer

Michael Multerer

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Michael Multerer has a total of 41 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Bespoke multiresolution analysis of graph signals

    by Giacomo Elefante, Gianluca Giacchi, Michael Multerer, Jacopo Quizi

  • Kernel Interpolation on Generalized Sparse Grids

    by Michael Griebel, Helmut Harbrecht, Michael Multerer

    We consider scattered data approximation on product regions of equal and different dimensionality. On each of these regions, we assume quasi-uniform but unstructured data sites and constru...


  • \({p}\)-Multilevel Monte Carlo for Acoustic Scattering from Large Deviation Rough Random Surfaces

    by Jürgen Dölz, Wei Huang, Michael Multerer

    We study time-harmonic acoustic scattering on large deviation rough random scatterers. Therein, the roughness of the scatterers is caused by a low Sobolev regularity in the covariance function of their deformation field. Concretely, we consider matrix-valued covariance functions whose components are given by Matérn covariance functions with small smoothness index. The low Sobolev regularity is reflected by a slow decay of the deformation field’s Karhunen–Loève expansion. The motivation for this study arises from physical phenomena where small-scale material defects can potentially introduce nonsmooth deviations from a reference domain. The primary challenge in this scenario is that the scattered wave is also random, which makes computational predictions unreliable. Therefore, it is essential to quantify these uncertainties to ensure robust and well-informed design processes. While existing methods for uncertainty quantification typically rely on domain mapping or perturbation approaches, it turns out that large and rough random deviations are not satisfactorily covered. To close this gap, and although counterintuitive at first, we show that the [Formula: see text]-multilevel Monte Carlo method can provide an efficient tool for uncertainty quantification in this setting. To this end, we discuss the stable implementation of higher-order polynomial approximation of the deformation field by means of barycentric interpolation and provide a cost-to-accuracy analysis. Our considerations are complemented by numerical experiments in three dimensions on an intricate scattering geometry.


  • Multiscale Scattered Data Analysis in Samplet Coordinates

    by 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érn 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 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 representing 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 [Formula: see text] data sites, and local approximation spaces with exponentially decreasing dimension, the samplet compressed multiscale system can be assembled with cost [Formula: see text]. The overall cost of the proposed approach is [Formula: see text]. The theoretical findings are accompanied by extensive numerical studies in two and three spatial dimensions.


  • Open Access

    Bespoke multiresolution analysis of graph signals

    by Giacomo Elefante, Gianluca Giacchi, Michael Multerer, Jacopo Quizi

    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 construction, tailored to the analysis of scattered data. The first contribution of this work is defining samplets on graphs. To this end, we subdivide the graph into a fixed number of patches, embed each patch into a Euclidean space, where we construct samplets, and eventually pull the construction back to the graph. This ensures orthogonality, locality, and the vanishing moments property with respect to properly defined polynomial spaces on graphs. Compared to classical Haar wavelets, this framework broadens the class of graph signals that can efficiently be compressed and analyzed. Along this line, we provide a definition of a class of signals that can be compressed using our construction. We support our findings with different examples of signals defined on graphs whose vertices lie on smooth manifolds. For efficient numerical implementation, we combine heavy edge clustering, to partition the graph into meaningful patches, with landmark \texttt{Isomap}, which provides low-dimensional embeddings for each patch. Our results demonstrate the method's robustness, scalability, and ability to yield sparse representations with controllable approximation error, significantly outperforming traditional Haar wavelet approaches in terms of compression efficiency and multiresolution fidelity.

  • Open Access

    Multiresolution local smoothness detection in non-uniformly sampled multivariate signals

    by Sara Avesani, Gianluca Giacchi, Michael Multerer

    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 quantifies regularity within the framework of microlocal spaces introduced by Jaffard. The central tool in our analysis is the fast samplet transform, a distributional wavelet transform tailored to scattered data. We establish a connection between the decay of samplet coefficients and the pointwise regularity of multivariate signals. As a by product, we derive decay estimates for functions belonging to classical Hölder spaces and Sobolev-Slobodeckij spaces. While traditional wavelets are effective for regularity detection in low-dimensional structured data, samplets demonstrate robust performance even for higher dimensional and scattered data. To illustrate our theoretical findings, we present extensive numerical studies detecting local regularity of one-, two- and three-dimensional signals, ranging from non-uniformly sampled time series over image segmentation to edge detection in point clouds.

  • Open Access

    Samplets: Wavelet concepts for scattered data

    by Helmut Harbrecht, Michael Multerer

    This chapter is dedicated to recent developments in the field of wavelet analysis for scattered data. We introduce the concept of samplets, which are signed measures of wavelet type and may be defined on sets of arbitrarily distributed data sites in possibly high dimension. By employing samplets, we transfer well-known concepts known from wavelet analysis, namely the fast basis transform, data compression, operator compression and operator arithmetics to scattered data problems. Especially, samplet matrix compression facilitates the rapid solution of scattered data interpolation problems, even for kernel functions with nonlocal support. Finally, we demonstrate that sparsity constraints for scattered data approximation problems become meaningful and can efficiently be solved in samplet coordinates.