No abstract uploaded!

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.

Let be a locally compact Hausdorff space. We show that any local -linear map (where" local" is a weaker notion than -linearity) between Banach -modules are" nearly -linear" and" nearly bounded". As an application, a local -linear map between Hilbert -modules is automatically -linear. If, in addition, contains no isolated point, then any -linear map between Hilbert -modules is automatically bounded. Another application is that if a sequence of maps between two Banach spaces" preserve -sequences"(or" preserve ultra- -sequences"), then is bounded for large enough and they have a common bound. Moreover, we will show that if is a bijective" biseparating" linear map from a" full" essential Banach -module into a" full" Hilbert -module (where is another locally compact Hausdorff space), then is" nearly bounded"(in fact, it is automatically bounded if or contains no isolated point) and there exists a homeomorphism such that ( ).

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.

The SOC-monotone function (respectively, SOC-convex function) is a scalar valued function that induces a map to preserve the monotone order (respectively, the convex order), when imposed on the spectral factorization of vectors associated with second-order cones (SOCs) in general Hilbert spaces. In this paper, we provide the sufficient and necessary characterizations for the two classes of functions, and particularly establish that the set of continuous SOC-monotone (respectively, SOC-convex) functions coincides with that of continuous matrix monotone (respectively, matrix convex) functions of order 2.