In this paper, we present a measure of distance in a second-order cone based on a class of continuously differentiable strictly convex functions on ₊₊. Since the distance function has some favorable properties similar to those of the D-function (Censor and Zenios in J. Optim. Theory Appl. 73:451464 [1992]), we refer to it as a quasi D-function. Then, a proximal-like algorithm using the quasi D-function is proposed and applied to the second-cone programming problem, which is to minimize a closed proper convex function with general second-order cone constraints. Like the proximal point algorithm using the D-function (Censor and Zenios in J. Optim. Theory Appl. 73:451464 [1992]; Chen and Teboulle in SIAM J. Optim. 3:538543 [1993]), under some mild assumptions we establish the global convergence of the algorithm expressed in terms of function values; we show that the sequence generated by the

We present a hybrid asymptotic/numerical method for the accurate computation of single- and double-layer heat potentials in two dimensions. It has been shown in previous work that simple quadrature schemes suffer from a phenomenon called “geometrically induced stiffness,” meaning that formally high-order accurate methods require excessively small time steps before the rapid convergence rate is observed. This can be overcome by analytic integration in time, requiring the evaluation of a collection of spatial boundary integral operators with non-physical, weakly singular kernels. In our hybrid scheme, we combine a local asymptotic approximation with the evaluation of a few boundary integral operators involving only Gaussian kernels, which are easily accelerated by a new version of the fast Gauss transform. This new scheme is robust, avoids geometrically induced stiffness, and is easy to use in the presence of moving geometries. Its extension to three dimensions is natural and straightforward, and should permit layer heat potentials to become flexible and powerful tools for modeling diffusion processes.

In this paper we introduce a high-order discontinuous Galerkin method for two-dimensional incompressible flow in the vorticity stream-function formulation. The momentum equation is treated explicitly, utilizing the efficiency of the discontinuous Galerkin method. The stream function is obtained by a standard Poisson solver using continuous finite elements. There is a natural matching between these two finite element spaces, since the normal component of the velocity field is continuous across element boundaries. This allows for a correct upwinding gluing in the discontinuous Galerkin framework, while still maintaining total energy conservation with no numerical dissipation and total enstrophy stability. The method is efficient for inviscid or high Reynolds number flows. Optimal error estimates are proved and verified by numerical experiments.

In this work, we present an upscaled model for mixed dimensional coupled flow problem in fractured porous media. We consider both embedded and discrete fracture models (EFM and DFM) as fine scale models which contain coupled system of equations. For fine grid discretization, we use a conservative finite-volume approximation. We construct an upscaled model using the non-local multicontinuum (NLMC) method for the coupled system. The proposed upscaled model is based on a set of simplified multiscale basis functions for the auxiliary space and a constraint energy minimization principle for the construction of multiscale basis functions. Using the constructed NLMC-multiscale basis functions, we obtain an accurate coarse grid upscaled model. We present numerical results for both fine-grid models and upscaled coarse-grid models using our NLMC method. We consider model problems with (1) discrete fracture fine grid model with low and high permeable fractures;(2) embedded fine grid model for two types of geometries with differnet fracture networks and (3) embedded fracture fine grid model with heterogeneous permeability. The simulations using the upscaled model provide very accurate solutions with significant reduction in the dimension of the problem.

Shape optimization aims to optimize an objective function by changing the shape of the computational domain. In recent years, shape optimization has received considerable attentions. On the theoretical side there are several publications dealing with the existence of solution and the sensitivity analysis of the problem; see e.g., [6] and references therein.