Iterative approximation of solutions to nonlinear equations involving m-accretive operators in Banach spaces

Let E be an arbitrary real Banach space and T :E→E be a Lipschitz continuous accretive operator. Under the lack of the assumption lim_n→∞α_n=lim_n→∞β_n=0, we prove that the Ishikawa iterative sequence with errors converges strongly to the unique solution of the equation x+Tx=f. Moreover, this result provides a convergence rate estimate for some special cases of such a sequence. Utilizing this result, we imply that if T :E→E is a Lipschitz continuous strongly accretive operator then the Ishikawa iterative sequence with errors converges strongly to the unique solution of the equation Tx=f. Our results improve, generalize and unify the ones of Liu, Chidume and Osilike, and to some extent, of Reich.     

An extension of the Erdős–Ginzburg–Ziv Theorem to hypergraphs

An n-set partition of a sequence S is a collection of n nonempty subsequences of S, pairwise disjoint as sequences, such that every term of S belongs to exactly one of the subsequences, and the terms in each subsequence are all distinct with the result that they can be considered as sets. For a sequence S, subsequence S^′, and set T, |T∩S| denotes the number of terms x of S with xT, and |S| denotes the length of S, and SS^′ denotes the subsequence of S obtained by deleting all terms in S^′. We first prove the following two additive number theory results.(1) Let S be a finite sequence of elements from an abelian group G. If S has an n-set partition, A=A₁,…,A_n, such that

then there exists a subsequence S^′ of S, with length |S^′|≤max{|S|−n+1,2n}, and with an n-set partition, , such that . Furthermore, if ||A_i|−|A_j||≤1 for all i and j, or if |A_i|≥3 for all i, then .(2) Let S be a sequence of elements from a finite abelian group G of order m, and suppose there exist a,bG such that . If |S|≥2m−1, then there exists an m-term zero-sum subsequence S^′ of S with or .Let be a connected, finite m-uniform hypergraph, and be the least integer n such that for every 2-coloring (coloring with the elements of the cyclic group ) of the vertices of the complete m-uniform hypergraph , there exists a subhypergraph isomorphic to such that every edge in is monochromatic (such that for every edge e in the sum of the colors on e is zero). As a corollary to the above theorems, we show that if every subhypergraph of contains an edge with at least half of its vertices monovalent in , or if consists of two intersecting edges, then . This extends the Erdős–Ginzburg–Ziv Theorem, which is the case when is a single edge.     

q-Bernstein polynomials and their iterates

Let B_n( f,q;x), n=1,2,… be q-Bernstein polynomials of a function f : [0,1]→C. The polynomials B_n( f,1;x) are classical Bernstein polynomials. For q≠1 the properties of q-Bernstein polynomials differ essentially from those in the classical case. This paper deals with approximating properties of q-Bernstein polynomials in the case q>1 with respect to both n and q. Some estimates on the rate of convergence are given. In particular, it is proved that for a function f analytic in {z: |z|<q+} the rate of convergence of {B_n( f,q;x)} to f(x) in the norm of C[0,1] has the order q⁻ⁿ (versus 1/n for the classical Bernstein polynomials). Also iterates of q-Bernstein polynomials {B_n^j_n( f,q;x)}, where both n→∞ and j_n→∞, are studied. It is shown that for q(0,1) the asymptotic behavior of such iterates is quite different from the classical case. In particular, the limit does not depend on the rate of j_n→∞.     

Rates of Best Rational Approximation of Analytic Functions

Let E be a compact set in the extended complex plane C and let f be holomorphic on E. Denote by ρ_n the distance from f to the class of all rational functions of order at most n, measured with respect to the uniform norm on E. We obtain results characterizing the relationship between estimates of lim inf_n→∞ ρ^1/n_n and lim sup_n→∞ ρ^1/n_n.     

Uniform estimates for polynomial approximation in domains with corners

Let be a domain with a Jordan boundary ∂G, consisting of l smooth curves Γ_j, such that {z_j}Γ_j-1∩Γ_j≠, j=1,…,l, where Γ₀Γ_l. Denote by α_jπ, 0<α_j2, the angles at z_j's between the curves Γ_j-1 and Γ_j, exterior with respect to G. Let Φ be a conformal mapping of the exterior of onto the exterior of the unit disk, normed by Φ^′(∞)>0. We assume that there is a neighborhood U of , such that , where

z≠z_j if α_j1. Set g_Gsup{|g(z)|:zG}. Then we prove Theorem. Let and 0βr. If a function f is analytic in G and f^(r)β_G<+∞, then for each nlr there is an algebraic polynomial P_n of degree <n, such that

     

On the approximate behavior of the posterior distribution for an extreme multivariate observation

The behavior of the posterior for a large observation is considered. Two basic situations are discussed; location vectors and natural parameters.Let X = (X₁, X₂, …, X_n) be an observation from a multivariate exponential distribution with that natural parameter Θ = (Θ₁, Θ₂, …, Θ_n). Let θ_x^* be the posterior mode. Sufficient conditions are presented for the distribution of Θ − θ_x^* given X = x to converge to a multivariate normal with mean vector 0 as |x| tends to infinity. These same conditions imply that E(Θ | X = x) − θ_x^* converges to the zero vector as |x| tends to infinity.The posterior for an observation X = (X₁, X₂, …, X_n is considered for a location vector Θ = (Θ₁, Θ₂, …, Θ_n) as x gets large along a path, γ, in Rⁿ. Sufficient conditions are given for the distribution of γ(t) − Θ given X = γ(t) to converge in law as t → ∞. Slightly stronger conditions ensure that γ(t) − E(Θ | X = γ(t)) converges to the mean of the limiting distribution.These basic results about the posterior mean are extended to cover other estimators. Loss functions which are convex functions of absolute error are considered. Let δ be a Bayes estimator for a loss function of this type. Generally, if the distribution of Θ − E(Θ | X = γ(t)) given X = γ(t) converges in law to a symmetric distribution as t → ∞, it is shown that δ(γ(t)) − E(Θ | X = γ(t)) → 0 as t → ∞.     

On the Maximal Multiplicity of Parts in a Random Integer Partition

We study the asymptotic behavior of the maximal multiplicity μ_n = μ_n(λ) of the parts in a partition λ of the positive integer n, assuming that λ is chosen uniformly at random from the set of all such partitions. We prove that πμ_n/(6n)^1/2 converges weakly to max _jX_j/j as n→∞, where X₁, X₂, … are independent and exponentially distributed random variables with common mean equal to 1.2000 Mathematics Subject Classification: Primary—05A17; Secondary—11P82, 60C05, 60F05     

On a Conjecture Concerning Strong Unicity Constants

Let fC[−1, 1] be real-valued. We consider the sequence of strong unicity constants (γ_n(f))_n induced by the polynomials of best uniform approximation of f. It is proved that lim inf_n→∞ γ_n(f)=0, whenever f is not a polynomial.     

Transcendence measures and algebraic growth of entire functions

In this paper we obtain estimates for certain transcendence measures of an entire function f. Using these estimates, we prove Bernstein, doubling and Markov inequalities for a polynomial P(z,w) in ℂ² along the graph of f. These inequalities provide, in turn, estimates for the number of zeros of the function P(z,f(z)) in the disk of radius r, in terms of the degree of P and of r. Our estimates hold for arbitrary entire functions f of finite order, and for a subsequence {n _j } of degrees of polynomials. But for special classes of functions, including the Riemann ζ-function, they hold for all degrees and are asymptotically best possible. From this theory we derive lower estimates for a certain algebraic measure of a set of values f(E), in terms of the size of the set E.     

A note on the largest eigenvalue of a large dimensional sample covariance matrix

Let {v_ij; i, J = 1, 2, …} be a family of i.i.d. random variables with E(v₁₁⁴) = ∞. For positive integers p, n with p = p(n) and p/n → y > 0 as n → ∞, let M_n = (1/n) V_n V_n^T , where V_n = (v_ij)_{1 ≤ i ≤ p, 1 ≤ j ≤ n}, and let λ_max(n) denote the largest eigenvalue of M_n. It is shown that a.s. This result verifies the boundedness of E(v₁₁⁴) to be the weakest condition known to assure the almost sure convergence of λ_max(n) for a class of sample covariance matrices.     

On nonautonomous linear systems of differential and difference equations with -symmetric coefficient matrices

Let denote the set of continuous n×n matrices on an interval . We say that is a nontrivial k-involution if where ζ=e^-2πi/k, d₀+d₁++d_k-1=n, and with . We say that is R-symmetric if R(t)A(t)R^-1(t)=A(t), , and we show that if A is R-symmetric then solving x^′=A(t)x or x^′=A(t)x+f(t) reduces to solving k independent d_ℓ×d_ℓ systems, 0ℓk-1. We consider the asymptotic behavior of the solutions in the case where . Finally, we sketch analogous results for linear systems of difference equations.     

Convergence of greedy approximation for the trigonometric system

Summary We study the following nonlinear method of approximation by trigonometric polynomials in this paper. For a periodic function f we take as an approximant a trigonometric polynomial of the form G_m(f ) := ∑_kЄΛ f^(k) e ^{(i k,x)}, where ΛˆZ^d is a set of cardinality m containing the indices of the m biggest (in absolute value) Fourier coefficients f^ (k) of function f . Note that G_m(f ) gives the best m-term approximant in the L₂-norm and, therefore, for each f ЄL₂, ║f-G_m(f )║₂→0 as m →∞. It is known from previous results that in the case of p ≠2 the condition f ЄL_p does not guarantee the convergence ║f-G_m(f )║_p→0 as m →∞.. We study the following question. What conditions (in addition to f ЄL_p) provide the convergence ║f-G_m(f )║_p→0 as m →∞? In our previous paper [10] in the case 2< p ≤∞ we have found necessary and sufficient conditions on a decreasing sequence {A_n}_n=1^∞ to guarantee the L_p-convergence of {G_m(f )} for all f ЄL_p , satisfying a_n (f ) ≤A_n , where {a_n (f )} is a decreasing rearrangement of absolute values of the Fourier coefficients of f. In this paper we are looking for necessary and sufficient conditions on a sequence {M (m)} such that the conditions f ЄL_p and ║G_M(m)(f ) - G_m(f )║_p →0 as m →∞ imply ║f - G_m(f )║_p →0 as m →∞. We have found these conditions in the case when p is an even number or p = ∞.     

Stochastic comparisons of order statistics from heterogeneous populations, with applications in reliability

The basic result of the paper states: Let F₁, …, F_n, F₁^′,…, F_n^′ have proportional hazard functions with λ₁ ,…, λ_n , λ₁^′ ,…, λ_n^′ as the constants of proportionality. Let X₍₁₎ ≤ … ≤ X_(n) (X₍₁₎^′ ≤ … ≤ X_(n)^′) be the order statistics in a sample of size n from the heterogeneous populations {F₁ ,…, F_n}({F₁^′ ,…, F_n^′}). Then (λ₁ ,…, λ_n) majorizes (λ₁^′ ,…, λ_n^′) implies that (X₍₁₎ ,…, X_(n)) is stochastically larger than (X₍₁₎^′ ,…, X_(n)^′). Earlier results stochastically comparing individual order statistics are shown to be special cases. Applications of the main result are made in the study of the robustness of standard estimates of the failure rate of the exponential distribution, when observations actually come from a set of heterogeneous exponential distributions. Further applications are made to the comparisons of linear combinations of Weibull random variables and of binomial random variables.     

Centres of Convex Sets inLMetrics

It is shown that for each convex bodyARⁿthere exists a naturally defined family _AC(Sⁿ⁻¹) such that for everyg _A, and every convex functionf: R→Rthe mappingy∫_Sⁿ⁻¹ f(g(x)−y, x) dσ(x) has a minimizer which belongs toA. As an application, approximation of convex bodies by balls with respect toL^pmetrics is discussed.     

Borel extractions of converging sequences in compact sets of Borel functions

It is well known by a classical result of Bourgain–Fremlin–Talagrand that if K is a pointwise compact set of Borel functions on a Polish space then given any cluster point f of a sequence (f_n)_nω in K one can extract a subsequence (f_nk)_kω converging to f. In the present work we prove that this extraction can be achieved in a “Borel way.” This will prove in particular that the notion of analytic subspace of a separable Rosenthal compacta is absolute and does not depend on the particular choice of a dense sequence.     

Discrete Approximation of Unbounded Operators and Approximation of their Spectra

Let E be a Banach space over and let the densely defined closed linear operator A: (A)E→E be discretely approximated by the sequence ((A_n, (A_n)))_n of operators A_n where each A_n is densely defined in the Banach space F_n. Let σ_a(A) be the approximate point spectrum of A and let σ(A_n) denote the -pseudospectrum of A_n. Generalizing our own result, we show that σ_a(A)lim inf σ(A_n)=_n ∩_kn σ(A_k) holds for every >0. We deduce that then for every compact set K lim_n dist(σ_a(A)∩K, σ_a(A_n))=0 provided there exists M>0 such that (λ−A_n)⁻¹M dist(λ, σ(A_n))⁻¹ holds for every n and every λ in the resolvent set ρ(A_n) of A_n. We finally treat the problem under which conditions σ_a(A) can be approximated from below. More precisely we investigate the problem: Under which assumptions does ∩_>0 ∩_{n kn} σ_, a(A_k)σ_a(A) hold where σ_, a(A) denotes the -approximate pseudospectrum?     

On the L convergence of Lagrange interpolating entire functions of exponential type

Let f: be a continuous, 2π-periodic function and for each n ε let t_n(f; ·) denote the trigonometric polynomial of degree n interpolating f in the points 2kπ/(2n + 1) (k = 0, ±1, …, ±n). It was shown by J. Marcinkiewicz that lim_{n → ∞} ∝₀^2π¦f(θ) − t_n(f θ)¦^p dθ = 0 for every p > 0. We consider Lagrange interpolation of non-periodic functions by entire functions of exponential type τ > 0 in the points kπ/τ (k = 0, ± 1, ± 2, …) and obtain a result analogous to that of Marcinkiewicz.     

A functional model for the tensor product of level 1 highest and level −1 lowest modules for the quantum affine algebra

Let V(Λ_i) (resp., V(−Λ_j)) be a fundamental integrable highest (resp., lowest) weight module of . The tensor product V(Λ_i)V(−Λ_j) is filtered by submodules , n≥0, n≡i−j mod 2, where v_iV(Λ_i) is the highest vector and is an extremal vector. We show that F_n/F_n+2 is isomorphic to the level 0 extremal weight module V(n(Λ₁−Λ₀)). Using this we give a functional realization of the completion of V(Λ_i)V(−Λ_j) by the filtration (F_n)_n≥0. The subspace of V(Λ_i)V(−Λ_j) of -weight m is mapped to a certain space of sequences (P_n,l)_{n≥0,n≡i−jmod2,n−2l=m}, whose members P_n,l=P_n,l(X₁,…,X_lz₁,…,z_n) are symmetric polynomials in X_a and symmetric Laurent polynomials in z_k, with additional constraints. When the parameter q is specialized to , this construction settles a conjecture which arose in the study of form factors in integrable field theory.     

On almost sure convergence of Cesaro averages of subsequences of vector-valued functions

A remarkable theorem proved by Komlòs [4] states that if {f_n} is a bounded sequence in L¹(R), then there exists a subsequence {f_nk} and f L¹(R) such that f_nk (as well as any further subsequence) converges Cesaro to f almost everywhere. A similar theorem due to Révész [6] states that if {f_n} is a bounded sequence in L²(R), then there is a subsequence {f_nk} and f L²(R) such that Σ_k=1^∞ a_k(f_nk − f) converges a.e. whenever Σ_k=1^∞ | a_k |² < ∞. In this paper, we generalize these two theorems to functions with values in a Hilbert space (Theorems 3.1 and 3.3).     

On the sequence of powers of a stochastic matrix with large exponent

We consider the class of primitive stochastic n×n matrices A, whose exponent is at least (n²−2n+2)/2+2. It is known that for such an A, the associated directed graph has cycles of just two different lengths, say k and j with k>j, and that there is an α between 0 and 1 such that the characteristic polynomial of A is λⁿ−αλ^n−j−(1−α)λ^n−k. In this paper, we prove that for any mn, if α1/2, then A^m+k−A^m_∞A^m−1w^T_∞, where 1 is the all-ones vector and w^T is the left-Perron vector for A, normalized so that w^T1=1. We also prove that if jn/2, n31 and , then A^m+j−A^m_∞A^m−1w^T_∞ for all sufficiently large m. Both of these results lead to lower bounds on the rate of convergence of the sequence A^m.