THE DIVERGENCE OF LAGRANGE INTERPOLATION FOR ｜x｜^α

This paper shows that the sequence of Lagrange interpolation polynomials corresponding to the rune tion f（z） =｜x｜^α（1〈α〈2） on [-1,1] can diverge everywhere in the interval except at zero and the end-points.     

ON NEWMAN-TYPE RATIONAL INTERPOLATION TO ｜x｜ AT THE CHEBYSHEV NODES OF THE SECOND KIND

Recently Brutman and Passow considered Newman-type rational interpolation to ｜x｜ induced by arbitrary set of symmetric nodes in [-1,1] and gave the general estimation of the approximation error.By their methods one could establish the exact order of approximation for some special nodes. In the present paper we consider the special case where the interpolation nodes are the zeros of the Chebyshev polynomial of the second kind and prove that in this case the exact order of approximation is O（1/n｜nn）     

THE EXACT CONVERGENCE RATE AT ZERO OF LAGRANGE INTERPOLATION POLYNOMIAL TO ｜x｜^α

In this paper we present a generalized quantitative version of a result the exact convergence rate at zero of Lagrange interpolation polynomial to spaced nodes in [-1,1] due to M.Revers concerning f（x） = ｜x｜α with on equally     

BLOW-UP RESULTS AND ASYMPTOTIC BEHAVIOR OF THE EMDEN-FOWLER EQUATION u＂ = ｜u｜^p

In this article the author works with the ordinary differential equation u＂ = ｜u｜^p for some p 〉 0 and obtains some interesting phenomena concerning blow-up, blow-up rate, life-span, stability, instability, zeros and critical points of solutions to this equation.     

｜a b｜≤｜a｜ ｜b｜取舍等号的条件应用

我们知道不等式｜ａ＋ｂ｜≤｜ａ｜＋｜ｂ｜是高中代数下册中２５页的一个定理,它在解有关绝对值问题中有着重要的应用．我们现对这个不等式取舍等号的条件进行分析,不难得到两条重要的推论：１．｜ａ＋ｂ｜＝｜ａ｜＋｜ｂ｜ａｂ≥０;２．｜ａ＋ｂ｜＜｜ａ｜＋｜ｂ｜ａｂ＜０．这两个基本的互逆关系,显示了数学协调美的内力,充分体现了数学问题的相互转化的作用,标志着它们必有优美的应用．下面举例说明．例１　（上海市１９８４年中学数学竞赛题）方程｜２ｘ－１｜＋｜ｘ－２｜＝｜ｘ＋１｜的实数解为．解　原方程可化为｜２ｘ－…     

THE DIVERGENCE OF LAGRANGE INTERPOLATION FOR ｜x｜^α（2〈α〈4）AT EQUIDISTANT NODES

It is a classical result of Bernstein that the sequence of Lagrange interpolation polumomials to ｜x｜ at equally spaced nodes in [-1, 1] diverges everywhere, except at zero and the end-points. In the present paper, toe prove that the sequence of Lagrange interpolation polynomials corresponding to ｜x｜^α （2 〈 α 〈 4） on equidistant nodes in [-1, 1] diverges everywhere, except at zero and the end-points.     

On Operators Satisfying T＊｜T2｜T≥ T＊｜T＊｜2T

Let T be a bounded linear operator on a complex Hilbert space H. In this paper we introduce a new class denoted by l-＊-A, of operators satisfying T＊｜T2｜T≥ T＊｜T＊｜2T, and we prove the basic properties of these operators. Using these results, we also prove that if T or T＊ ∈l-＊-A, then w（f（T）） = f（w（T））, σea（f（T）） = f（σea（T）） for every f C H（σ（T））, where g（σ（T）） denotes the set of all analytic functions on an open neighborhood of σ（T）.     

不等式｜f（x）｜＋｜g（x）｜〈C的解法

我们会解形如 | ｆ(ｘ) | <ｃ (1)(常数ｃ>0 ,下同 )的不等式 ,实际上不等式 (1)等价于 ｆ2 (ｘ) <ｃ2 ,或者 -ｃ <ｆ(ｘ) <ｃ.解含有绝对值的不等式的关键是去掉绝对值符号 .但如果不等式中含有两个代数式的绝对值 ,比如不等式| ｆ(ｘ) | | ｇ(ｘ) | <ｃ (2 )去掉绝对值符号就不那么容易了 ,通常要把实数集划分成若干个区间来讨论 ,这样不仅有划分数集的繁难 ,还有解多个不等式的琐碎 .因此 ,我们设想 ,能不能通过一种变换 ,将不等式 (2 )转化为形如 (1)的基本不等式求解 ,从而回避或者简化这种繁难和琐碎呢 ?这样的变换是有的 ,而且出人…     

活用｜a&#183;b｜≤｜a｜&#183;｜b｜解题举例

向量不等式｜a&#183;b｜≤｜a｜&#183;｜b｜是向量的一个重要性质，本文例谈它的应用．     

On the order of approximation for the rational interpolation to |x|

The order of approximation for Newman-type rational interpolation to |x| is studied in this paper.For general set of nodes, the extremum of approximation error and the order of the best uniform approximation are estimated. The result illustrates the general quality of approximation in a different way. For the special case where the interpolation nodes are xi=(i/n)r(i=1,2, … ,n;r＞0), it is proved that the exact order of approximation is O(1/n), O(1/nlogn) and O(1/nr), respectively, corresponding to 0＜r＜1, r=1 and r＞1.     

Some properties for a class of symmetric functions with applications

For x = (x ₁, x ₂, ..., x _n ) ∈ ℝ₊ ⁿ , the symmetric function ψ _n (x, r) is defined by $\psi _n (x,r) = \psi _n \left( {x_1 ,x_2 , \cdots ,x_n ;r} \right) = \sum\limits_{1 \leqslant i_1 < i_2 \cdots < i_r \leqslant n} {\prod\limits_{j = 1}^r {\frac{{1 + x_{i_j } }} {{x_{i_j } }}} } ,$\psi _n (x,r) = \psi _n \left( {x_1 ,x_2 , \cdots ,x_n ;r} \right) = \sum\limits_{1 \leqslant i_1 < i_2 \cdots < i_r \leqslant n} {\prod\limits_{j = 1}^r {\frac{{1 + x_{i_j } }} {{x_{i_j } }}} } ,     

Volume Formulas in Lp-Spaces

We extend classical volume formulas for ellipsoids and zonoids to p-sums of segments $${vol}\left( {\sum\limits_{i=1}^m { \oplus_p } [ -x_i ,x_i ]} \right)^{1/n} \sim_{c_p} n^{ - \frac{1}{{p'}}} \left( {\sum\limits_{card(I) = n} {|\det (x_i)_i |^p}} \right)^{\frac{1}{{pn}}}$$ where x1,...,xm are m vectors in $\mathbb{R}^n ,\frac{1}{p} + \frac{1}{{p\prime }} = 1$ . According to the definition of Firey, the Minkowski p-sum of segments is given by $$\sum\limits_{i = 1}^m { \oplus _p [ - x_{i,} x_i ]} = \left\{ {\sum\limits_{i = 1}^m {\alpha _i } x_i \left| {\left( {\sum\limits_{i = 1}^m {|\alpha _i |^{p^\prime } } } \right)} \right.^{\frac{1}{{p^\prime }}} \leqslant 1} \right\}.$$ We describe related geometric properties of the Lewis maps associated to classical operator norms.     

On the normalizing multiplier of the generalized Jackson kernel

We consider the question of evaluating the normalizing multiplier $$\gamma _{n,k} = \frac{1}{\pi }\int_{ - \pi }^\pi {\left( {\frac{{sin\tfrac{{nt}}{2}}}{{sin\tfrac{t}{2}}}} \right)^{2k} dt} $$ for the generalized Jackson kernel J _n,k (t). We obtain the explicit formula $$\gamma _{n,k} = 2\sum\limits_{p = 0}^{\left[ {k - \tfrac{k}{n}} \right]} {( - 1)\left( {\begin{array}{*{20}c} {2k} \\ p \\ \end{array} } \right)\left( {\begin{array}{*{20}c} {k(n + 1) - np - 1} \\ {k(n - 1) - np} \\ \end{array} } \right)} $$ and the representation $$\gamma _{n,k} = \sqrt {\frac{{24}}{\pi }} \cdot \frac{{(n - 1)^{2k - 1} }}{{\sqrt {2k - 1} }}\left[ {1\frac{1}{8} \cdot \frac{1}{{2k - 1}} + \omega (n,k)} \right],$$ , where $$\left| {\omega (n,k)} \right| < \frac{4}{{(2k - 1)\sqrt {ln(2k - 1)} }} + \sqrt {12\pi } \cdot \frac{{k^{\tfrac{3}{2}} }}{{n - 1}}\left( {1 + \frac{1}{{n - 1}}} \right)^{2k - 2} .$$ .     

On a Congruence Involving Generalized Fibonomial Coefficients

Let (F_n)_n≥0 be the Fibonacci sequence. For 1 ≤ k ≤ m, the Fibonomial coefficient is defined as

$${\left[ {\begin{array}{*{20}{c}} n \\ k \end{array}} \right]_F} = \frac{{{F_{n - k + 1}} \cdots {F_{n - 1}}{F_n}}}{{{F_1} \cdots {F_k}}}$$

. In 2013, Marques, Sellers and Trojovský proved that if p is a prime number such that p ≡ ±1 (mod 5), then p?\({\left[ {\begin{array}{*{20}{c}} {{p^{a + 1}}} \\ {{p^a}} \end{array}} \right]_F}\) for all integers a ≥ 1. In 2010, in particular, Kilic generalized the Fibonomial coefficients for

$${\left[ {\begin{array}{*{20}{c}} n \\ k \end{array}} \right]_{F,m}} = \frac{{{F_{\left( {n - k + 1} \right)m}} \cdots {F_{\left( {n - 1} \right)m}}{F_{nm}}}}{{{F_m} \cdots {F_{km}}}}$$

. In this note, we generalize Marques, Sellers and Trojovský result to prove, in particular, that if p ≡ ±1 (mod 5), then \({\left[ {\begin{array}{*{20}{c}} {{p^{a + 1}}} \\ {{p^a}} \end{array}} \right]_{F,m}} \equiv 1\) (mod p), for all a ≥ 0 and m ≥ 1.

     

THROREMS OF DISTORTION FOR SCHLICHT FUNCTIONS

Let \[f(z) = z + \sum\limits_{n = 1}^\infty {{a_n}{z^n} \in S} {\kern 1pt} {\kern 1pt} {\kern 1pt} and{\kern 1pt} {\kern 1pt} {\kern 1pt} \log \frac{{f(z) - f(\xi )}}{{z - \xi }} - \frac{{z\xi }}{{f(z)f(\xi )}} = \sum\limits_{m,n = 1}^\infty {{d_{m,n}}{z^m}{\xi ^n},} \], we denote \[{f_v} = f({z_v})\] , \[\begin{array}{l} {\varphi _\varepsilon }({z_u}{z_v}) = {\left| {\frac{{{f_u} - {f_v}}}{{{z_u} - {z_v}}}} \right|^\varepsilon }\frac{1}{{(1 - {z_u}{{\bar z}_v})}},\g_m^\varepsilon (z) = - {F_m}(\frac{1}{{f(z)}}) + \frac{1}{{{z^m}}} + \varepsilon {{\bar z}^m}, \end{array}\], where \({F_m}(t)\) is a Faber polynomial of degree m. Theorem 1. If \[f(z) \in S{\kern 1pt} {\kern 1pt} {\kern 1pt} and{\kern 1pt} {\kern 1pt} {\kern 1pt} \sum\limits_{u,v = 1}^N {{A_{u,v}}{x_u}{{\bar x}_v} \ge 0} \] and then \[\begin{array}{l} \sum\limits_{u,v = 1}^N {{A_{u,v}}{\lambda _u}{{\bar \lambda }_v}} {\left| {\frac{{{f_u} - {f_v}}}{{{z_u} - {z_v}}}} \right|^\varepsilon }\exp \{ \alpha {F_l}({z_u},{z_v})\} \ \le \sum\limits_{u,v = 1}^N {{A_{u,v}}{\lambda _u}{{\bar \lambda }_v}} \varphi _\varepsilon ^\alpha ({z_u}{z_v})l = 1,2,3, \end{array}\], where \[\begin{array}{l} {F_1}({z_u},{z_v}) = \frac{1}{2}\sum\limits_{n = 1}^\infty {\frac{1}{n}} g_n^\varepsilon ({z_u})\bar g_n^\varepsilon ({z_v}),\{F_2}({z_u},{z_v}) = \frac{1}{{1 + {\varepsilon _n}R{d_{n,n}}}}Rg_n^\varepsilon ({z_u})Rg_n^\varepsilon ({z_v}),\{F_3}({z_u},{z_v}) = \frac{1}{{1 - {\varepsilon _n}R{d_{n,n}}}}Rg_n^\varepsilon ({z_u})Rg_n^\varepsilon ({z_v}). \end{array}\] The \[F({z_u},{z_v}) = \frac{1}{2}{g_1}({z_u}){{\bar g}_2}({z_v})\] is due to Kungsun. Theorem 2. If \(f(z) \in S\) ,then \[P(z) + \left| {\sum\limits_{u,v = 1}^N {{A_{u,v}}{\lambda _u}{{\bar \lambda }_v}} {{\left| {\frac{{{f_u} - {f_v}}}{{{z_u} - {z_v}}}\frac{{{z_u}{z_v}}}{{{f_u}{f_v}}}} \right|}^\varepsilon }} \right| \le \sum\limits_{u,v = 1}^N {{\lambda _u}{{\bar \lambda }_v}} \frac{1}{{1 - {z_u}{{\bar z}_v}}}\], where \[\begin{array}{l} P(z) = \frac{1}{2}\sum\limits_{n = 1}^\infty {\frac{1}{n}} {G_n}(z),\{G_n}(z) = {\left| {\left| {\sum\limits_{n = 1}^N {{\beta _u}({F_n}(\frac{1}{{f({z_u})}}) - \frac{1}{{z_u^n}})} } \right| - \left| {\sum\limits_{n = 1}^N {{\beta _u}z_u^n} } \right|} \right|^2}, \end{array}\], \(P(z) \equiv 0\) is due to Xia Daoxing.     

THE ASYMPTOTIC BEHAVIOUR OF ANALYTIC FUNCTIONS

AIn this paper, the author obtains the following results:(1) If Taylor coeffiients of a function satisfy the conditions:(i),(ii),(iii)A_k=O(1/k) the for any h>0 the function φ(z)=exp{w(z)} satisfies the asymptotic equality the case h>1/2 was proved by Milin.(2) If f(z)=z α_2z~2 …∈S~* and,then for λ>1/2     

Oscillation theorems for second-order nonlinear delay difference equations

By means of Riccati transformation technique, we establish some new oscillation criteria for second-order nonlinear delay difference equation $$\Delta (p_n (\Delta x_n )^\gamma ) + q_n f(x_{n - \sigma } ) = 0,\;\;\;\;n = 0,1,2,...,$$ when $\sum\limits_{n = 0}^\infty {\left( {\frac{1}{{Pn}}} \right)^{\frac{1}{\gamma }} = \infty }$ . When $\sum\limits_{n = 0}^\infty {\left( {\frac{1}{{Pn}}} \right)^{\frac{1}{\gamma }} < \infty }$ we present some sufficient conditions which guarantee that, every solution oscillates or converges to zero. When $\sum\limits_{n = 0}^\infty {\left( {\frac{1}{{Pn}}} \right)^{\frac{1}{\gamma }} = \infty }$ holds, our results do not require the nonlinearity to be nondecreasing and are thus applicable to new classes of equations to which most previously known results are not.     

Crude Monte Carlo quadrature in infinite variance case and the Central Limit Theorem

After a short discussion of Monte Carlo integration the crude Monte Carlo method is tested by estimating the integrals

$$\int\limits_0^1 {\left( {\frac{1}{x}} \right)^{1/v} } dxas\bar f_n = \frac{1}{n}\sum\limits_{i = 1}^n {\left( {\frac{1}{{\xi _i }}} \right)^{1/v} ,} $$     

An improved Mordell type bound for exponential sums

For a sparse polynomial , with and , we show that

thus improving upon a bound of Mordell. Analogous results are obtained for Laurent polynomials and for mixed exponential sums.