Structure of trajectories of complex-matrix eigenvalues in the Hermitian-non-Hermitian transition

The statistical properties of trajectories of eigenvalues of Gaussian complex matrices whose Hermitian condition is progressively broken are investigated. It is shown how the ordering on the real axis of the real eigenvalues is reflected in the structure of the trajectories and also in the final distribution of the eigenvalues in the complex plane.

An integral conservative gridding--algorithm using Hermitian curve interpolation

The problem of re-sampling spatially distributed data organized into regular or irregular grids to finer or coarser resolution is a common task in data processing. This procedure is known as 'gridding' or 're-binning'. Depending on the quantity the data represents, the gridding-algorithm has to meet different requirements. For example, histogrammed physical quantities such as mass or energy have to be re-binned in order to conserve the overall integral. Moreover, if the quantity is positive definite, negative sampling values should be avoided. The gridding process requires a re-distribution of the original data set to a user-requested grid according to a distribution function. The distribution function can be determined on the basis of the given data by interpolation methods. In general, accurate interpolation with respect to multiple boundary conditions of heavily fluctuating data requires polynomial interpolation functions of second or even higher order. However, this may result in unrealistic deviations (overshoots or undershoots) of the interpolation function from the data. Accordingly, the re-sampled data may overestimate or underestimate the given data by a significant amount. The gridding-algorithm presented in this work was developed in order to overcome these problems. Instead of a straightforward interpolation of the given data using high-order polynomials, a parametrized Hermitian interpolation curve was used to approximate the integrated data set. A single parameter is determined by which the user can control the behavior of the interpolation function, i.e. the amount of overshoot and undershoot. Furthermore, it is shown how the algorithm can be extended to multidimensional grids. The algorithm was compared to commonly used gridding-algorithms using linear and cubic interpolation functions. It is shown that such interpolation functions may overestimate or underestimate the source data by about 10-20%, while the new algorithm can be tuned to significantly reduce these interpolation errors. The accuracy of the new algorithm was tested on a series of x-ray CT-images (head and neck, lung, pelvis). The new algorithm significantly improves the accuracy of the sampled images in terms of the mean square error and a quality index introduced by Wang and Bovik (2002 IEEE Signal Process. Lett. 9 81-4).

Hermitian curve interpolation for CT-data re-sampling

Purpose: Development of an interpolation algorithm for re‐sampling spatially distributed CT‐data with the following features: global and local integral conservation, avoidance of negative interpolation values for positively defined datasets and the ability to control re‐sampling artifacts. Method and Materials: The interpolation can be separated into two steps: first, the discrete CT‐data has to be continuously distributed by an analytic function considering the boundary conditions. Generally, this function is determined by piecewise interpolation. Instead of using linear or high order polynomialinterpolations, which do not fulfill all the above mentioned features, a special form of Hermitian curve interpolation is used to solve the interpolation problem with respect to the required boundary conditions. A single parameter is determined, by which the behavior of the interpolation function is controlled. Second, the interpolated data have to be re‐distributed with respect to the requested grid. Results: The new algorithm was compared with commonly used interpolation functions based on linear and second order polynomial. It is demonstrated that these interpolation functions may over‐ or underestimate the source data by about 10%–20% while the parameter of the new algorithm can be adjusted in order to significantly reduce these interpolation errors. Finally, the performance and accuracy of the algorithm was tested by re‐gridding a series of X‐ray CT‐images. Conclusion: Inaccurate sampling values may occur due to the lack of integral conservation. Re‐sampling algorithms using high order polynomialinterpolation functions may result in significant artifacts of the re‐sampled data. Such artifacts can be avoided by using the new algorithm based on Hermitian curve interpolation

On the similarity of Sturm-Liouville operators with non-Hermitian boundary conditions to self-adjoint and normal operators

We consider one-dimensional Schrödinger-type operators in a bounded interval with non-self-adjoint Robin-type boundary conditions. It is well known that such operators are generically conjugate to normal operators via a similarity transformation. Motivated by recent interests in quasi-Hermitian Hamiltonians in quantum mechanics, we study properties of the transformations and similar operators in detail. In the case of parity and time reversal boundary conditions, we establish closed integral-type formulae for the similarity transformations, derive a non-local self-adjoint operator similar to the Schrödinger operator and also find the associated “charge conjugation” operator, which plays the role of fundamental symmetry in a Krein-space reformulation of the problem.

Pseudospectra in non-Hermitian quantum mechanics

We propose giving the mathematical concept of the pseudospectrum a central role in quantum mechanics with non-Hermitian operators. We relate pseudospectral properties to quasi-Hermiticity, similarity to self-adjoint operators, and basis properties of eigenfunctions. The abstract results are illustrated by unexpected wild properties of operators familiar from PT -symmetric quantum mechanics.

Bufferless Compression of Asynchronously Sampled ECG Signals in Cubic Hermitian Vector Space.

Asynchronous level crossing sampling analog-to-digital converters (ADCs) are known to be more energy efficient and produce fewer samples than their equidistantly sampling counterparts. However, as the required threshold voltage is lowered, the number of samples and, in turn, the data rate and the energy consumed by the overall system increases. In this paper, we present a cubic Hermitian vector-based technique for online compression of asynchronously sampled electrocardiogram signals. The proposed method is computationally efficient data compression. The algorithm has complexity O(n), thus well suited for asynchronous ADCs. Our algorithm requires no data buffering, maintaining the energy advantage of asynchronous ADCs. The proposed method of compression has a compression ratio of up to 90% with achievable percentage root-mean-square difference ratios as a low as 0.97. The algorithm preserves the superior feature-to-feature timing accuracy of asynchronously sampled signals. These advantages are achieved in a computationally efficient manner since algorithm boundary parameters for the signals are extracted a priori.

Some Para-Hermitian Related Complex Structures and Non-existence of Semi-Riemannian Metric on Some Spheres

It is shown that the spheres S^(2n) (resp: S^k with k ≡ 1 mod 4) can be given neither an indefinite metric of any signature (resp: of signature (r, k − r) with 2 ≤ r ≤ k − 2) nor an almost paracomplex structure. Further for every given Riemannian metric on an almost para-Hermitian manifold with the associated 2-form φ one can construct an almost Hermitian structure (under certain conditions, two different almost Hermitian structures) whose associated 2-form(s) is φ.

Direct and Inverse Spectral Problems for (2N + 1)-Diagonal, Complex, Symmetric, Non-Hermitian Matrices

2000 Mathematics Subject Classification: 42C05.

Diagonalizable Complex Systems, Reduced Dimension and Hermitian Systems II

2002 Mathematics Subject Classification: 35L40

Hermitian Manifolds of Pointwise Constant Antiholomorphic Sectional Curvatures

2000 Mathematics Subject Classification: Primary 53B35, Secondary 53C50.

Langevin dynamics, large deviations and instantons for the quasi-geostrophic model and two-dimensional Euler equations

We investigate a class of simple models for Langevin dynamics of turbulent flows, including the one-layer quasi-geostrophic equation and the two-dimensional Euler equations. Starting from a path integral representation of the transition probability, we compute the most probable fluctuation paths from one attractor to any state within its basin of attraction. We prove that such fluctuation paths are the time reversed trajectories of the relaxation paths for a corresponding dual dynamics, which are also within the framework of quasi-geostrophic Langevin dynamics. Cases with or without detailed balance are studied. We discuss a specific example for which the stationary measure displays either a second order (continuous) or a first order (discontinuous) phase transition and a tricritical point. In situations where a first order phase transition is observed, the dynamics are bistable. Then, the transition paths between two coexisting attractors are instantons (fluctuation paths from an attractor to a saddle), which are related to the relaxation paths of the corresponding dual dynamics. For this example, we show how one can analytically determine the instantons and compute the transition probabilities for rare transitions between two attractors.

Yang–Mills solutions and dyons on cylinders over coset spaces with Sasakian structure

We present solutions of the Yang–Mills equation on cylinders R×G/HR×G/H over coset spaces of odd dimension 2m+12m+1 with Sasakian structure. The gauge potential is assumed to be SU(m)SU(m)-equivariant, parameterized by two real, scalar-valued functions. Yang–Mills theory with torsion in this setup reduces to the Newtonian mechanics of a point particle moving in R2R2 under the influence of an inverted potential. We analyze the critical points of this potential and present an analytic as well as several numerical finite-action solutions. Apart from the Yang–Mills solutions that constitute SU(m)SU(m)-equivariant instanton configurations, we construct periodic sphaleron solutions on S1×G/HS1×G/H and dyon solutions on iR×G/HiR×G/H.

Temporal solitonic crystals and non-Hermitian informational lattices

Clusters of temporal optical solitons—stable self-localized light pulses preserving their form during propagation—exhibit properties characteristic of that encountered in crystals. Here, we introduce the concept of temporal solitonic information crystals formed by the lattices of optical pulses with variable phases. The proposed general idea offers new approaches to optical coherent transmission technology and can be generalized to dispersion-managed and dissipative solitons as well as scaled to a variety of physical platforms from fiber optics to silicon chips. We discuss the key properties of such dynamic temporal crystals that mathematically correspond to non-Hermitian lattices and examine the types of collective mode instabilities determining the lifetime of the soliton train. This transfer of techniques and concepts from solid state physics to information theory promises a new outlook on information storage and transmission.