We explore the tunneling behavior of a quantum particle on a finite graph in the presence of an asymptotically large potential with two or three potential wells. The behavior of the particle is primarily governed by the local spectral symmetry of the graph around the wells. In the case of two wells the behavior is stable in the sense that it can be predicted from a sufficiently large neighborhood of the wells. However in the case of three wells we are able to exhibit examples where the tunneling behavior can be changed significantly by perturbing the graph arbitrarily far from the wells.

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.

Recently, Kawasaki and Takahashi (J. Nonlinear Convex Anal. 14:71-87, 2013) defined a broad class of nonlinear mappings, called widely more generalized hybrid, in a Hilbert space which contains generalized hybrid mappings (Kocourek <i>et al.</i> in Taiwan. J.Math. 14:2497-2511, 2010) and strict pseudo-contractive mappings (Browder and Petryshyn in J. Math. Anal. Appl. 20:197-228, 1967). They proved fixed point theorems for such mappings. In this paper, we prove fixed point theorems for widely more generalized hybrid non-self mappings in a Hilbert space by using the idea of Hojo <i>et al.</i> (Fixed Point Theory 12:113-126, 2011) and Kawasaki and Takahashi fixed point theorems (J.Nonlinear Convex Anal. 14:71-87, 2013). Using these fixed point theorems for non-self mappings, we proved the Browder and Petryshyn fixed point theorem (J.Math. Anal. Appl. 20:197-228, 1967) for strict pseudo-contractive

We introduce an entropy-like proximal algorithm for the problem of minimizing a closed proper convex function subject to symmetric cone constraints. The algorithm is based on a distance-like function that is an extension of the Kullback-Leiber relative entropy to the setting of symmetric cones. Like the proximal algorithms for convex programming with nonnegative orthant cone constraints, we show that, under some mild assumptions, the sequence generated by the proposed algorithm is bounded and every accumulation point is a solution of the considered problem. In addition, we also present a dual application of the proposed algorithm to the symmetric cone linear program, leading to a multiplier method which is shown to possess similar properties as the exponential multiplier method (Tseng and Bertsekas in Math. Program. 60:119, 1993) holds.

No abstract uploaded!