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.     

Hessenberg pairs of linear transformations

Let denote a field and V denote a nonzero finite-dimensional vector space over . We consider an ordered pair of linear transformations A:V→V and A^*:V→V that satisfy (i)–(iii) below.

1. [(i)]Each of A,A^* is diagonalizable on V.

2. [(ii)]There exists an ordering of the eigenspaces of A such that

where V_-1=0, V_d+1=0.

3. [(iii)]There exists an ordering of the eigenspaces of A^* such that

where , .

We call such a pair a Hessenberg pair on V. In this paper we obtain some characterizations of Hessenberg pairs. We also explain how Hessenberg pairs are related to tridiagonal pairs.

New exact solutions to the -dimensional Konopelchenko–Dubrovsky equation

In this paper, the extended tanh method, the sech–csch ansatz, the Hirota’s bilinear formalism combined with the simplified Hereman form and the Darboux transformation method are applied to determine the traveling wave solutions and other kinds of exact solutions for the (2+1)-dimensional Konopelchenko–Dubrovsky equation and abundant new soliton solutions, kink solutions, periodic wave solutions and complexiton solutions are formally derived. The work confirms the significant features of the employed methods and shows the variety of the obtained solutions.     

Using fractional primal–dual to schedule split intervals with demands

We consider the problem of scheduling jobs that are given as groups of non-intersecting intervals on the real line. Each job j is associated with a t-interval (which consists of up to t segments, for some t≥1), a demand, d_j[0,1], and a weight, w(j). A feasible schedule is a collection of jobs such that, for every , the total demand of the jobs in the schedule whose t-interval contains s does not exceed 1. Our goal is to find a feasible schedule that maximizes the total weight of scheduled jobs.We present a 6t-approximation algorithm for this problem that uses a novel extension of the primal–dual schema called fractional primal–dual. The first step in a fractional primal–dual r-approximation algorithm is to compute an optimal solution, x^*, of an LP relaxation of the problem. Next, the algorithm produces an integral primal solution x, and a new LP, denoted by P′, that has the same objective function as the original problem, but contains inequalities that may not be valid with respect to the original problem. Moreover, x^* is a feasible solution of P′. The algorithm also computes a solution y to the dual of P′. The solution x is r-approximate, since its weight is bounded by the value of y divided by r.We present a fractional local ratio interpretation of our 6t-approximation algorithm. We also discuss the connection between fractional primal–dual and the fractional local ratio technique. Specifically, we show that the former is the primal–dual manifestation of the latter.     

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.     

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

     

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.     

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.     

A cone complementarity linearization approach to robust controller design for continuous-time piecewise linear systems with linear fractional uncertainties

This paper investigates the robust H_∞ control problem for uncertain continuous-time piecewise systems by using the piecewise continuous Lyapunov function. The uncertainties of the systems under consideration are expressed in a linear fractional form. A strict linear matrix inequality approach is developed to obtain stability condition and H_∞ performance. The H_∞ controller design problem is solved by exploiting the cone complementarity linearization (CCL) method, which can be cast into an iterative minimization problem subject to LMI constraints. Finally two examples are given to illustrate the application of the proposed approach.     

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

A new proof of the Gasca–Maeztu conjecture for

In the Chung–Yao construction of poised nodes for bivariate polynomial interpolation [K.C. Chung, T.H. Yao, On lattices admitting unique Lagrange interpolations, SIAM J. Numer. Anal. 14 (1977) 735–743], the interpolation nodes are intersection points of some lines. The Berzolari–Radon construction [L. Berzolari, Sulla determinazione di una curva o di una superficie algebrica e su alcune questioni di postulazione, Lomb. Ist. Rend. 47 (2) (1914) 556–564; J. Radon, Zur mechanischen Kubatur, Monatsh. Math. 52 (1948) 286–300] seems to be more general, since in this case the nodes of interpolation lie (almost) arbitrarily on some lines. In 1982 Gasca and Maeztu conjectured that every poised set allowing the Chung–Yao construction is of Berzolari–Radon type. So far, this conjecture has been confirmed only for polynomial spaces of small total degree n≤4, the result being evident for n≤2 and not hard to see for n=3. For the case n=4 two proofs are known: one of J.R. Busch [J.R. Busch, A note on Lagrange interpolation in , Rev. Un. Mat. Argentina 36 (1990) 33–38], and another of J.M. Carnicer and M. Gasca [J.M. Carnicer, M. Gasca, A conjecture on multivariate polynomial interpolation, Rev. R. Acad. Cienc. Exactas Fís. Nat. (Esp.) Ser. A Mat. 95 (2001) 145–153]. Here we present a third proof which seems to be more geometric in nature and perhaps easier. We also present some results for the case of n=5 and for general n which might be useful for later consideration of the problem.     

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.     

An iterative algorithm based on -proximal mappings for a system of generalized implicit variational inclusions in Banach spaces

In this paper, we give the notion of M-proximal mapping, an extension of P-proximal mapping given in [X.P. Ding, F.Q. Xia, A new class of completely generalized quasi-variational inclusions in Banach spaces, J. Comput. Appl. Math. 147 (2002) 369–383], for a nonconvex, proper, lower semicontinuous and subdifferentiable functional on Banach space and prove its existence and Lipschitz continuity. Further, we consider a system of generalized implicit variational inclusions in Banach spaces and show its equivalence with a system of implicit Wiener–Hopf equations using the concept of M-proximal mappings. Using this equivalence, we propose a new iterative algorithm for the system of generalized implicit variational inclusions. Furthermore, we prove the existence of solution of the system of generalized implicit variational inclusions and discuss the convergence and stability analysis of the iterative algorithm.     

Uniform Kazhdan constant for some families of linear groups

Let R be a ring generated by l elements with stable range r. Assume that the group EL_d(R) has Kazhdan constant ₀>0 for some dr+1. We prove that there exist (₀,l)>0 and , s.t. for every nd, EL_n(R) has a generating set of order k and a Kazhdan constant larger than . As a consequence, we obtain for where n3, a Kazhdan constant which is independent of n w.r.t. generating set of a fixed size.     

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 well-posedness and stability of a repairable standby human–machine system

In this paper, the solution of a standby human–machine system is investigated. By using the method of functional analysis, especially, the linear operator theory and the C₀ semigroup theory on Banach space, we prove the well-posedness and the existence of a positive solution of the system. And under some appropriate hypotheses, we study the asymptotic stability of solution of the system.     

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