Symmetric duality with (p, r) − ρ − (η, θ)-invexity

In this paper we introduce a new type of generalized invex function, called (p, r) − ρ − (η, θ)-invex function and study symmetric duality results under these assumptions. In our study the nonnegative orthants for the constraints are replaced by closed convex cones and their polars. We establish weak and strong duality theorems under (p, r) − ρ − (η, θ)-invexity assumptions for the symmetric dual problems. We also give many examples to justify our results.     

Fixed point theorems of ? convex −ψ concave mixed monotone operators and applications

In this paper, ? convex −ψ concave mixed monotone operators are introduced and some new existence and uniqueness theorems of fixed points for mixed monotone operators with such convexity concavity are obtained. As an application, we give one example to illustrate our results.     

Computational study of decaying annular vortex flow using the Rε/k − ε turbulence model

In this article, we present three dimensional CFD study of turbulent vortex flow in an annular passage using OpenFOAM 1.6. The vortex flow is generated by introducing the flow through a tangential entry to the passage. For the analysis presented in this article, turbulence was modeled using the R_ε/k − ε model, in addition, a comparison between such model with the standard k − ε model was conducted and discussed. The main characteristics of the flow such as vortex structure and recirculation zone were investigated. It was found that flow is subjected to Rankine vortex structure with three forced vortex regimes and a free vortex region near to the outer wall. The phenomenon of vortex decay was investigated by depicting the swirl number trend along the axial direction of the flow domain. It was found that the vortex decay is subjected to an exponential decay behavior. New coefficients for the exponential decay correlation were derived based on local values of velocity components in different radial planes.     

Equidistribution of Hecke Eigenforms on the Arithmetic Surface Γ0(N)\H

Given the orthonormal basis of Hecke eigenforms in S_2k(Γ(1)), Luo established an associated probability measure dμ_k on the modular surface Γ(1)\H that tends weakly to the invariant measure on Γ(1)\H. We generalize his result to the arithmetic surface Γ₀(N)\H where N?1 is square-free     

On Tauberian theorems for (A)(C, α) summability method

In this paper we introduce some Tauberian conditions for the (A)(C, α) summability method. These results extend and generalize some of the classical Tauberian theorems for the Abel summability method.     

Nonsmooth minimax programming under locally Lipschitz (Φ, ρ)-invexity

Minimax programming problems involving locally Lipschitz (Φ, ρ)-invex functions are considered. The parametric and non-parametric necessary and sufficient optimality conditions for a class of nonsmooth minimax programming problems are obtained under nondifferentiable (Φ, ρ)-invexity assumption imposed on objective and constraint functions. When the sufficient conditions are utilized, parametric and non-parametric dual problems in the sense of Mond-Weir and Wolfe may be formulated and duality results are derived for the considered nonsmooth minimax programming problem. With the reference to the said functions we extend some results of optimality and duality for a larger class of nonsmooth minimax programming problems.     

Approximation of signals of class Lip(α, p) by linear operators

Mittal, Rhoades [5], [6], [7] and [8] and Mittal et al. [9] and [10] have initiated a study of error estimates E_n(f) through trigonometric-Fourier approximation (tfa) for the situations in which the summability matrix T does not have monotone rows. In this paper we continue the work. Here we extend two theorems of Leindler [4], where he has weakened the conditions on {p_n} given by Chandra [2], to more general classes of triangular matrix methods. Our Theorem also partially generalizes Theorem 4 of Mittal et al. [11] by dropping the monotonicity on the elements of matrix rows, which in turn generalize the results of Quade [15].     

Semiconductor final test scheduling with Sarsa(λ, k) algorithm

Semiconductor test scheduling problem is a variation of reentrant unrelated parallel machine problems considering multiple resource constraints, intricate {product, tester, kit, enabler assembly} eligibility constraints, sequence-dependant setup times, etc. A multi-step reinforcement learning (RL) algorithm called Sarsa(λ, k) is proposed and applied to deal with the scheduling problem with throughput related objective. Allowing enabler reconfiguration, the production capacity of the test facility is expanded and scheduling optimization is performed at the bottom level. Two forms of Sarsa(λ, k), i.e. forward view Sarsa(λ, k) and backward view Sarsa(λ, k), are constructed and proved equivalent in off-line updating. The upper bound of the error of the action-value function in tabular Sarsa(λ, k) is provided when solving deterministic problems. In order to apply Sarsa(λ, k), the scheduling problem is transformed into an RL problem by representing states, constructing actions, the reward function and the function approximator. Sarsa(λ, k) achieves smaller mean scheduling objective value than the Industrial Method (IM) by 68.59% and 76.89%, respectively for real industrial problems and randomly generated test problems. Computational experiments show that Sarsa(λ, k) outperforms IM and any individual action constructed with the heuristics derived from the existing heuristics or scheduling rules.     

New approximation-solvability of general nonlinear operator inclusion couples involving (A, η, m)-resolvent operators and relaxed cocoercive type operators

In this paper, we consider and study a class of general nonlinear operator inclusion couples involving (A, η, m)-resolvent operators and relaxed cocoercive type operators in Hilbert spaces. We also construct a new perturbed iterative algorithm framework with errors and investigate variational graph convergence analysis for this algorithm framework in the context of solving the nonlinear operator inclusion couple along with some results on the resolvent operator corresponding to (A, η, m)-maximal monotonicity. The obtained results improve and generalize some well known results in recent literatures.     

On simultaneous approximation to (α,α) with α+kα−1=0

We show that the modified Jacobi-Perron algorithm gives the best simultaneous approximation to (α,α²) with α³+kα−1=0. We claim the following facts:

(1)

the limit set of become an ellipse, where (p_n,q_n,r_n) is the nth convergent (p_n/q_n,r_n/q_n) of (α,α²) by the modified Jacobi-Perron algorithm,

(2)

the limit set of belongs to outside of the ellipse in (1).

     

Sur l'équation divu=fOn the equation divu=f

The main result is the following. Let $\text{Ω}$ be a bounded Lipschitz domain in $\text{R}{}^{\mathrm{d}}$, d?2. Then for every $\text{f∈}\text{L}{}^{\mathrm{d}}\text{(Ω)}$ with ∫f=0, there exists a solution $\text{u∈}\text{C}{}^0\text{(}\text{Ω}\text{)∩}\text{W}{}^{\mathrm{1,d}}\text{(Ω)}$ of the equation divu=f in $\text{Ω}$, satisfying in addition u=0 on $\text{?Ω}$ and the estimate

where C depends only on $\text{Ω}$. However one cannot choose u depending linearly on f. To cite this article: J. Bourgain, H. Brezis, C. R. Acad. Sci. Paris, Ser. I 334 (2002) 973–976.     

Conditions for the [`(?)] \bar \partial -closedness of differential forms

The $ \bar \partial $ \bar \partial -closed differential forms with smooth coefficients are studied in the closure of a bounded domain D ⊂ ℂ ⁿ . It is demonstrated that the condition of $ \bar \partial $ \bar \partial -closedness can be replaced with a weaker differential condition in the domain and differential conditions on the boundary. In particular, for the forms with harmonic coefficients the $ \bar \partial $ \bar \partial -closedness is equivalent to some boundary relations. This allows us to treat the results as conditions for the $ \bar \partial $ \bar \partial -closedness of an extension of a form from the boundary.     

Global existence of solutions for a nonlinearly perturbed Keller–Segel system in \mathbbR2{\mathbb{R}}^2

We show the global existence of small solution to the perturbed Keller–Segel system of simplified version. Our system has a perturbed nonlinear term of worse sign, therefore the existence and uniqueness of solution is not really obvious. The local existence theorem is obtained by a variational observation for the elliptic part.     

Optimal regularity for [`(?)] b\bar \partial _b on CR manifoldson CR manifolds

In this paper a new explicit integral formula is derived for solutions of the tangential Cauchy-Riemann equations on CR q-concave manifolds and optimal estimates in the Lipschitz norms are obtained.     

Boundary penalty finite element methods for blending surfaces, . Superconvergence and stability and examples

This paper is Part III of the study on blending surfaces by partial differential equations (PDEs). The blending surfaces in three dimensions (3D) are taken into account by three parametric functions, x(r,t),y(r,t) and z(r,t). The boundary penalty techniques are well suited to the complicated tangent (i.e., normal derivative) boundary conditions in engineering blending. By following the previous papers, Parts I and II in Li (J. Comput. Math. 16 (1998) 457–480; J. Comput. Appl. Math. 110 (1999) 155–176) the corresponding theoretical analysis is made to discover that when the penalty power σ=2, σ=3 (or 3.5) and 0<σ1.5 in the boundary penalty finite element methods (BP-FEMs), optimal convergence rates, superconvergence and optimal numerical stability can be achieved, respectively. Several interesting samples of 3D blending surfaces are provided, to display the remarkable advantages of the proposed approaches in this paper: unique solutions of blending surfaces, optimal blending surfaces in minimum energy, ease in handling the complicated boundary constraint conditions, and less CPU time and computer storage needed. This paper and Li (J. Comput. Math. 16 (1998) 457–480; J. Comput. Appl. Math.) provide a foundation of blending surfaces by PDE solutions, a new trend of computer geometric design.     

Splitting extrapolation for solving second order elliptic systems with curved boundary in by using d-quadratic isoparametric finite element

Splitting extrapolation for solving second order elliptic systems with curved boundary in by using isoparametric d-quadratic element Q₂ is presented, which is a new technique for solving large scale scientific and engineering problems in parallel. By means of domain decomposition, a large scale multidimensional problem with curved boundary is turned into many discrete problems involving several grid parameters. The multivariate asymptotic expansions of isoparametric d-quadratic Q₂ finite element errors with respect to independent grid parameters are proved for second order elliptic systems. Therefore after solving smaller problems with similar sizes in parallel, a global fine grid approximation with higher accuracy is computed by the splitting extrapolation method.     

Implementation and efficiency analysis of an adaptive <Emphasis Type="Italic">hp</Emphasis>-finite element method for solving boundary value problems for the stationary reaction–diffusion equation

An iterative process implementing an adaptive hp-version of the finite element method (FEM) previously proposed by the authors for the approximate solution of boundary value problems for the stationary reaction–diffusion equation is described. The method relies on piecewise polynomial basis functions and makes use of an adaptive strategy for constructing a sequence of finite-dimensional subspaces based on the computation of correction indicators. Singularly perturbed boundary value test problems with smooth and not very smooth solutions are used to analyze the efficiency of the method in the situation when an approximate solution has to be found with high accuracy. The convergence of the approximate solution to the exact one is investigated depending on the value of the small parameter multiplying the highest derivative, on the family of basis functions and the quadrature formulas used, and on the internal parameters of the method. The method is compared with an adaptive h-version of FEM that also relies on correction indicators and with its nonadaptive variant based on the bisection of grid intervals.     

A characterization for the neighbor-distinguishing total chromatic number of planar graphs with Δ=13

The neighbor-distinguishing total chromatic number ${\chi }_a^{\prime \prime }\left(G\right)$ of a graph $G$ is the smallest integer $k$ such that $G$ can be totally colored using $k$ colors with a condition that any two adjacent vertices have different sets of colors. In this paper, we give a sufficient and necessary condition for a planar graph $G$ with maximum degree 13 to have ${\chi }_a^{\prime \prime }\left(G\right)=14$ or ${\chi }_a^{\prime \prime }\left(G\right)=15$. Precisely, we show that if $G$ is a planar graph of maximum degree 13, then $14\le {\chi }_a^{\prime \prime }\left(G\right)\le 15$; and ${\chi }_a^{\prime \prime }\left(G\right)=15$ if and only if $G$ contains two adjacent 13-vertices.