Stability and asymptotic stability of -methods for nonlinear stiff Volterra functional differential equations in Banach spaces

This paper is concerned with the stability and asymptotic stability of θ-methods for the initial value problems of nonlinear stiff Volterra functional differential equations in Banach spaces. A series of new stability and asymptotic stability results of θ-methods are obtained.     

Algorithm for solving a new class of general mixed variational inequalities in Banach spaces

In this paper, a new concept of η-proximal mapping for a proper subdifferentiable functional (which may not be convex) on a Banach space is introduced. An existence and Lipschitz continuity of the η-proximal mapping are proved. By using properties of the η-proximal mapping, a new class of general mixed variational inequalities is introduced and studied in Banach spaces. An existence theorem of solutions is established and a new iterative algorithm for solving the general mixed variational inequality is suggested. A convergence criteria of the iterative sequence generated by the new algorithm is also given.     

Stability for parametric implicit vector equilibrium problems

In this paper, we consider a class of parametric implicit vector equilibrium problems in Hausdorff topological vector spaces where a mapping f and a set K are perturbed by parameters and λ, respectively. We establish sufficient conditions for the upper semicontinuity and lower semicontinuity of the solution set mapping S:Λ₁×Λ₂→2^X for such parametric implicit vector equilibrium problems.     

Projective change between two classes of -metrics

In this paper, we find equations to characterize projective change between (α,β)-metric and Randers metric on a manifold with dimension n3, where α and are two Riemannian metrics, β and are two nonzero one forms. Moreover, we consider this projective change when F has some special curvature properties.     

Operation properties and -equalities of complex fuzzy sets

A complex fuzzy set is a fuzzy set whose membership function takes values in the unit circle in the complex plane. This paper investigates various operation properties and proposes a distance measure for complex fuzzy sets. The distance of two complex fuzzy sets measures the difference between the grades of two complex fuzzy sets as well as that between the phases of the two complex fuzzy sets. This distance measure is then used to define δ-equalities of complex fuzzy sets which coincide with those of fuzzy sets already defined in the literature if complex fuzzy sets reduce to real-valued fuzzy sets. Two complex fuzzy sets are said to be δ-equal if the distance between them is less than 1-δ. This paper shows how various operations between complex fuzzy sets affect given δ-equalities of complex fuzzy sets. An example application of signal detection demonstrates the utility of the concept of δ-equalities of complex fuzzy sets in practice.     

Norm of weighted composition operators from -Bloch spaces to weighted-type spaces

We calculate in an elegant way operator norm of the weighted composition operator from the α-Bloch space, with α(0,∞){1}, to a weighted-type space on the unit ball. This result can be regarded as a complement to our recent result regarding the same problem for the case α=1.     

Numerical comparison of nonlinear subgridscale models via adaptive mesh refinement

In this paper, we provide a method of evaluating the efficacy of nonlinear subgridscale models for use in the large eddy simulation of incompressible viscous flow problems. We compare subgridscale “artificial” viscosity models using a posteriori error estimation and adaptive mesh refinement. Specifically, we compare α-Laplacian based subgridscale models and discuss the benefits and limitations of different values of α for some standard benchmark problems for the Navier–Stokes equations.     

Ordinal machines and admissible recursion theory

We generalize standard Turing machines, which work in time ω on a tape of length ω, to α-machines with time α and tape length α, for α some limit ordinal. We show that this provides a simple machine model adequate for classical admissible recursion theory as developed by G. Sacks and his school. For α an admissible ordinal, the basic notions of α-recursive or α-recursively enumerable are equivalent to being computable or computably enumerable by an α-machine, respectively. We emphasize the algorithmic approach to admissible recursion theory by indicating how the proof of the Sacks–Simpson theorem, i.e., the solution of Post’s problem in α-recursion theory, could be based on α-machines, without involving constructibility theory.     

Optimality conditions for multiple objective fractional subset programming with ( , ρ,σ,θ )-V-type-I and related non-convex functions

In this paper, we introduce a new class of generalized convex n-set functions, called ( , ρ,σ,θ)-V-Type-I and related non-convex functions, and then establish a number of parametric and semi-parametric sufficient optimality conditions for the primal problem under the aforesaid assumptions. This work partially extends an earlier work of [G.J. Zalmai, Efficiency conditions and duality models for multiobjective fractional subset programming problems with generalized ( , α, ρ, θ)-V-convex functions, Comput. Math. Appl. 43 (2002) 1489–1520] to a wider class of functions.     

A completeness result for the simply typed -calculus

In this paper, we define a realizability semantics for the simply typed λμ-calculus. We show that, if a term is typable, then it inhabits the interpretation of its type. This result serves to give characterizations of the computational behavior of some closed typed terms. We also prove a completeness result of our realizability semantics using a particular term model.     

Interlacing and spacing properties of zeros of polynomials, in particular of orthogonal and -minimal polynomials,

Let be a sequence of polynomials with real coefficients such that uniformly for [α-δ,β+δ] with G(eⁱ)≠0 on [α,β], where 0α<βπ and δ>0. First it is shown that the zeros of are dense in [α,β], have spacing of precise order π/n and are interlacing with the zeros of p_n+1(cos) on [α,β] for every nn₀. Let be another sequence of real polynomials with uniformly on [α-δ,β+δ] and on [α,β]. It is demonstrated that for all sufficiently large n the zeros of p_n(cos) and strictly interlace on [α,β] if on [α,β]. If the last expression is zero then a weaker kind of interlacing holds. These interlacing properties of the zeros are new for orthogonal polynomials also. For instance, for large n a simple criteria for interlacing of zeros of Jacobi polynomials on [-1+,1-], >0, is obtained. Finally it is shown that the results hold for wide classes of weighted L_q-minimal polynomials, q[1,∞], linear combinations and products of orthogonal polynomials, etc.     

The p-step iterative algorithm for a system of generalized mixed quasi-variational inclusions with -accretive operators in q-uniformly smooth banach spaces

In this paper, we introduce and study a new system of generalized mixed quasi-variational inclusions with (A,η)-accretive operators in q-uniformly smooth Banach spaces. By using the resolvent operator technique associated with (A,η)-accretive operators, we construct a new p-step iterative algorithm for solving this system of generalized mixed quasi-variational inclusions in real q-uniformly smooth Banach spaces. We also prove the existence of solutions for the generalized mixed quasi-variational inclusions and the convergence of iterative sequences generated by algorithm. Our results improve and generalize many known corresponding results.     

A new exclusion test for finding the global minimum

Exclusion algorithms have been used recently to find all solutions of a system of nonlinear equations or to find the global minimum of a function over a compact domain. These algorithms are based on a minimization condition that can be applied to each cell in the domain. In this paper, we consider Lipschitz functions of order α and give a new minimization condition for the exclusion algorithm. Furthermore, convergence and complexity results are presented for such algorithm.     

Combinatorial congruences and -operators

The ψ-operator for (,Γ)-modules plays an important role in the study of Iwasawa theory via Fontaine's big rings. In this note, we prove several sharp estimates for the ψ-operator in the cyclotomic case. These estimates immediately imply a number of sharp p-adic combinatorial congruences, one of which extends the classical congruences of Fleck (1913) and Weisman [Some congruences for binomial coefficients, Michigan Math. J. 24 (1977) 141–151].     

Second-order symmetric duality with cone constraints

Wolfe and Mond–Weir type second-order symmetric duals are formulated and appropriate duality theorems are established under η-bonvexity/η-pseudobonvexity assumptions. This formulation removes several omissions in an earlier second-order primal dual pair introduced by Devi [Symmetric duality for nonlinear programming problems involving η-bonvex functions, European J. Oper. Res. 104 (1998) 615–621].     

A new iterative method for equilibrium problems and fixed point problems of infinitely nonexpansive mappings and monotone mappings

In this paper, we introduce a new iterative scheme for finding the common element of the set of common fixed points of infinitely many nonexpansive mappings, the set of solutions of an equilibrium problem and the set of solutions of the variational inequality for α-inverse-strongly monotone mapping in Hilbert spaces. We prove that the sequence converges strongly to a common element of the above three sets under some parameters controlling conditions. This main result improve and extend Plubtieng and Punpaeng’s corresponding result [S. Plubtieng, R. Punpaeng, A new iterative method for equilibrium problems and fixed point problems of nonexpansive mappings and monotone mappings, Applied Mathematics and Computation 197 (2008), 548–558]. Using this theorem, we obtain three corollaries.     

Rates of -statistical convergence of positive linear operators

In this paper we study the rates of A-statistical convergence of sequences of positive linear operators mapping the weighted space C_ρ1 into the weighted space B_ρ2.     

Reduction of the Gibbs phenomenon for smooth functions with jumps by the -algorithm

Recently, Brezinski has proposed to use Wynn's ε-algorithm in order to reduce the Gibbs phenomenon for partial Fourier sums of smooth functions with jumps, by displaying very convincing numerical experiments. In the present paper we derive analytic estimates for the error corresponding to a particular class of hypergeometric functions, and obtain the rate of column convergence for such functions, possibly perturbed by another sufficiently differentiable function. We also analyze the connection to Padé–Fourier and Padé–Chebyshev approximants, including those recently studied by Kaber and Maday.     

Positive solutions for Robin problem involving the -Laplacian

Consider Robin problem involving the p(x)-Laplacian on a smooth bounded domain Ω as follows

Applying the sub-supersolution method and the variational method, under appropriate assumptions on f, we prove that there exists λ_*>0 such that the problem has at least two positive solutions if λ(0,λ_*), has at least one positive solution if λ=λ_*<+∞ and has no positive solution if λ>λ_*. To prove the results, we prove a norm on W^1,p(x)(Ω) without the part of ||_L^p(x)(Ω) which is equivalent to usual one and establish a special strong comparison principle for Robin problem.     

Anti-periodic solutions for a class of nonlinear th-order differential equations with delays

In this paper, we use the Leray–Schauder degree theory to establish new results on the existence and uniqueness of anti-periodic solutions for a class of nonlinear nth-order differential equations with delays of the form

x⁽ⁿ⁾(t)+f(t,x⁽ⁿ⁻¹⁾(t))+g(t,x(t−τ(t)))=e(t).