ON SEMILOCAL CONVERGENCE OF INEXACT NEWTON METHODS

Inexact Newton methods are constructed by combining Newton＇s method with another iterative method that is used to solve the Newton equations inexactly. In this paper, we establish two semilocal convergence theorems for the inexact Newton methods. When these two theorems are specified to Newton＇s method, we obtain a different Newton-Kantorovich theorem about Newton＇s method. When the iterative method for solving the Newton equations is specified to be the splitting method, we get two estimates about the iteration steps for the special inexact Newton methods.     

BLOCK BASED NEWTON-LIKE BLENDING INTERPOLATION

Newton＇s polynomial interpolation may be the favourite linear interpolation in the sense that it is built up by means of the divided differences which can be calculated recursively and produce useful intermediate results. However Newton interpolation is in fact point based interpolation since a new interpolating polynomial with one more degree is obtained by adding a new support point into the current set of support points once at a time. In this paper we extend the point based interpolation to the block based interpolation. Inspired by the idea of the modern architectural design, we first divide the original set of support points into some subsets （blocks）, then construct each block by using whatever interpolation means, linear or rational and finally assemble these blocks by Newton＇s method to shape the whole interpolation scheme. Clearly our method offers many flexible interpolation schemes for choices which include the classical Newton＇s polynomial interpolation as its special case. A bivariate analogy is also discussed and numerical examples are given to show the effectiveness of our method.     

POINTWISE CONVERGENCE FOR EXPANSIONS IN SPHERICAL MONOGENICS

We offer a new approach to deal with the pointwise convergence of FourierLaplace series on the unit sphere of even-dimensional Euclidean spaces. By using spherical monogenics defined through the generalized Cauchy-Riemann operator, we obtain the spherical monogenic expansions of square integrable functions on the unit sphere. Based on the generalization of Fueter＇s theorem inducing monogenic functions from holomorphic functions in the complex plane and the classical Carleson＇s theorem, a pointwise convergence theorem on the new expansion is proved. The result is a generalization of Carleson＇s theorem to the higher dimensional Euclidean spaces. The approach is simpler than those by using special functions, which may have the advantage to induce the singular integral approach for pointwise convergence problems on the spheres.     

MODIFIED NEWTON＇S ALGORITHM FOR COMPUTING THE GROUP INVERSES OF SINGULAR TOEPLITZ MATRICES

Newton＇s iteration is modified for the computation of the group inverses of singular Toeplitz matrices. At each iteration, the iteration matrix is approximated by a matrix with a low displacement rank. Because of the displacement structure of the iteration matrix, the matrix-vector multiplication involved in Newton＇s iteration can be done efficiently. We show that the convergence of the modified Newton iteration is still very fast. Numerical results are presented to demonstrate the fast convergence of the proposed method.     

ON THE DIVIDED DIFFERENCE FORM OF FAA DI BRUNO＇S FORMULA Ⅱ

In this paper, we consider the higher divided difference of a composite function f（g（t）） in which g（t） is an s-dimensional vector. By exploiting some properties from mixed partial divided differences and multivariate Newton interpolation, we generalize the divided difference form of Faà di Bruno＇s formula with a scalar argument. Moreover, a generalized Faà di Bruno＇s formula with a vector argument is derived.     

Preconditioned Iterative Methods for Algebraic Systems from Multiplicative Half-Quadratic Regularization Image Restorations

<正>Image restoration is often solved by minimizing an energy function consisting of a data-fidelity term and a regularization term.A regularized convex term can usually preserve the image edges well in the restored image.In this paper,we consider a class of convex and edge-preserving regularization functions,i.e.,multiplicative half-quadratic regularizations,and we use the Newton method to solve the correspondingly reduced systems of nonlinear equations.At each Newton iterate,the preconditioned conjugate gradient method,incorporated with a constraint preconditioner,is employed to solve the structured Newton equation that has a symmetric positive definite coefficient matrix. The eigenvalue bounds of the preconditioned matrix are deliberately derived,which can be used to estimate the convergence speed of the preconditioned conjugate gradient method.We use experimental results to demonstrate that this new approach is efficient, and the effect of image restoration is reasonably well.     

求解方程的一类迭代公式

Using the forms of Newton iterative function, the iterative function of Newton's method to handle the problem of multiple roots and the Halley iterative function, we give a class of iterative formulae for solving equations in one variable in this paper and show that their convergence order is at least quadratic. At last we employ our methods to solve some non-linear equations and compare them with Newton's method and Halley's method. Numerical results show that our iteration schemes are convergent if we choose two suitable parametric functions λ(x) and μ(x). Therefore, our iteration schemes are feasible and effective.     

GLOBAL WELL-POSEDNESS FOR THE KLEIN-GORDON EQUATION BELOW THE ENERGY NORM

We study global well-posedness below the energy norm of the Cauchyproblem for the Klein-Gordon equation in R^n with n≥3. By means of Bourgain‘s method along with the endpoint Strichartz estimates of Keel and Tao, we prove the H^s-global well-posedness with s&lt;1 of the Cauchy problem for the Klein-Gordon equation. This we do by establishing a series of nonlinear a priori estimates in the setting of Besov spaces.     

The Application of Kernel Smoothing to Time Series Data

There are already a lot of models to fit a set of stationary time series, such as AR, MA, and ARMA models. For the non-stationary data, an ARIMA or seasonal ARIMA models can be used to fit the given data. Moreover, there are also many statistical softwares that can be used to build a stationary or non-stationary time series model for a given set of time series data, such as SAS, SPLUS, etc. However, some statistical softwares wouldn＇t work well for small samples with or without missing data, especially for small time series data with seasonal trend. A nonparametric smoothing technique to build a forecasting model for a given small seasonal time series data is carried out in this paper. And then, both the method provided in this paper and that in SAS package are applied to the modeling of international airline passengers data respectively, the comparisons between the two methods are done afterwards. The results of the comparison show us the method provided in this paper has superiority over SAS＇s method.     

Efficient estimation of varying coefficient seemly unrelated regression model

In this paper, we propose a class of varying coefficient seemingly unrelated regression models, in which the errors are correlated across the equations. By applying the series approximation and taking the contemporaneous correlations into account, we propose an efficient generalized least squares series estimation for the unknown coefficient functions. The consistency and asymptotic normality of the resulting estimators are established. In comparison with the ordinary/east squares ones, the proposed estimators are more efficient with smaller asymptotical variances. Some simulgtlon＇studies and a real application are presented to demonstrate the finite sample performance of the proposed methods. In addition, based on a B-spline approximation, we deduce the asymptotic bias and variance of the proposed estimators.     

某些Ruzsa数$R_m$的新上界

For A ■ Z m and n ∈ Z m ,let σ A (n) be the number of solutions of equation n = x + y,x,y ∈ A.Given a positive integer m,let R m be the least positive integer r such that there exists a set A ■ Z m with A + A = Z m and σ A (n) ≤ r.Recently,Chen Yonggao proved that all R m ≤ 288.In this paper,we obtain new upper bounds of some special type R kp 2 .     

关于杨全会和陈永高提出的一个问题

对任意的正整数与集合,令为解的个数.杨全会和陈永高证明了:若整数且,则不存在集合使得对所有充分大的整数成立,其中.对整数和,定义为满足对所有整数成立的集合的个数.杨全会和陈永高证明了是有限的,且.同时,他们问对任意整数,是否存在使得对所有整数成立.在本文中,我们给出了在时的准确公式.从而推出在时成立.     

Non-Negative Integer Matrix Representations of a $\mathbb{Z}_{+}$-Ring

The $\mathbb{Z}_{+}$-ring is an important invariant in the theory of tensor category. In this paper, by using matrix method, we describe all irreducible $\mathbb{Z}_{+}$-modules over a $\mathbb{Z}_{+}$-ring $\mathcal{A}$, where $\mathcal{A}$ is a commutative ring with a $\mathbb{Z}_{+}$-basis{$1$, $x$, $y$, $xy$} and relations: $$ x^{2}=1,\;\;\;\;\; y^{2}=1+x+xy.$$We prove that when the rank of $\mathbb{Z}_{+}$-module $n\geq5$, there does not exist irreducible $\mathbb{Z}_{+}$-modules and when the rank $n\leq4$, there exists finite inequivalent irreducible $\mathbb{Z}_{+}$-modules, the number of which is respectively 1, 3, 3, 2 when the rank runs from 1 to 4.     

$c$-半层空间与几乎完全正则空间一点注记

In this paper, we give some characterizations of almost completely regular spaces and c-semistratifiable spaces(CSS) by semi-continuous functions. We mainly show that:(1)Let X be a space. Then the following statements are equivalent:(i) X is almost completely regular.(ii) Every two disjoint subsets of X, one of which is compact and the other is regular closed, are completely separated.(iii) If g, h : X → I, g is compact-like, h is normal lower semicontinuous, and g ≤ h, then there exists a continuous function f : X → I such that g ≤ f ≤ h;and(2) Let X be a space. Then the following statements are equivalent:(a) X is CSS;(b) There is an operator U assigning to a decreasing sequence of compact sets(Fj)j∈N,a decreasing sequence of open sets(U(n,(Fj)))n∈N such that(b1) Fn■U(n,(Fj)) for each n ∈ N;(b2)∩n∈NU(n,(Fj)) =∩n∈NFn;(b3) Given two decreasing sequences of compact sets(Fj)j∈N and(Ej)j∈N such that Fn■Enfor each n ∈ N, then U(n,(Fj))■U(n,(Ej)) for each n ∈ N;(c) There is an operator Φ : LCL(X, I) → USC(X, I) such that, for any h ∈ LCL(X, I),0 Φ(h) h, and 0 Φ(h)(x) h(x) whenever h(x) 0.     

$L^{p}_{[0,1]}$空间M\"{u}ntz有理逼近的Jackson型估计 (英)

设$\Lambda=\{\lambda_{n}\}_{n=1}^{\infty}$为正的实数数列, 且当$n\rightarrow\infty$时, 有$\lambda_{n}\searrow 0$.本文给出了当 $\lambda_{n}\leq Mn^{-\frac{1}{2}},\;n=1,2, \cdots ,$(其中$M>0$为一正常数)时M\"{u}ntz系统$\{x^{\lambda_n}\}$的有理函数在$ L_{[0,1]} ^{p}$空间的逼近速度,主要结论为$R_{n} (f, \Lambda )_{L^{p}}\leq C_M \omega (f, n^{-\frac{1}{2}})_{L^{p}},\;1 \leq p \leq \infty.$     

Projektive Skalen,Tschebyscheff-Polynome und Fibonacci-Zahlen

Summary. Let $\widehat{\widehat T}_n$ and $\overline U_n$ denote the modified Chebyshev polynomials defined by $\widehat{\widehat T}_n (x) = {T_{2n + 1} \left(\sqrt{x + 3 \over 4} \right) \over \sqrt{x + 3 \over 4}}, \quad \overline U_{n}(x) = U_{n} \left({x + 1 \over 2}\right) \qquad (n \in \mathbb{N}_{0},\ x \in \mathbb{R}).$ For all $n \in \mathbb{N}_{0}$ define $\widehat{\widehat T}_{-(n + 1)} = \widehat{\widehat T}_n$ and $\overline U_{-(n + 2)} = - \overline U_n$, furthermore $\overline U_{-1} = 0$. In this paper, summation formulae for sums of type $\sum\limits^{+\infty}_{k = -\infty} \mathbf a_{\mathbf k}(\nu; x)$ are given, where $\bigl(\mathbf a_{\mathbf k}(\nu; x)\bigr)^{-1} = (-1)^k \cdot \Bigl( x \cdot \widehat{\widehat T}_{\left[k + 1 \over 2\right] - 1} (\nu) +\widehat{\widehat T}_{\left[k + 1 \over 2\right]}(\nu)\Bigr) \cdot \Bigl(x \cdot \overline U_{\left[k \over 2\right] - 1} (\nu) + \overline U_{\left[k \over 2\right]} (\nu)\Bigr)$ with real constants $ x, \nu $. The above sums will turn out to be telescope sums. They appear in connection with projective geometry. The directed euclidean measures of the line segments of a projective scale form a sequence of type $(\mathbf a_{\mathbf k} (\nu;x))_{k \in \mathbb{Z}}$ where $ \nu $ is the cross-ratio of the scale, and x is the ratio of two consecutive line segments once chosen. In case of hyperbolic $(\nu \in \mathbb{R} \setminus] - 3,1[)$ and parabolic $\nu = -3$ scales, the formula $\sum\limits^{+\infty}_{k = -\infty} \mathbf a_{\mathbf k} (\nu; x) = {\frac{1}{x - q_{{+}\atop(-)}}} - {\frac{1}{x - q_{{-}\atop(+)}}} \eqno (1)$ holds for $\nu > 1$ (resp. $\nu \leq - 3$), unless the scale is geometric, that is unless $x = q_+$ or $x = q_-$. By $q_{\pm} = {-(\nu + 1) \pm \sqrt{(\nu - 1)(\nu + 3)} \over 2}$ we denote the quotient of the associated geometric sequence.

     

Estimates for Fourier Coefficients of Cusp Forms in Weight Aspect

Let f be a holomorphic Hecke eigenform of weight k for the modular groupΓ = SL2(Z) and let λf(n) be the n-th normalized Fourier coefficient. In this paper, by a new estimate of the second integral moment of the symmetric square L-function related to f, the estimate 1λf(n21) x2 k2(log(x + k))6n≤x is established, which improves the previous result.     

Behaviour at the non-positive integers of Dirichlet series associated to polynomials of several variables

In this paper, we relate the special values at a non-positive integer \({\underline{\mathbf{s}}=(s_{1},\ldots, s_{r})= -\underline{\mathbf{N}}= (-N_{1},\ldots, -N_{r})}\) obtained by meromorphic continuation of the multiple Dirichlet series \({{Z(\underline{\mathbf{P}}, \underline{\mathbf{s}})=\sum_{\underline{m}\in {\mathbb{N}}^{*n}}{\frac{1}{\prod_{i=1}^{r}{P_{i}^{ s_{i}}(\underline{m})}}}}}\) to special values of the function \({Y(\underline{\mathbf{P}}, \underline{\mathbf{s}})=\int_{[1, +\infty[^{n}} {\prod_{i=1}^{r}{P_{i}^{- s_{i}}(\underline{\mathbf{x}})}\; d{\underline{\mathbf{x}}}}}\) where \({\underline{\mathbf{P}}=(P_{1},..., P_{r}),\; (r\geq 1)}\) are elliptic polynomials in “\({n}\) ” variables. We prove a simple relation between \({Z(\underline{\mathbf{P}}_{\underline{\mathbf{a}}}, -\underline{\mathbf{N}})}\) and \({Y(\underline{\mathbf{P}}_{\underline{\mathbf{a}}}, -\underline{\mathbf{N}})}\), such that for all \({\underline{\mathbf{a}} \in {\mathbb{R}}^{n}_{+}}\), we denote \({\underline{\mathbf{P}}_{\underline{\mathbf{a}}}:=(P_{1 \underline{\mathbf{a}}},\ldots, P_{r \underline{\mathbf{a}}})}\), where \({P_{i\;\underline{\mathbf{a}}}(\underline{\mathbf{x}}):= P_i(\underline{\mathbf{x}}+ \underline{\mathbf{a}})\; (1\leq i\leq r)}\) is the shifted polynomial.     

整数集的加权表示的渐进基

Let k1, k2 be nonzero integers with(k1, k2) = 1 and k1k2≠-1. Let Rk1,k2(A, n)be the number of solutions of n = k1a1 + k2a2, where a1, a2 ∈ A. Recently, Xiong proved that there is a set A  Z such that Rk1,k2(A, n) = 1 for all n ∈ Z. Let f : Z-→ N0∪ {∞} be a function such that f-1(0) is finite. In this paper, we generalize Xiong's result and prove that there exist uncountably many sets A  Z such that Rk1,k2(A, n) = f(n) for all n ∈ Z.     

多尺度分析生成元的刻画

本文将给出多尺度分析生成元的一种完全刻画.将证明:函数φ∈L~2(R)是二进多尺度分析生成元的充要条件是(1)存在{a_k}∈l~2,φ(x)=∑_(k∈Z)a_kφ(2x-k);(2)存在正数A相似文献