In this paper, we give an almost complete classication of toric surface codes of dimension less than or equal to 7, according to monomially equivalence. This is a natural extension of our previous work [YZ], [LYZZ]. More pairs of monomially equivalent toric codes constructed from non-equivalent lattice polytopes are discovered. A new phenomenon appears, that is, the monomially non-equivalence of two toric codes C P(10)7and CP(19)7 can be discerned on Fq, for all q  8, except q = 29. This sudden break seems to be strange and interesting. Moreover, the parameters, such as the numbers of codewords with dierent weights, depends on q heavily. More meticulous analyses have been made to have the possible distinct families of reducible polynomials.

No abstract uploaded!

We consider reflector imaging in a weakly random waveguide. We address the situation in which the source is farther from the reflector to be imaged than the energy equipartition distance, but the receiver array is closer to the reflector to be imaged than the energy equipartition distance. As a consequence, the reflector is illuminated by a partially coherent field and the signals recorded by the receiver array are noisy. This paper shows that migration of the recorded signals cannot give a good image, but an appropriate migration of the cross correlations of the recorded signals can give a very good image. The resolution and stability analysis of this original functional shows that the reflector can be localized with an accuracy of the order of the wavelength even when the receiver array has small aperture, and that broadband sources are necessary to ensure statistical stability, whatever the aperture of the array.

The doubling algorithms are very efficient iterative methods for computing the unique minimal nonnegative solution to an M-matrix algebraic Riccati equation (MARE). They are globally and quadratically convergent, except for MARE in the critical case where convergence is linear with the linear rate 1/2. However, the initialization phase and the doubling iteration kernel of any doubling algorithm involve inverting nonsingular M-matrices. In particular, for MARE in the critical case, the M-matrices in the doubling iteration kernel, although nonsingular, move towards singular M-matrices at convergence. These inversions are causes of concerns on entrywise relative accuracy of the eventually computed minimal nonnegative solution. Fortunately, a nonsingular M-matrix can be inverted by the GTH-like algorithm of Alfa, Xue, and Ye [Math. Comp., 71:217--236, 2002] to almost full entrywise relative accuracy, provided a triplet representation of the matrix is known. Recently, Nguyen and Poloni [Numer. Math., 130(4):763--792, 2015] discovered a way to construct triplet representations in a cancellation-free manner for all involved M-matrices in the doubling iteration kernel, for a special class of MAREs arising from Markov-modulated fluid queues. In this paper, we extend Nguyen's and Poloni's work to all MAREs by also devising a way to construct the triplet representations cancellation-free. Our construction, however, is not a straightforward extension of theirs. It is made possible by an introduction of novel recursively computable auxiliary nonnegative vectors. As the second contribution, we propose an entrywise relative residual for an approximate solution. The residual has an appealing feature of being able to reveal the entrywise relative accuracies of all entries, large and small, of the approximation. This is in marked contrast to the usual legacy normalized residual which reflects relative accuracies of large entries well but not so much those of very tiny entries. Numerical examples are presented to demonstrate and confirm our claims.

We consider an elliptic pseudo-differential equation with a highly oscillating linear potential modeled as a stationary ergodic random field. The random field is a function composed with a centered long-range correlated Gaussian process. In the limiting of vanishing correlation length, the heterogeneous solution converges to a deterministic solution obtained by averaging the random potential. We characterize the deterministic and stochastic correctors. With proper rescaling, the mean-zero stochastic corrector converges to a Gaussian random process in probability and weakly in the spatial variables. In addition, for two prototype equations involving the Laplacian and the fractional Laplacian operators, we prove that the limit holds in distribution in some Hilbert spaces. We also determine the size of the deterministic corrector when it is larger than the stochastic corrector. Depending on the correlation structure of the random field and on the singularities of the Green’s function, we show that either the deterministic or the random part of the corrector dominates.