Selfadjoint Schrödinger operators on the half-space with compactly supported Robin boundary conditions

Schrödinger differential operators on a half-space with compactly supported Robin boundary conditions are studied. (© 2011 Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim)     

Boundary triples and quasi boundary triples for elliptic operators

The abstract concepts of boundary triples and their recent generalizations are useful tools to parametrize the self-adjoint and maximal dissipative/maximal accumulative extensions of formally symmetric elliptic differential expressions with the help of explicit boundary conditions. In the present note the parametrizations induced by the “natural” quasi boundary triple with the Dirichlet and Neumann trace as boundary maps are compared with the parametrizations induced by a “classical” ordinary boundary triple, where a regularized Neumann trace is used for one of the boundary maps. (© 2011 Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim)     

Perceptually informed synthesis of bandlimited classical waveforms using integrated polynomial interpolation

Digital subtractive synthesis is a popular music synthesis method, which requires oscillators that are aliasing-free in a perceptual sense. It is a research challenge to find computationally efficient waveform generation algorithms that produce similar-sounding signals to analog music synthesizers but which are free from audible aliasing. A technique for approximately bandlimited waveform generation is considered that is based on a polynomial correction function, which is defined as the difference of a non-bandlimited step function and a polynomial approximation of the ideal bandlimited step function. It is shown that the ideal bandlimited step function is equivalent to the sine integral, and that integrated polynomial interpolation methods can successfully approximate it. Integrated Lagrange interpolation and B-spline basis functions are considered for polynomial approximation. The polynomial correction function can be added onto samples around each discontinuity in a non-bandlimited waveform to suppress aliasing. Comparison against previously known methods shows that the proposed technique yields the best tradeoff between computational cost and sound quality. The superior method amongst those considered in this study is the integrated third-order B-spline correction function, which offers perceptually aliasing-free sawtooth emulation up to the fundamental frequency of 7.8 kHz at the sample rate of 44.1 kHz.     

A note on the Pauli problem in light of approximate joint measurements

We show that there exist informationally incomplete phase space observables such that the Cartesian margins are informationally equivalent with position and momentum. This shows that it is possible to reconstruct the position and momentum distributions of a quantum system from the statistics of a single observable, and thus a single measurement, even though the state of the system is not uniquely determined by the statistics.     

Emergence of communities in weighted networks

Topology and weights are closely related in weighted complex networks and this is reflected in their modular structure. We present a simple network model where the weights are generated dynamically and they shape the developing topology. By tuning a model parameter governing the importance of weights, the resulting networks undergo a gradual structural transition from a module-free topology to one with communities. The model also reproduces many features of large social networks, including the "weak links" property.     

Definitizability of a Class of J-Selfadjoint Operators with Applications

We formulate an abstract result concerning the definitizability of J-selfadjoint operators which, roughly speaking, differ by at most finitely many dimensions from the orthogonal sum of a J-selfadjoint operator with finitely many negative squares and a semibounded selfadjoint operator in a Hilbert space. The general perturbation result is applied to a class of singular Sturm–Liouville operators with indefinite weight functions. (© 2009 Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim)     

Lattice Boltzmann Simulation of Flow-Induced Wall Shear Stress in Porous Media

The lattice Boltzmann method is increasingly utilized in the simulation of flow-induced wall shear stress needed in various applications. In image-based flow simulations, the simulation geometry is usually based on a three-dimensional reconstruction of the true structure of the pore space obtained, for example, by X-ray tomography. The geometry is then given in a voxel-based representation, which complicates an accurate determination of the surface-normal vectors that are necessary in the computation of the wall shear stress. To avoid this problem, we introduce here a method for the determination of surface-normal vectors directly from a greyscale image instead of its segmented binary image version. The proposed method is fast and automatic, and it can be used for an arbitrary pore space geometry provided in a greyscale form by any imaging modality. We show that this method can produce accurate surface-normal vectors even for binary images and that their accuracy is further increased when the original greyscale images are used instead. We compute wall shear stresses for generated benchmark geometries and then demonstrate the utility of the method for soil samples with ‘random’ pores imaged by X-ray tomography.     

On the negative squares of indefinite Sturm-Liouville operators

The number of negative squares of all self-adjoint extensions of a simple symmetric operator of defect one with finitely many negative squares in a Krein space is characterized in terms of the behaviour of an abstract Titchmarsh-Weyl function near 0 and ∞. These results are applied to a large class of symmetric and self-adjoint indefinite Sturm-Liouville operators with indefinite weight functions.     

Quasihyperbolic geodesics in convex domains

We show that quasihyperbolic geodesics exist in convex domains in reflexive Banach spaces and that quasihyperbolic geodesies are quasiconvex in the norm metric in convex domains in all normed spaces.     

Algorithms for manipulation of level sets of nonparametric density estimates

Summary  We present algorithms for finding the level set tree of a multivariate density estimate. That is, we find the separated components of level sets of the estimate for a series of levels, gather information on the separated components, such as volume and barycenter, and present the information together with the tree structure of the separated components. The algorithm proceeds by first building a binary tree which partitions the support of the density estimate, followed by bottom-up travels of this tree during which we join those parts of the level sets which touch each other. As a byproduct we present an algorithm for evaluating a kernel estimate on a large multidimensional grid. Since we find the barycenters of the separated components of the level sets also for high levels, our method finds the locations of local extremes of the estimate. Writing of this article was financed by Deutsche Forschungsgemeinschaft under project MA1026/8-1.