The shape stability of the reaction interface for reactive flow in a layered porous medium is studied. This is done using a complete linearized stability analysis in the setting of a free boundary model of this phenomenon. The spectrum of the linearized problem is obtained in the general case, and it is compared with that obtained for homogeneous media in two typical cases.

We study an efficient dynamic blind source separation algorithm of convolutive sound mixtures based on updating statistical information in the frequency domain, and minimizing the support of time domain demixing filters by a weighted least square method. The permutation and scaling indeterminacies of separation, and concatenations of signals in adjacent time frames are resolved with optimization of l 1 l norm on cross-correlation coefficients at multiple time lags. The algorithm is a direct method without iterations, and is adaptive to the environment. Computations on recorded benchmark mixtures of speech and music signals show excellent performance. The method in general separates a foreground source from a background of sounds as often encountered in realistic situations.

METHODS AND APPLICATIONS OF ANALYSIS. c 2009 International Press Vol. 16, No. 4, pp. 507520, December 2009 006

We study the super-resolution (SR) problem of recovering point sources consisting of a collection of isolated and suitably separated spikes from only the low frequency measurements. If the peak separation is above a factor in (1,2) of the Rayleigh length (physical resolution limit), L 1 minimization is guaranteed to recover such sparse signals. However, below such critical length scale, especially the Rayleigh length, the L 1 certificate no longer exists. We show several local properties (local minimum, directional stationarity, and sparsity) of the limit points of minimizing two L 1 based nonconvex penalties, the difference of L 1 and L 1 norms ( L 1 ) and capped L 1 (C L 1 ), subject to the measurement constraints. In one and two dimensional numerical SR examples, the local optimal solutions from difference of convex function algorithms outperform the global L 1 solutions near or below Rayleigh length scales either in

We study the front dynamics of solutions of the initial value problem of the Burgers equation with initial data being the viscous shock front plus the white noise perturbation. In the sense of distribution, the solutions propagate with the same speed as the unperturbed front, however, the front location is random and satisfies a central limit theorem with the variance proportional to the time<i>t</i>, as<i>t</i> goes to infinity. With probability arbitrarily close to one, the front width is<i>O</i>(1) for large time.