Existence of periodic solutions for a fourth-order -Laplacian equation with a deviating argument

In this paper, we study the existence of periodic solutions for a fourth-order p-Laplacian differential equation with a deviating argument as follows:

[φ_p(u^″(t))]^″+f(u^″(t))+g(u(t−τ(t)))=e(t).

Under various assumptions, the existence of periodic solutions of the problem is obtained by applying Mawhin’s continuation theorem.     

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.     

The determining equations for the nonclassical method of the nonlinear differential equation(s) with arbitrary order can be obtained through the compatibility

In this paper, firstly we show that the determining equations of the (1+1) dimension nonlinear differential equation with arbitrary order for the nonclassical method can be derived by the compatibility between the original equation and the invariant surface condition. Then we generalize this result to the system of the (m+1) dimension differential equations. The nonlinear Klein–Gordon equation, the (2+1)-dimensional Boussinesq equation and the generalized Nizhnik–Novikov–Veselov equation serve as examples illustrating this method.     

Strong convergence theorems by hybrid method for asymptotically -strict pseudo-contractive mapping in Hilbert space

In this paper, we introduce the hybrid method of modified Mann’s iteration for an asymptotically k-strict pseudo-contractive mapping. Then we prove that such a sequence converges strongly to P_F(T)x₀. This main theorem improves the result of Issara Inchan [I. Inchan, Strong convergence theorems of modified Mann iteration methods for asymptotically nonexpansive mappings in Hilbert spaces, Int. J. Math. Anal. 2 (23) (2008) 1135–1145] and concerns the result of Takahashi et al. [W. Takahashi, Y. Takeuchi, R. Kubota, Strong convergence theorems by hybrid methods for families of nonexpansive mappings in Hilbert space, J. Math. Anal. Appl. 341 (2008) 276–286], and many others.     

Completions of -algebras

A μ-algebra is a model of a first-order theory that is an extension of the theory of bounded lattices, that comes with pairs of terms (f,μ_x.f) where μ_x.f is axiomatized as the least prefixed point of f, whose axioms are equations or equational implications.Standard μ-algebras are complete meaning that their lattice reduct is a complete lattice. We prove that any nontrivial quasivariety of μ-algebras contains a μ-algebra that has no embedding into a complete μ-algebra.We then focus on modal μ-algebras, i.e. algebraic models of the propositional modal μ-calculus. We prove that free modal μ-algebras satisfy a condition–reminiscent of Whitman’s condition for free lattices–which allows us to prove that (i) modal operators are adjoints on free modal μ-algebras, (ii) least prefixed points of Σ₁-operations satisfy the constructive relation μ_x.f=_n≥0fⁿ(). These properties imply the following statement: the MacNeille–Dedekind completion of a free modal μ-algebra is a complete modal μ-algebra and moreover the canonical embedding preserves all the operations in the class of the fixed point alternation hierarchy.     

Formal systems of fuzzy logic and their fragments

Formal systems of fuzzy logic (including the well-known Łukasiewicz and Gödel–Dummett infinite-valued logics) are well-established logical systems and respected members of the broad family of the so-called substructural logics closely related to the famous logic BCK. The study of fragments of logical systems is an important issue of research in any class of non-classical logics. Here we study the fragments of nine prominent fuzzy logics to all sublanguages containing implication. However, the results achieved in the paper for those nine logics are usually corollaries of theorems with much wider scope of applicability. In particular, we show how many of these fragments are really distinct and we find axiomatic systems for most of them. In fact, we construct strongly separable axiomatic systems for eight of our nine logics. We also fully answer the question for which of the studied fragments the corresponding class of algebras forms a variety. Finally, we solve the problem how to axiomatize predicate versions of logics without the lattice disjunction (an essential connective in the usual axiomatic system of fuzzy predicate logics).     

Travelling wave solutions for the nonlinear dispersion Drinfel’d–Sokolov () system

In this paper, travelling wave solutions for the nonlinear dispersion Drinfel’d–Sokolov system (called D(m,n) system) are studied by using the Weierstrass elliptic function method. As a result, more new exact travelling wave solutions to the D(m,n) system are obtained including not only all the known solutions found by Xie and Yan but also other more general solutions for different parameters m,n. Moreover, it is also shown that the D(m,1) system with linear dispersion possess compacton and solitary pattern solutions. Besides that, it should be pointed out that the approach is direct and easily carried out without the aid of mathematical software if compared with other traditional methods. We believe that the method can be widely applied to other similar types of nonlinear partial differential equations (PDEs) or systems in mathematical physics.     

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.     

Stability analysis of the zero solution for two class evolution equations

By constructing some suitable Lyapunov-type functionals and applying the theory of the definite-quadratic form, we obtain the stability of the zero solution of two classes of evolution equations with delays, including reaction–diffusion equations and damped wave equations. Our criteria depend on the derivatives of delays. Consequently, when the delays are constants, these criteria are independent of the magnitudes of the delays, so the delays are harmless for the stability of the zero solution.     

Accelerating gradient projection methods for -constrained signal recovery by steplength selection rules

We propose a new gradient projection algorithm that compares favorably with the fastest algorithms available to date for ℓ₁-constrained sparse recovery from noisy data, both in the compressed sensing and inverse problem frameworks. The method exploits a line-search along the feasible direction and an adaptive steplength selection based on recent strategies for the alternation of the well-known Barzilai–Borwein rules. The convergence of the proposed approach is discussed and a computational study on both well conditioned and ill-conditioned problems is carried out for performance evaluations in comparison with five other algorithms proposed in the literature.     

A note on preconditioned AOR method for -matrices

In this note, some errors in a recent article by Li et al. (Improvements of preconditioned AOR iterative methods for L-matrices, J. Comput. Appl. Math. 206 (2007) 656–665) are pointed out and some correct results are presented.     

Approximation results for the weighted partition problem

We present several new standard and differential approximation results for the P₄-partition problem using the Hassin and Rubinstein algorithm [Information Processing Letters 63 (1997) 63–67]. Those results concern both minimization and maximization versions of the problem. However, the main point of this paper lies in the establishment of the robustness of this algorithm, in the sense that it provides good quality solutions for a variety of versions of the problem, under both standard and differential approximation ratios.     

Dynamical analysis of the transmission of seasonal diseases using the differential transformation method

The aim of this paper is to apply the differential transformation method (DTM) to solve systems of nonautonomous nonlinear differential equations that describe several epidemic models where the solutions exhibit periodic behavior due to the seasonal transmission rate. These models describe the dynamics of the different classes of the populations. Here the concept of DTM is introduced and then it is employed to derive a set of difference equations for this kind of epidemic models. The DTM is used here as an algorithm for approximating the solutions of the epidemic models in a sequence of time intervals. In order to show the efficiency of the method, the obtained numerical results are compared with the fourth-order Runge–Kutta method solutions. Numerical comparisons show that the DTM is accurate, easy to apply and the calculated solutions preserve the properties of the continuous models, such as the periodic behavior. Furthermore, it is showed that the DTM avoids large computational work and symbolic computation.     

Characterizations and construction of Poisson/symplectic and symmetric multi-revolution implicit Runge–Kutta methods of high order

This paper deals with the characterizations and construction of Poisson/symplectic and (φ⁻¹)-symmetric implicit high-order multi-revolution Runge–Kutta methods (MRRKMs). The basic tool is a modified W-transformation based on quadrature formulas and orthogonal polynomials. Two sufficient conditions can be obtained under which MRRKMs are Poisson/symplectic or (φ⁻¹)-symmetric. We construct two classes of high order implicit MRRKMs by using these sufficient conditions. Our results can be considered as an extension of related results of the standard Runge–Kutta methods in some references.     

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 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.     

Discrete -convex extremal distributions: Theory and applications

Given a nondegenerate moment space with s fixed moments, explicit formulas for the discrete s-convex extremal distribution have been derived for s=1,2,3 (see [M. Denuit, Cl. Lefèvre, Some new classes of stochastic order relations among arithmetic random variables, with applications in actuarial sciences, Insurance Math. Econom. 20 (1997) 197–214]). If s=4, only the maximal distribution is known (see [M. Denuit, Cl. Lefèvre, M. Mesfioui, On s-convex stochastic extrema for arithmetic risks, Insurance Math. Econom. 25 (1999) 143–155]). This work goes beyond this limitation and proposes a method for deriving explicit expressions for general nonnegative integer s. In particular, we derive explicitly the discrete 4-convex minimal distribution. For illustration, we show how this theory allows one to bound the probability of extinction in a Galton–Watson branching process. The results are also applied to derive bounds for the probability of ruin in the compound binomial and Poisson insurance risk models.     

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).