Using the vorticity and stream function variables is an effective way to compute 2-D incompressible flow due to the facts that the incompressibility constraint for the velocity is automatically satisfied, the pressure variable is eliminated, and high order schemes can be efficiently implemented. However, a difficulty arises in a multi-connected computational domain in determining the constants for the stream function on the boundary of the “holes”. This is an especially challenging task for the calculation of unsteady flows, since these constants vary with time to reflect the total fluxes of the flow in each sub-channel. In this paper, we propose an efficient method in a finite difference setting to solve this problem and present some numerical experiments, including an accuracy check of a Taylor vortex-type flow, flow past a non-symmetric square, and flow in a heat exchanger.

In this paper, we consider a class of optimization problems of minimizing a (at least) twice continuously dierentiable function (probably nonconvex) f(x) : Rn ! R over a product of multiple balls/spheres constraints. Upon rescaling the balls/spheres, we cast without loss of generality such class of minimization problems in the following form: (BCOP) 8>< >: min x2Rn f(x) s:t: ci(x) := kx[i]k2 􀀀 1 = 0; i 2 E; ci(x) := kx[i]k2 􀀀 1  0; i 2 I; where E = f1; 2; : : : ;m1g, I = fm1 + 1;m1 + 2; : : : ;mg, x[i] 2 Rpi , x = (xT [1]; xT [2]; : : : ; xT [m])T , n = Pm i=1 pi, and k
k stands for the `2 vector norm. Here, we introduce the notation x[i] 2 Rpi to represent the ith subvector of x 2 Rn and formulate the product of multiple ball/sphere constraints as a set of equality and inequality constraints. To simplify subsequent presentation, we call the above programming the ball/sphere constrained optimization problem (BCOP). We emphasize that this problem does not allow overlap among the variables x[i] and therefore the constraints are separable. However, these variables x[i] may be linked together through the objective function f(x).

Numerical simulations of waves in highly heterogeneous media have important applications, but direct computations are prohibitively expensive. In this paper, we develop a new generalized multiscale finite element method with the aim of simulating waves at a much lower cost. Our method is based on a mixed Galerkin type method with carefully designed basis functions that can capture various scales in the solution. The basis functions are constructed based on some local snapshot spaces and local spectral problems defined on them. The spectral problems give a natural ordering of the basis functions in the snapshot space and allow systematically enrichment of basis functions. In addition, by using a staggered coarse mesh, our method is energy conserving and has block diagonal mass matrix, which are desirable properties for wave propagation. We will prove that our method has spectral convergence, and

In this paper, we develop local discontinuous Galerkin method for the two-dimensional coupled system of incompressible miscible displacement problem. Optimal error estimates in $L^{\infty}(0, T; L^{2})$ for concentration $c$, $L^{2}(0, T; L^{2})$ for $\nabla c$ and $L^{\infty}(0, T; L^{2})$ for velocity ${\bf u}$ are derived. The main techniques in the analysis include the treatment of the inter-element jump terms which arise from the discontinuous nature of the numerical method, the nonlinearity, and the coupling of the models. The main difficulty is how to treat the inter-element discontinuities of two independent solution variables (one from the flow equation and the other from the transport equation) at cell interfaces. Numerical experiments are shown to demonstrate the theoretical results.

In this paper, we develop and analyze a new multiscale discontinuous Galerkin (DG) method for one-dimensional stationary Schr\"{o}dinger equations with open boundary conditions \bo{which have highly oscillating solutions}. Our method uses a smaller finite element space than the WKB local DG (WKB-LDG) method while achieving the same order of accuracy with no resonance errors. We prove that the DG approximation converges optimally with respect to the mesh size $h$ in $L^2$ norm without the typical constraint \bo{that $h$ has to be smaller than the wave length}. Numerical experiments were carried out to verify the second order optimal convergence rate of the method and to demonstrate its ability to capture oscillating solutions on coarse meshes in the applications to Schr\"{o}dinger equations.