A counterexample in copositive approximation

The present paper gives a converse result by showing that there exists a functionf ∈C _[−1,1], which satisfies that sgn(x)f(x) ≥ 0 forx ∈ [−1, 1], such that {fx75-1} whereE _n ⁽⁰⁾ (f, 1) is the best approximation of degreen tof by polynomials which are copositive with it, that is, polynomialsP withP(x(f(x) ≥ 0 for allx ∈ [−1, 1],E _n(f) is the ordinary best polynomial approximation off of degreen.     

On the convergence of averaging Hermite interpolators

We investigate two sequences of polynomial operators, H_{2n − 2}(A₁,f; x) and H_{2n − 3}(A₂,f; x), of degrees 2n − 2 and 2n − 3, respectively, defined by interpolatory conditions similar to those of the classical Hermite-Féjer interpolators H_{2n − 1}(f, x). If H_{2n − 2}(A₁,f; x) and H_{2n − 3}(A₂,f; x) are based on the zeros of the jacobi polynomials P_n^(α,β)(x), their convergence behaviour is similar to that of H_{2n − 1}(f;, x). If they are based on the zeros of (1 − x²)T_{n − 2}(x), their convergence behaviour is better, in some sense, than that of H_{2n − 1}(f, x).     

Convergence of Lagrange Interpolation Polynomials for Piecewise Smooth Functions

The present paper first establishes a decomposition result for f(x)∈ C ^r C ^r+1. By using this decomposition we thus can obtain an estimate of ∣f(x) - L _n (f,x)∣ which reflects the influence of the position of the x's and ω(f ^(r+1),δ)_j, j = 0,1,...,s, on the error of approximation. This revised version was published online in June 2006 with corrections to the Cover Date.     

On the almost monotone convergence of sequences of continuous functions

A sequence (f _n ) _n of functions f _n : X → ℝ almost decreases (increases) to a function f: X → ℝ if it pointwise converges to f and for each point x ∈ X there is a positive integer n(x) such that f _n+1(x) ≤ f _n (x) (f _n+1(x) ≥ f _n (x)) for n ≥ n(x). In this article I investigate this convergence in some families of continuous functions.     

On Generalized Hermite–Fejér Interpolation of Lagrange Type on the Chebyshev Nodes

For fC[−1, 1], let H_m, n(f, x) denote the (0, 1, …,anbsp;m) Hermite–Fejér (HF) interpolation polynomial of f based on the Chebyshev nodes. That is, H_m, n(f, x) is the polynomial of least degree which interpolates f(x) and has its first m derivatives vanish at each of the zeros of the nth Chebyshev polynomial of the first kind. In this paper a precise pointwise estimate for the approximation error |H_2m, n(f, x)−f(x)| is developed, and an equiconvergence result for Lagrange and (0, 1, …, 2m) HF interpolation on the Chebyshev nodes is obtained. This equiconvergence result is then used to show that a rational interpolatory process, obtained by combining the divergent Lagrange and (0, 1, …, 2m) HF interpolation methods on the Chebyshev nodes, is convergent for all fC[−1, 1].     

Multilinear polynomials and cocentralizing conditions in prime rings

Let R be a noncommutative prime ring of characteristic different from 2, let Z(R) be its center, let U be the Utumi quotient ring of R, let C be the extended centroid of R, and let f(x ₁,..., x _n ) be a noncentral multilinear polynomial over C in n noncommuting variables. Denote by f(R) the set of all evaluations of f(x ₁, …, xn) on R. If F and G are generalized derivations of R such that [[F(x), x], [G(y), y]] ∈ Z(R) for any x, y ∈ f(R), then one of the following holds:

Non-isogenous superelliptic Jacobians

Let ℓ be an odd prime. Let K be a field of characteristic zero with algebraic closure K_a. Let n, m ≥ 4 be integers that are not divisible by ℓ. Let f(x), h(x) ∈ K[x] be irreducible separable polynomials of degree n and m respectively. Suppose that the Galois group Gal(f) of f acts doubly transitively on the set of roots of f and that Gal(h) acts doubly transitively on as well. Let J(C_f,ℓ) and J(C_h,ℓ) be the Jacobians of the superelliptic curves C_f,ℓ:y^ℓ=f(x) and C_h,ℓ:y^ℓ=h(x) respectively. We prove that J(C_f,ℓ) and J(C_h,ℓ) are not isogenous over K_a if the splitting fields of f and h are linearly disjoint over K and K contains a primitive ℓth root of unity.     

An Engel condition with generalized derivations on multilinear polynomials

Let R be a prime ring with extended centroid C, g a nonzero generalized derivation of R, f (x ₁,..., x _n) a multilinear polynomial over C, I a nonzero right ideal of R. If [g(f(r ₁,..., r _n)), f(r ₁,..., r _n)] = 0, for all r ₁, ..., r _n ∈ I, then either g(x) = ax, with (a − γ)I = 0 and a suitable γ ∈ C or there exists an idempotent element e ∈ soc(RC) such that IC = eRC and one of the following holds:

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

Legendre polynomial kernel estimation of a density function with censored observations and an application to clinical trials

Let f(x), x ∈ ?^M, M ≥ 1, be a density function on ?^M, and X₁, …., X_n a sample of independent random vectors with this common density. For a rectangle B in ?^M, suppose that the X's are censored outside B, that is, the value X_k is observed only if X_k ∈ B. The restriction of f(x) to x ∈ B is clearly estimable by established methods on the basis of the censored observations. The purpose of this paper is to show how to extrapolate a particular estimator, based on the censored sample, from the rectangle B to a specified rectangle C containing B. The results are stated explicitly for M = 1, 2, and are directly extendible to M ≥ 3. For M = 2, the extrapolation from the rectangle B to the rectangle C is extended to the case where B and C are triangles. This is done by means of an elementary mapping of the positive quarter‐plane onto the strip {(u, v): 0 ≤ u ≤ 1, v > 0}. This particular extrapolation is applied to the estimation of the survival distribution based on censored observations in clinical trials. It represents a generalization of a method proposed in 2001 by the author [2]. The extrapolator has the following form: For m ≥ 1 and n ≥ 1, let K_{m, n}(x) be the classical kernel estimator of f(x), x ∈ B, based on the orthonormal Legendre polynomial kernel of degree m and a sample of n observed vectors censored outside B. The main result, stated in the cases M = 1, 2, is an explicit bound for E|K_{m, n}(x) ? f(x)| for x ∈ C, which represents the expected absolute error of extrapolation to C. It is shown that the extrapolator is a consistent estimator of f(x), x ∈ C, if f is sufficiently smooth and if m and n both tend to ∞ in a way that n increases sufficiently rapidly relative to m. © 2006 Wiley Periodicals, Inc.     

An algorithm of MCMC method for solving F(X) =0

An algorithm of continuous stage-space MCMC method for solving algebra equation f(x)=0 is given. It is available for the case that the sign of f(x) changes frequently or the derivative f′(x) does not exist in the neighborhood of the root, while the Newton method is hard to work. Let n be the number of random variables created by computer in our algorithm. Then after m=O(n) transactions from the initial value x ₀,x* can be got such that |f(x*)|<e ^−cm |f(x ₀)| by choosing suitable positive constant c. An illustration is also given with the discussion of convergence by adjusting the parameters in the algorithm. Supported by the National Natural Science Foundation of China (70171008).     

Generalized derivations with Engel condition on multilinear polynomials

Let R be a prime ring with extended centroid C, δ a nonzero generalized derivation of R, f(x ₁, ..., x _n ) a nonzero multilinear polynomial over C, I a nonzero right ideal of R and k ≥ a fixed integer. If [δ(f(r ₁, ..., r _n )), f(r ₁, ..., r _n )] _k = 0, for all r ₁, ..., r _n ∈ I, then either δ(x) = ax, with (a-γ)I = 0 and a suitable γ ∈ C or there exists an idempotent element e ∈ soc(RC) such that IC = eRC and one of the following holds (1) if char(R) = 0 then f(x ₁, ..., x _n ) is central valued in eRCe (2) if char(R) = p > 0 then is central valued in eRCe, for a suitable s ≥ 0, unless when char(R) = 2 and eRCe satisfies the standard identity s ₄ (3) δ(x) = ax−xb, where (a+b+α)e = 0, for α ∈ C, and f(x ₁, ..., x _n )² is central valued in eRCe.     

When isf(x1, x2, ..., xn) =u1(x1) +u2(x2) + ... +un(xn)?

We discuss subsetsS of ℝⁿ such that every real valued functionf onS is of the formf(x₁, x₂, ..., x_n) =u ₁(x₁) +u ₂(x₂) +...+u _n(x_n), and the related concepts and situations in analysis.     

Endomorphisms of superelliptic jacobians

Let K be a field of characteristic zero, n ≥ 5 an integer, f(x) an irreducible polynomial over K of degree n, whose Galois group contains a doubly transitive simple non-abelian group. Let p be an odd prime, the ring of integers in the pth cyclotomic field, C _{f, p} : y ^p  =  f(x) the corresponding superelliptic curve and J(C _{f, p} ) its jacobian. Assuming that either n  =  p + 1 or p does not divide n(n  −  1), we prove that the ring of all endomorphisms of J(C _{f, p} ) coincides with . The same is true if n  =  4, the Galois group of f(x) is the full symmetric group S ₄ and K contains a primitive pth root of unity. An erratum to this article can be found at     

Korovkin-type theorem and application

Let (L_n) be a sequence of positive linear operators on C[0,1], satisfying that (L_n(e_i)) converge in C[0,1] (not necessarily to e_i) for i=0,1,2, where e_i(x)=xⁱ. We prove that the conditions that (L_n) is monotonicity-preserving, convexity-preserving and variation diminishing do not suffice to insure the convergence of (L_n(f)) for all fC[0,1]. We obtain the Korovkin-type theorem and give quantitative results for the approximation properties of the q-Bernstein operators B_n,q as an application.     

Quadratic Central Differential Identities on a Multilinear Polynomial

Let K be a commutative ring with unity, R a prime K-algebra, Z(R) the center of R, d and δ nonzero derivations of R, and f(x ₁,…, x _n ) a multilinear polynomial over K. If [d(f(r ₁,…, r _n )), δ (f(r ₁,…, r _n ))] ? Z(R), for all r ₁,…, r _n  ? R, then either f(x ₁,…, x _n ) is central valued on R or {d, δ} are linearly dependent over C, the extended centroid of R, except when char(R) = 2 and dim _C RC = 4.     

An Annihilator Condition with Generalized Derivations on Multilinear Polynomials

Let R be a non-commutative prime ring of characteristic different from 2, U its right Utumi quotient ring, C its extended centroid, F a generalized derivation on R, and f(x ₁,…, x _n ) a noncentral multilinear polynomial over C. If there exists a ∈ R such that, for all r ₁,…, r _n  ∈ R, a[F ²(f(r ₁,…, r _n )), f(r ₁,…, r _n )] = 0, then one of the following statements hold: 1. a = 0;

2. There exists λ ∈C such that F(x) = λx, for all x ∈ R;

3. There exists c ∈ U such that F(x) = cx, for all x ∈ R, with c ² ∈ C;

4. There exists c ∈ U such that F(x) = xc, for all x ∈ R, with c ² ∈ C.

     

A Tauberian theorem related to almost convergence

For x in a Banach algebra, the norm boundedness of the power sequence (x^k) is shown to be a Tauberian condition for its (C,α) summability to imply its f_(C,α) summability, a notion related to almost convergence.     

A generalization of bounded variation

Generalized Wiener classes are considered. For these classes the exact order of Fourier coefficients with respect to the trigonometric system is established and the estimation of ‖S _n(·, f)-f(·)‖_{C [0,2π]} where S _n(·, f) are the Fourier partial sums, is given. In particular, a uniform convergence criterion for the Fourier trigonometric series is obtained. This revised version was published online in August 2006 with corrections to the Cover Date.     

Incomplete polynomials of best approximation

The main theorem proved in this paper is as follows. There exist odd functionsf ɛC[−1,1] with the following property. LetP _n be the polynomial of best uniform approximation tof of degree≦n. Then for infinitely manyn,P _n has zero of orders(n)≧c logn atx=0. This research has been supported by Grant MPS 75-09833 of the National Science Foundation.