Persistence, contractivity and global stability in logistic equations with piecewise constant delays

We establish sufficient conditions for the persistence and the contractivity of solutions and the global asymptotic stability for the positive equilibrium N^*=1/(a+∑_i=0^mb_i) of the following differential equation with piecewise constant arguments:

where r(t) is a nonnegative continuous function on [0,+∞), r(t)0, ∑_i=0^mb_i>0, b_i0, i=0,1,2,…,m, and a+∑_i=0^mb_i>0. These new conditions depend on a,b₀ and ∑_i=1^mb_i, and hence these are other type conditions than those given by So and Yu (Hokkaido Math. J. 24 (1995) 269–286) and others. In particular, in the case m=0 and r(t)≡r>0, we offer necessary and sufficient conditions for the persistence and contractivity of solutions. We also investigate the following differential equation with nonlinear delay terms:

where r(t) is a nonnegative continuous function on [0,+∞), r(t)0, 1−ax−g(x,x,…,x)=0 has a unique solution x^*>0 and g(x₀,x₁,…,x_m)C¹[(0,+∞)×(0,+∞)××(0,+∞)].     

Unbounded divergence of simple quadrature formulas

Given a sequence of real or complex coefficients c_i and a sequence of distinct nodes t_i in a compact interval T, we prove the divergence and the unbounded divergence on superdense sets in the space C(T) of the simple quadrature formulas ∝_Tx(t)du(t) = Q_n(x) + R_n(x) and ∝_Tw(t)x(t)dt = Q_n(x) + R_n(x), where Q_n(x)=∑_i=1^m_n c_ix(t_i), ε C(T).The divergence (not certainly unbounded) for at most one continuous function of the first simple quadrature formula, with m_n = n and u(t) = t, was established by P. J. Davis in 1953.     

The Vector QD Algorithm for Smooth Functions (f, f′)

We deal with the functionz(f(z), f′(z)) wheref(z)=∑_i0 a_izⁱ, (a_i ) with lim_i→∞ a_i+1×a_i−1/(a_i)²=q. We investigate the convergence of the vector QD algorithm. We give the asymptotic behaviour of the generalized Hankel determinants. A convergence result on the vector orthogonal polynomials is proved.     

Weighted simultaneous Chebyshev approximation

In this paper we discuss the problem of weighted simultaneous Chebyshev approximation to functions f₁,…f_m ε C(X) (1 m ∞), i.e., we wish to minimize the expression {∑^m_{j = 1} λ_j¦f_j − q¦^p}^1/p∞, where λ_j > 0, ∑^m_{j = 1} λ_j = 1, p 1. For this problem we establish the main theorems of the Chebyshev theory, which include the theorems of existence, alternation, de La Vallée Poussin, uniqueness, strong uniqueness, as well as that of continuity of the best approximation operator, etc.     

Permanence and global stability in a Lotka-Volterra predator-prey system with delays

Consider the permanence and global asymptotic stability of models governed by the following Lotka-Volterra-type system:

, with initial conditions

x_i(t) = φ_i(t) ≥ o, t ≤ t₀, and φ_i(t₀) > 0. 1 ≤ i ≤n

. We define x₀(t) = x_n+1(t)≡0 and suppose that φ_i(t), 1 ≤ i ≤ n, are bounded continuous functions on [t₀, + ∞) and γ_i, α_i, c_i > 0,γ_i,j ≥ 0, for all relevant i,j.Extending a technique of Saito, Hara and Ma[1] for n = 2 to the above system for n ≥ 2, we offer sufficient conditions for permanence and global asymptotic stability of the solutions which improve the well-known result of Gopalsamy.     

The Weak Convergence for Functions of Negatively Associated Random Variables

Let {X_n, n1} be a sequence of stationary negatively associated random variables, S_j(l)=∑^l_i=1 X_j+i, S_n=∑ⁿ_i=1 X_i. Suppose that f(x) is a real function. Under some suitable conditions, the central limit theorem and the weak convergence for sums are investigated. Applications to limiting distributions of estimators of Var S_n are also discussed.     

The approximate identity kernels of product type for the Walsh system

At present there are only a few approximate identity kernels for the Walsh system, for example, the p^N-truncated Dirichlet kernel D_{p^N − 1}(t) = ∑_{j = 0}^{pN − 1} w_j(t) [6]; the Abel-Poisson kernel λ_γ(t) = ∑_{k = 0}^∞ γ^kw_k(t) [3], and so on. In [6], Zheng has introduced a new kind of approximate identity kernels for the Walsh system—the kernels of product type. In the present paper we discuss the approximation properties of such product type kernels. Estimates of their moments as well as a direct approximation theorem are obtained. Then, to establish an inverse approximation theorem, we need the p-adic derivative of product type kernels and we estimate this derivative in L¹-norm.     

Stability conditions for systems of linear nonautonomous delay differential equations

Systems of linear nonautonomous delay differential equations are considered which are of the form y′_i(t) = ∑_{k = 1}ⁿ ∝₀^T b_ik(t, s) y_k(t − s) dη_ik(s) − c_i(t) y_i(t), where I = 1,…, n. Sufficient conditions are derived for both the asymptotic stability and the instability of the zero solution. The main result is found by a monotone technique using elementary methods only. Moreover, additional criteria are obtained by using the method of Lyapunov functionals.     

L∞-upper bound of L2-projections onto splines at a geometric mesh

For an integer k 1 and a geometric mesh (qⁱ)_−∞^∞ with q ε (0, ∞), let M_i,k(x): = k[q^{i + k}](· − x)₊^{k − 1}, N_i,k(x): = (q^{i + k} − qⁱM_i,k(x)/k, and let A_k(q) be the Gram matrix (∝M_i,kN_j,k)_i,jεz. It is known that A_k(q)⁻¹_∞ is bounded independently of q. In this paper it is shown that A_k(q)⁻¹_∞ is strictly decreasing for q in [1, ∞). In particular, the sharp upper bound and lower bound for A_k (q)⁻¹ are obtained: for all q ε (0, ∞).     

Estimates of Freud-Christoffel functions for some weights with the whole real line as support

Upper and lower bounds for generalized Christoffel functions, called Freud-Christoffel functions, are obtained. These have the form λ_n,p(W,j,x) = infPW_Lp(R)/|P^(j)(X)| where the infimum is taken over all polynomials P(x) of degree at most n − 1. The upper and lower bounds for λ_n,p(W,j,x) are obtained for all 0 < p ∞ and J = 0, 1, 2, 3,… for weights W(x) = exp(−Q(x)), where, among other things, Q(x) is bounded in [− A, A], and Q″ is continuous in β(−A, A) for some A > 0. For p = ∞, the lower bounds give a simple proof of local and global Markov-Bernstein inequalities. For p = 2, the results remove some restrictions on Q in Freud's work. The weights considered include W(x) = exp(− ¦x¦^α/2), α > 0, and W(x) = exp(− exp(¦x¦)), > 0.     

On numerical improvement of Gauss–Legendre quadrature rules

Among all integration rules with n points, it is well-known that n-point Gauss–Legendre quadrature rule∫₋₁¹f(x) dx∑_i=1ⁿw_if(x_i)has the highest possible precision degree and is analytically exact for polynomials of degree at most 2n−1, where nodes x_i are zeros of Legendre polynomial P_n(x), and w_i's are corresponding weights.In this paper we are going to estimate numerical values of nodes x_i and weights w_i so that the absolute error of introduced quadrature rule is less than a preassigned tolerance ε₀, say ε₀=10⁻⁸, for monomial functionsf(x)=x^j, j=0,1,…,2n+1.(Two monomials more than precision degree of Gauss–Legendre quadrature rules.) We also consider some conditions under which the new rules act, numerically, more accurate than the corresponding Gauss–Legendre rules. Some examples are given to show the numerical superiority of presented rules.     

Rate of Convergence of Positive Series

We investigate the rate of convergence of series of the form

The generalized variance of a stationary autoregressive process

For a stationary autoregressive process of order p and disturbance variance σ² it is shown that the determinant of the covariance of T (≥p) consecutive random variables of the process is (σ²)^T Π_i,j=1^p (1 − w_iw_j)⁻¹, where w₁, …, w_p are the roots of the associated polynomial equation.     

Markov-Type Inequalities for Products of Müntz Polynomials

Let Λ(λ_j)^∞_j=0 be a sequence of distinct real numbers. The span of {x^λ₀, x^λ₁, …, x^λ_n} over is denoted by M_n(Λ)span{x^λ₀, x^λ₁, …, x^λ_n}. Elements of M_n(Λ) are called Müntz polynomials. The principal result of this paper is the following Markov-type inequality for products of Müntz polynomials. T 2.1. LetΛ(λ_j)^∞_j=0andΓ(γ_j)^∞_j=0be increasing sequences of nonnegative real numbers. Let

Full-size image

Then

Full-size image

18(n+m+1)(λ_n+γ_m).In particular ,

Full-size image

Under some necessary extra assumptions, an analog of the above Markov-type inequality is extended to the cases when the factor x is dropped, and when the interval [0, 1] is replaced by [a, b](0, ∞).     

Approaching an extinction point in one-dimensional semilinear heat equations with strong absorption

This paper deals with the Cauchy problem u_t − u_xx + u^p = 0; − ∞ < x < + ∞, t>0, u(x, 0) = u₀(x); − ∞ < x < + ∞, where 0 < p < 1 and u₀(x) is continuous, nonnegative, and bounded. In this case, solutions are known to vanish in a finite time T, and interfaces separating the regions where u(x, t) > 0 and u(x, t) = 0 appear when t is close to T. We describe here all possible asymptotic behaviours of solutions and interfaces near an extinction point as the extinction time is approached. We also give conditions under which some of these behaviours actually occur.     

Asymptotic behaviour of nonlinear parabolic equations with critical exponents. A dynamical systems approach

We investigate the large-time behaviour of solutions to the nonlinear heat-conduction equation with absorption u_t = Δ(u^{σ + 1}) − u^β in Q = R^N × (0, ∞) (E) with N 1, σ > 0 and critical absorption exponent β = σ + 1 + 2/N; the initial function u(x, 0) = 0 is assumed to be integrable, nonnegative and compactly supported. We prove that u converges as t → ∞ to a unique self-similar function which is a contracted version of one of the asymptotic profiles of the nonabsorptive problem u_t = Δ(u^{σ + 1}), the same for any initial data. The cornerstone of the proof is a result about ω-limits of (infinite-dimensional) asymptotical dynamical systems. Combining this result with an asymptotic evaluation of the mass function as well as typical PDE estimates gives the behaviour of (E) for large times.Similar unusual asymptotic behaviour is obtained for the equation u_t = div(¦Du¦^σ Du) − u^β with same conditions on σ and u(x, 0) and critical value for β = σ + 1 + (σ + 2)/N.     

Rates for approximation of unbounded functions by positive linear operators

Let g_a(t) and g_b(t) be two positive, strictly convex and continuously differentiable functions on an interval (a, b) (−∞ a < b ∞), and let {L_n} be a sequence of linear positive operators, each with domain containing 1, t, g_a(t), and g_b(t). If L_n(ƒ; x) converges to ƒ(x) uniformly on a compact subset of (a, b) for the test functions ƒ(t) = 1, t, g_a(t), g_b(t), then so does every ƒ ε C(a, b) satisfying ƒ(t) = O(g_a(t)) (t → a⁺) and ƒ(t) = O(g_b(t)) (t → b⁻). We estimate the convergence rate of L_nƒ in terms of the rates for the test functions and the moduli of continuity of ƒ and ƒ′.     

On the Rate of Almost Everywhere Convergence of Certain Classical Integral Means

The main purpose of this article is to establish nearly optimal results concerning the rate of almost everywhere convergence of the Gauss–Weierstrass, Abel–Poisson, and Bochner–Riesz means of the one-dimensional Fourier integral. A typical result for these means is the following: If the function f belongs to the Besov spaceB^s_{p, p}, 1<p<∞, 0<s<1, thenT_mtf (x)−f(x)=o_x(t^s) a.e. ast→0+.     

Strong and weak convergence theorems for asymptotically nonexpansive mappings

Suppose K is a nonempty closed convex nonexpansive retract of a real uniformly convex Banach space E with P as a nonexpansive retraction. Let T :K→E be an asymptotically nonexpansive nonself-map with sequence {k_n}_n1[1,∞), limk_n=1, F(T):={xK: Tx=x}≠. Suppose {x_n}_n1 is generated iteratively by

where {α_n}_n1(0,1) is such that ε<1−α_n<1−ε for some ε>0. It is proved that (I−T) is demiclosed at 0. Moreover, if ∑_n1(k_n²−1)<∞ and T is completely continuous, strong convergence of {x_n} to some x^*F(T) is proved. If T is not assumed to be completely continuous but E also has a Fréchet differentiable norm, then weak convergence of {x_n} to some x^*F(T) is obtained.     

On a quotient norm and the Sz.-Nagy-Foiaş lifting theorem

It is shown that the infimum over all choices of the operator X of the norm of the operator matrix [ ], whose entries are operators on Hilbert spaces, is the minimum of the norms of the first row and of the first column, and an explicit formula for a minimizing X is given in terms of A, B, C, and their adjoints. A generalization of a fundamental theorem on Hankel operators is seen to follow immediately from this result. The formula is then used to prove a generalization of the Sz. Nagy-Foiaş lifting theorem which in turn yields interpolation theorems for analytic functions from the unit disc to a von Neumann algebra. The generalized lifting theorem also implies a generalization of the theorem of Ando asserting the existence of commuting unitary dilations for a pair of commuting contractions and a generalized von Neumann inequality ∑ a_jkS^jT^k sup{ ∑ A_jkz^jw^k ¦ ¦ z ¦ = ¦ w ¦ = 1} for operator polynomials ∑ A_jkS^jT^k in two commuting contractions S, T with operator coefficients A_jk which commute with S, T and their adjoints.