Spectral and weak polynomial completeness for the porduct of nonsingular matrices

Let F be a field with at least four elements. In this paper, we identify all the pairs (A, B) of n x n nonsingular matrices over F , satisfying the following property: for every monic polynomial f(x) = xn + an-1xn-1 + … +a1x + aο over F, with a root in F and aο = (-1)n det(AB), there are nonsingular matrices X, Y ϵ Fnxn such that X A X-1 Y BY-1 has characteristic polynomial f (x). © 2014 © 2014 Taylor & Francis.

Jamming detection in GNSS signals using the sample covariance matrix.

We propose a blind method to detect interference in GNSS signals whereby the algorithms do not require knowledge of the interference or channel noise features. A sample covariance matrix is constructed from the received signal and its eigenvalues are computed. The generalized likelihood ratio test (GLRT) and the condition number test (CNT) are developed and compared in the detection of sinusoidal and chirp jamming signals. A computationally-efficient decision threshold was proposed for the CNT.

Spectral and weak polynomial completeness for the product of nonsingular matrices

Let F be a field with at least four elements. In this paper, we identify all the pairs (A, B) of n x n nonsingular matrices over F, satisfying the following property: for every monic polynomial f (x) = x(n) + a(n-1)x(n-1) +... + a(1)x + a(0) over F, with a root in F and a(0) = (-1)(n) det(AB), there are nonsingular matrices X, Y is an element of F-nxn such that XAX(-1)Y BY-1 has characteristic polynomial f (x).

Estimation of signal subspace on hyperspectral data

Dimensionality reduction plays a crucial role in many hyperspectral data processing and analysis algorithms. This paper proposes a new mean squared error based approach to determine the signal subspace in hyperspectral imagery. The method first estimates the signal and noise correlations matrices, then it selects the subset of eigenvalues that best represents the signal subspace in the least square sense. The effectiveness of the proposed method is illustrated using simulated and real hyperspectral images.

Hyperspectral signal subspace estimation

Given an hyperspectral image, the determination of the number of endmembers and the subspace where they live without any prior knowledge is crucial to the success of hyperspectral image analysis. This paper introduces a new minimum mean squared error based approach to infer the signal subspace in hyperspectral imagery. The method, termed hyperspectral signal identification by minimum error (HySime), is eigendecomposition based and it does not depend on any tuning parameters. It first estimates the signal and noise correlation matrices and then selects the subset of eigenvalues that best represents the signal subspace in the least squared error sense. The effectiveness of the proposed method is illustrated using simulated data based on U.S.G.S. laboratory spectra and real hyperspectral data collected by the AVIRIS sensor over Cuprite, Nevada.

Weakly spectrally complete pair of matrices

Let and be matrices over an algebraically closed field. Let be elements of such that and . We give necessary and sufficient condition for the existence of matrices and similar to and, respectively, such that has eigenvalues.

A spectrum-driven damage Identification technique : application and validation through the numerical simulation of the Z24 Bridge

The present paper focuses on a damage identification method based on the use of the second order spectral properties of the nodal response processes. The explicit dependence on the frequency content of the outputs power spectral densities makes them suitable for damage detection and localization. The well-known case study of the Z24 Bridge in Switzerland is chosen to apply and further investigate this technique with the aim of validating its reliability. Numerical simulations of the dynamic response of the structure subjected to different types of excitation are carried out to assess the variability of the spectrum-driven method with respect to both type and position of the excitation sources. The simulated data obtained from random vibrations, impulse, ramp and shaking forces, allowed to build the power spectrum matrix from which the main eigenparameters of reference and damage scenarios are extracted. Afterwards, complex eigenvectors and real eigenvalues are properly weighed and combined and a damage index based on the difference between spectral modes is computed to pinpoint the damage. Finally, a group of vibration-based damage identification methods are selected from the literature to compare the results obtained and to evaluate the performance of the spectral index.

Vanishing spin stiffness in the spin-1/2 Heisenberg chain for any nonzero temperature

Whether at the zero spin density m = 0 and finite temperatures T > 0 the spin stiffness of the spin-1/2 XXX chain is finite or vanishes remains an unsolved and controversial issue, as different approaches yield contradictory results. Here we explicitly compute the stiffness at m = 0 and find strong evidence that it vanishes. In particular, we derive an upper bound on the stiffness within a canonical ensemble at any fixed value of spin density m that is proportional to m2L in the thermodynamic limit of chain length L → ∞, for any finite, nonzero temperature, which implies the absence of ballistic transport for T > 0 for m = 0. Although our method relies in part on the thermodynamic Bethe ansatz (TBA), it does not evaluate the stiffness through the second derivative of the TBA energy eigenvalues relative to a uniform vector potential. Moreover, we provide strong evidence that in the thermodynamic limit the upper bounds on the spin current and stiffness used in our derivation remain valid under string deviations. Our results also provide strong evidence that in the thermodynamic limit the TBA method used by X. Zotos [Phys. Rev. Lett. 82, 1764 (1999)] leads to the exact stiffness values at finite temperature T > 0 for models whose stiffness is finite at T = 0, similar to the spin stiffness of the spin-1/2 Heisenberg chain but unlike the charge stiffness of the half-filled 1D Hubbard model.

Explicit methods for Hilbert modular forms

We exhibit algorithms to compute systems of Hecke eigenvalues for spaces of Hilbert modular forms over a totally real field. We provide many explicit examples as well as applications to modularity and Galois representations.

A Monte Carlo-Based Fiber Tracking Algorithm using Diffusion Tensor MRI

Diffusion tensor magnetic resonance imaging, which measures directional information of water diffusion in the brain, has emerged as a powerful tool for human brain studies. In this paper, we introduce a new Monte Carlo-based fiber tracking approach to estimate brain connectivity. One of the main characteristics of this approach is that all parameters of the algorithm are automatically determined at each point using the entropy of the eigenvalues of the diffusion tensor. Experimental results show the good performance of the proposed approach

Automatic generation of active coordinates for quantum dynamics calculations: application to the dynamics of benzene photochemistry

A new practical method to generate a subspace of active coordinates for quantum dynamics calculations is presented. These reduced coordinates are obtained as the normal modes of an analytical quadratic representation of the energy difference between excited and ground states within the complete active space self-consistent field method. At the Franck-Condon point, the largest negative eigenvalues of this Hessian correspond to the photoactive modes: those that reduce the energy difference and lead to the conical intersection; eigenvalues close to 0 correspond to bath modes, while modes with large positive eigenvalues are photoinactive vibrations, which increase the energy difference. The efficacy of quantum dynamics run in the subspace of the photoactive modes is illustrated with the photochemistry of benzene, where theoretical simulations are designed to assist optimal control experiments

Capacity-achieving input covariance for single-user multi-antenna channels

We characterize the capacity-achieving input covariance for multi-antenna channels known instantaneously at the receiver and in distribution at the transmitter. Our characterization, valid for arbitrary numbers of antennas, encompasses both the eigenvectors and the eigenvalues. The eigenvectors are found for zero-mean channels with arbitrary fading profiles and a wide range of correlation and keyhole structures. For the eigenvalues, in turn, we present necessary and sufficient conditions as well as an iterative algorithm that exhibits remarkable properties: universal applicability, robustness and rapid convergence. In addition, we identify channel structures for which an isotropic input achieves capacity.

Measures of fit in multiple correspondence analysis of crisp and fuzzy coded data

When continuous data are coded to categorical variables, two types of coding are possible: crisp coding in the form of indicator, or dummy, variables with values either 0 or 1; or fuzzy coding where each observation is transformed to a set of "degrees of membership" between 0 and 1, using co-called membership functions. It is well known that the correspondence analysis of crisp coded data, namely multiple correspondence analysis, yields principal inertias (eigenvalues) that considerably underestimate the quality of the solution in a low-dimensional space. Since the crisp data only code the categories to which each individual case belongs, an alternative measure of fit is simply to count how well these categories are predicted by the solution. Another approach is to consider multiple correspondence analysis equivalently as the analysis of the Burt matrix (i.e., the matrix of all two-way cross-tabulations of the categorical variables), and then perform a joint correspondence analysis to fit just the off-diagonal tables of the Burt matrix - the measure of fit is then computed as the quality of explaining these tables only. The correspondence analysis of fuzzy coded data, called "fuzzy multiple correspondence analysis", suffers from the same problem, albeit attenuated. Again, one can count how many correct predictions are made of the categories which have highest degree of membership. But here one can also defuzzify the results of the analysis to obtain estimated values of the original data, and then calculate a measure of fit in the familiar percentage form, thanks to the resultant orthogonal decomposition of variance. Furthermore, if one thinks of fuzzy multiple correspondence analysis as explaining the two-way associations between variables, a fuzzy Burt matrix can be computed and the same strategy as in the crisp case can be applied to analyse the off-diagonal part of this matrix. In this paper these alternative measures of fit are defined and applied to a data set of continuous meteorological variables, which are coded crisply and fuzzily into three categories. Measuring the fit is further discussed when the data set consists of a mixture of discrete and continuous variables.

Some hypothesis tests for the covariance matrix when the dimension is large compared to the sample size

This paper analyzes whether standard covariance matrix tests work whendimensionality is large, and in particular larger than sample size. Inthe latter case, the singularity of the sample covariance matrix makeslikelihood ratio tests degenerate, but other tests based on quadraticforms of sample covariance matrix eigenvalues remain well-defined. Westudy the consistency property and limiting distribution of these testsas dimensionality and sample size go to infinity together, with theirratio converging to a finite non-zero limit. We find that the existingtest for sphericity is robust against high dimensionality, but not thetest for equality of the covariance matrix to a given matrix. For thelatter test, we develop a new correction to the existing test statisticthat makes it robust against high dimensionality.

Elasticity and melting of vortex crystals in anisotropic superconductors: Beyond the continuum regime.

The elastic moduli of vortex crystals in anisotropic superconductors are frequently involved in the investigation of their phase diagram and transport properties. We provide a detailed analysis of the harmonic eigenvalues (normal modes) of the vortex lattice for general values of the magnetic field strength, going beyond the elastic continuum regime. The detailed behavior of these wave-vector-dependent eigenvalues within the Brillouin zone (BZ), is compared with several frequently used approximations that we also recalculate. Throughout the BZ, transverse modes are less costly than their longitudinal counterparts, and there is an angular dependence which becomes more marked close to the zone boundary. Based on these results, we propose an analytic correction to the nonlocal continuum formulas which fits quite well the numerical behavior of the eigenvalues in the London regime. We use this approximate expression to calculate thermal fluctuations and the full melting line (according to Lindeman's criterion) for various values of the anisotropy parameter.