Searcharxiv⌕ Search

arXiv subjects

Wolfgang Erb

Publications and source records attributed to Wolfgang Erb.

35 records · Page 2Linked to original sources

Anisotropic Gaussian approximation in $L_2(\mathbb{R}^2)$

Let $\mathcal{D}$ be the dictionary of Gaussian mixtures: the functions created by affine change of variables of a single Gaussian in $n$ dimensions. $\mathcal{D}$ is used pervasively in scientific applications to a degree that practitioners often employ it as their default choice for representing their scientific object. Its use in applications hinges on the perception that this dictionary is large enough, and its members are local enough in space and frequency, to provide efficient approximation to "almost all objects of interest". However, and perhaps surprisingly, only a handful of concrete theoretical results are actually known on the ability to use Gaussian mixtures in lieu of mainstream representation systems. The present paper shows that, in 2D, Gaussian mixtures are effective in resolving anisotropic structures, too. In this setup, the "smoothness class" is comprised of 2D functions that are sparsely represented using curvelets. An algorithm for $N$-term approximation from (a small subset of) $\mathcal{D}$ is presented, and the error bounds are then shown to be on par with the errors of $N$-term curvelet approximation. The latter are optimal, essentially by definition. Our approach is based on providing effective approximation from $\mathcal{D}$ to the members of the curvelet system, mimicking the approach in arXiv:0802.2517 and arXiv:0911.2803 where the mother wavelets are approximated. When the error is measured in the $1$-norm, this adaptation of the prior approach, combined with standard tools, yields the desired results. However, handling the $2$-norm case is much more subtle and requires substantial new machinery: in this case, the error analysis cannot be solely done on the space domain: some of it has to be carried out on frequency. Since, on frequency, all members of $\mathcal{D}$ are centered at the origin, a delicate analysis for controlling the error there is needed.

math.CA↗

Shapes of Uncertainty in Spectral Graph Theory

We present a flexible framework for uncertainty principles in spectral graph theory. In this framework, general filter functions modeling the spatial and spectral localization of a graph signal can be incorporated. It merges several existing uncertainty relations on graphs, among others the Landau-Pollak principle describing the joint admissibility region of two projection operators, and uncertainty relations based on spectral and spatial spreads. Using theoretical and computational aspects of the numerical range of matrices, we are able to characterize and illustrate the shapes of the uncertainty curves and to study the space-frequency localization of signals inside the admissibility regions.

eess.SP↗

Shape-Driven Interpolation with Discontinuous Kernels: Error Analysis, Edge Extraction and Applications in MPI

Accurate interpolation and approximation techniques for functions with discontinuities are key tools in many applications as, for instance, medical imaging. In this paper, we study an RBF type method for scattered data interpolation that incorporates discontinuities via a variable scaling function. For the construction of the discontinuous basis of kernel functions, information on the edges of the interpolated function is necessary. We characterize the native space spanned by these kernel functions and study error bounds in terms of the fill distance of the node set. To extract the location of the discontinuities, we use a segmentation method based on a classification algorithm from machine learning. The conducted numerical experiments confirm the theoretically derived convergence rates in case that the discontinuities are a priori known. Further, an application to interpolation in magnetic particle imaging shows that the presented method is very promising.

math.NA↗

Rhodonea curves as sampling trajectories for spectral interpolation on the unit disk

Rhodonea curves are classical planar curves in the unit disk with the characteristic shape of a rose. In this work, we use point samples along such rose curves as node sets for a novel spectral interpolation scheme on the disk. By deriving a discrete orthogonality structure on these rhodonea nodes, we will show that the spectral interpolation problem is unisolvent. The underlying interpolation space is generated by a parity-modified Chebyshev-Fourier basis on the disk. This allows us to compute the spectral interpolant in an efficient way. Properties as continuity, convergence and numerical condition of the scheme depend on the spectral structure of the interpolation space. For rectangular spectral index sets, we show that the interpolant is continuous at the center, the Lebesgue constant grows logarithmically and that the scheme converges fast if the function under consideration is smooth. Finally, we derive a Clenshaw-Curtis quadrature rule using function evaluations at the rhodonea nodes and conduct some numerical experiments to compare different parameters of the scheme.

math.NA↗

A spectral interpolation scheme on the unit sphere based on the nodes of spherical Lissajous curves

For sampling values along spherical Lissajous curves we establish a spectral interpolation and quadrature scheme on the sphere. We provide a mathematical analysis of spherical Lissajous curves and study the characteristic properties of their intersection points. Based on a discrete orthogonality structure we are able to prove the unisolvence of the interpolation problem. As basis functions for the interpolation space we use a parity-modified double Fourier basis on the sphere which allows us to implement the interpolation scheme in an efficient way. We further show that the numerical condition number of the interpolation scheme displays a logarithmic growth. As an application, we use the developed interpolation algorithm to estimate the rotation of an object based on measurements at the spherical Lissajous nodes.

math.NA↗

Weak limits for weighted means of orthogonal polynomials

This article is a first attempt to obtain weak limit formulas for weighted means of orthogonal polynomials. For this, we introduce a new mean Nevai class that guarantees the existence of an equilibrium measure for the limit of the means. We show that for a family of measures in this mean Nevai class also the means of the Christoffel-Darboux kernels and the asymptotic distribution of the roots converge weakly to the same equilibrium measure. As a main example, we study the mean Nevai classes in which the equilibrium measure is the orthogonality measure of the ultraspherical polynomials. The respective weak limit formula can be regarded as an asymptotic weak addition formula for the corresponding class of measures.

math.SP↗

Mathematical Analysis of the 1D Model and Reconstruction Schemes for Magnetic Particle Imaging

Magnetic particle imaging (MPI) is a promising new in-vivo medical imaging modality in which distributions of super-paramagnetic nanoparticles are tracked based on their response in an applied magnetic field. In this paper we provide a mathematical analysis of the modeled MPI operator in the univariate situation. We provide a Hilbert space setup, in which the MPI operator is decomposed into simple building blocks and in which these building blocks are analyzed with respect to their mathematical properties. In turn, we obtain an analysis of the MPI forward operator and, in particular, of its ill-posedness properties. We further get that the singular values of the MPI core operator decrease exponentially. We complement our analytic results by some numerical studies which, in particular, suggest a rapid decay of the singular values of the MPI operator.

math.NA↗

Lebesgue constants for polyhedral sets and polynomial interpolation on Lissajous-Chebyshev nodes

To analyze the absolute condition number of multivariate polynomial interpolation on Lissajous-Chebyshev node points, we derive upper and lower bounds for the respective Lebesgue constant. The proof is based on a relation between the Lebesgue constant for the polynomial interpolation problem and the Lebesgue constant linked to the polyhedral partial sums of Fourier series. The magnitude of the obtained bounds is determined by a product of logarithms of the side lengths of the considered polyhedral sets and shows the same behavior as the magnitude of the Lebesgue constant for polynomial interpolation on the tensor product Chebyshev grid.

math.NA↗

A unifying theory for multivariate polynomial interpolation on general Lissajous-Chebyshev nodes

The goal of this article is to provide a general multivariate framework that synthesizes well-known non-tensorial polnomial interpolation schemes on the Padua points, the Morrow-Patterson-Xu points and the Lissajous node points into a single unified theory. The interpolation nodes of these schemes are special cases of the general Lissajous-Chebyshev points studied in this article. We will characterize these Lissajous-Chebyshev points in terms of Lissajous curves and Chebyshev varieties and derive a general discrete orthogonality structure related to these points. This discrete orthogonality is used as the key for the proof of the uniqueness of the polynomial interpolation and the derivation of a quadrature rule on these node sets. Finally, we give an efficient scheme to compute the polynomial interpolants.

math.NA↗

Multivariate polynomial interpolation on Lissajous-Chebyshev nodes

In this article, we study multivariate polynomial interpolation and quadrature rules on non-tensor product node sets related to Lissajous curves and Chebyshev varieties. After classifying multivariate Lissajous curves and the interpolation nodes linked to these curves, we derive a discrete orthogonality structure on these node sets. Using this orthogonality structure, we obtain unique polynomial interpolation in appropriately defined spaces of multivariate Chebyshev polynomials. Our results generalize corresponding interpolation and quadrature results for the Chebyshev-Gauß-Lobatto points in dimension one and the Padua points in dimension two.

math.NA↗

Bivariate Lagrange interpolation at the node points of Lissajous curves - the degenerate case

In this article, we study bivariate polynomial interpolation on the node points of degenerate Lissajous figures. These node points form Chebyshev lattices of rank $1$ and are generalizations of the well-known Padua points. We show that these node points allow unique interpolation in appropriately defined spaces of polynomials and give explicit formulas for the Lagrange basis polynomials. Further, we prove mean and uniform convergence of the interpolating schemes. For the uniform convergence the growth of the Lebesgue constant has to be taken into consideration. It turns out that this growth is of logarithmic nature.

math.NA↗

Bivariate Lagrange interpolation at the node points of non-degenerate Lissajous curves

Motivated by an application in Magnetic Particle Imaging, we study bivariate Lagrange interpolation at the node points of Lissajous curves. The resulting theory is a generalization of the polynomial interpolation theory developed for a node set known as Padua points. With appropriately defined polynomial spaces, we will show that the node points of non-degenerate Lissajous curves allow unique interpolation and can be used for quadrature rules in the bivariate setting. An explicit formula for the Lagrange polynomials allows to compute the interpolating polynomial with a simple algorithmic scheme. Compared to the already established schemes of the Padua and Xu points, the numerical results for the proposed scheme show similar approximation errors and a similar growth of the Lebesgue constant.

math.NA↗

On adaptive discretization schemes for the regularization of ill-posed problems with semiiterative methods

In this paper we investigate an adaptive discretization strategy for ill-posed linear prob- lems combined with a regularization from a class of semiiterative methods. We show that such a discretization approach in combination with a stopping criterion as the discrepancy principle or the balancing principle yields an order optimal regularization scheme and allows to reduce the computational costs.

math.NA↗

An alternative to Slepian functions on the unit sphere - A space-frequency analysis based on localized spherical polynomials

In this article, we present a space-frequency theory for spherical harmonics based on the spectral decomposition of a particular space-frequency operator. The presented theory is closely linked to the theory of ultraspherical polynomials on the one hand, and to the theory of Slepian functions on the 2-sphere on the other. Results from both theories are used to prove localization and approximation properties of the new band-limited yet space-localized basis. Moreover, particular weak limits related to the structure of the spherical harmonics provide information on the proportion of basis functions needed to approximate localized functions. Finally, a scheme for the fast computation of the coefficients in the new localized basis is provided.

math.NA↗

Accelerated Landweber methods based on co-dilated orthogonal polynomials

In this article, we introduce and study accelerated Landweber methods for linear ill-posed problems obtained by an alteration of the coefficients in the three-term recurrence relation of the ν-methods. The residual polynomials of the semi-iterative methods under consideration are linked to a family of co-dilated ultraspherical polynomials. This connection makes it possible to increase the decay of the residual polynomials at the origin by means of a dilation parameter. This increased decay has advantages when solving linear ill-posed equations in which the spectrum of the involved operators is clustered at the origin. The convergence order of the new semi-iterative methods turns out to be the same as the convergence order of the original ν-methods. The new algorithms are tested numerically and a simple adaptive scheme is developed in which an optimal dilation parameter is computed.

math.NA↗

An orthogonal polynomial analogue of the Landau-Pollak-Slepian time-frequency analysis

The aim of this article is to present a time-frequency theory for orthogonal polynomials on the interval [-1,1] that runs parallel to the time-frequency analysis of bandlimited functions developed by Landau, Pollak and Slepian. For this purpose, the spectral decomposition of a particular compact time-frequency-operator is studied. This decomposition and its eigenvalues are closely related to the theory of orthogonal polynomials. Results from both theories, the theory of orthogonal polynomials and the Landau-Pollak-Slepian theory, can be used to prove localization and approximation properties of the corresponding eigenfunctions. Finally, an uncertainty principle is proven that reflects the limitation of coupled time and frequency locatability.

math.CA↗

Optimally space localized polynomials with applications in signal processing

For the filtering of peaks in periodic signals, we specify polynomial filters that are optimally localized in space. The space localization of functions having an expansion in terms of orthogonal polynomials is thereby measured by a generalized mean value. Solving an optimization problem including this mean value, we determine those polynomials out of a polynomial space that are optimally localized. We give explicit formulas for these optimally space localized polynomials and determine in the case of the Jacobi polynomials the relation of the generalized mean value to the position variance of a well-known uncertainty principle. Further, we will consider the Hermite polynomials as an example on how to get optimally space localized polynomials in a non-compact setting. Finally, we investigate how the obtained optimal polynomials can be applied as filters in signal processing.

math.NA↗