We develop a new moving-water equilibria preserving numerical scheme for the Saint-Venant system. The new scheme is designed in two major steps. First, the geometric source term is incorporated into the discharge flux, which results in a hyperbolic system with a global flux. Second, the discharge equation is relaxed so that the nonlinearity is moved into the stiff right-hand side of the added auxiliary equation. The main advantages of the new scheme are that (i) no special treatment of the geometric source term is required, and (ii) no nonlinear (cubic) equations should be solved to obtain the point values of the water depth out of the reconstructed equilibrium variables, as it must be done in the existing alternative methods. We also develop a hybrid numerical flux, which helps to handle various flow regimes in a stable manner. Several numerical experiments are performed to verify that the proposed scheme is capable of exactly preserving general moving-water steady states and accurately capturing their small perturbations.

Staggered grid techniques are attractive ideas for flow problems due to their more enhanced conservation properties. Recently, a staggered discontinuous Galerkin method is developed for the Stokes system. This method has several distinctive advantages, namely high order optimal convergence as well as local and global conservation properties. In addition, a local postprocessing technique is developed, and the postprocessed velocity is superconvergent and pointwisely divergence-free. Thus, the staggered discontinuous Galerkin method provides a convincing alternative to existing schemes. For problems with corner singularities and flows in porous media, adaptive mesh refinement is crucial in order to reduce the computational cost. In this paper, we will derive a computable error indicator for the staggered discontinuous Galerkin method and prove that this indicator is both efficient and reliable. Moreover, we will present some numerical results with corner singularities and flows in porous media to show that the proposed error indicator gives a good performance.

Blind source separation (BSS) methods are useful tools to recover or enhance individual speech sources from their mixtures in a multi-talker environment. A class of efficient BSS methods are based on the mutual exclusion hypothesis of the source signal Fourier spectra on the timefrequency (TF) domain, and subsequent data clustering and classification. Though such methodology is simple, the discontinuous decisions in the TF domain for classification often cause defects in the recovered signals in the time domain. The defects are perceived as unpleasant ringing sounds, the so called musical noise. Post-processing is desired for further quality enhancement. In this paper, an efficient musical noise reduction method is presented based on a convex model of time-domain sparse filters. The sparse filters are intended to cancel out the interference due to major sparse peaks in the mixing coefficients or physically the early arrival and high energy portion of the room impulse responses. This strategy is efficiently carried out by l1 regularization and the split Bregman method. Evaluations by both synthetic and room recorded speech and music data show that our method outperforms existing musical noise reduction methods in terms of objective and subjective measures. Our method can be used as a post-processing tool for more general and recent versions of TF domain BSS methods as well.

A variety of problems in computational physics and engineering require the convolu- tion of the heat kernel (a Gaussian) with either discrete sources, densities supported on boundaries, or continuous volume distributions. We present a unified fast Gauss transform for this purpose in two dimensions, making use of an adaptive quad-tree discretization on a unit square which is assumed to contain all sources. Our implementation permits either free-space or periodic boundary conditions to be imposed, and is efficient for any choice of variance in the Gaussian.

A new class of implicit high-order non-oscillatory time integration schemes is introduced in a method-of-lines framework. These schemes can be used in conjunction with an appropriate spatial discretization scheme for the numerical solution of time dependent conservation equations. The main concept behind these schemes is that the order of accuracy in time is dropped locally in regions where the time evolution of the solution is not smooth. By doing this, an attempt is made at locally satisfying monotonicity conditions, while maintaining a high order of accuracy in most of the solution domain. When a linear high order time integration scheme is used along with a high order spatial discretization, enforcement of monotonicity imposes severe time-step restrictions. We propose to apply limiters to these time-integration schemes, thus making them non-linear. When these new schemes are used with high order spatial discretizations, solutions remain non-oscillatory for much larger time-steps as compared to linear time integration schemes. Numerical results obtained on scalar conservation equations and systems of conservation equations are highly promising.