A remark about the density of the orbits of the Collatz permutation

In this work, we study the density of the orbits of the Collatz Permutation and discuss the long-standing problem of determining whether this permutation has only a finite number of distinct orbits.     

A New Affine Projection Algorithm and Its Statistical Behavior

An Affine projection algorithm with Direction error （AP-DE） is presented by redefining the iteration error. Under a measurement-noise-free condition, the iteration error is directly caused by the direction vector. A statistical analysis model is used to analyze the AP-DE algorithm. Deterministic recursive equations for the mean weight error and for the Mean-square error （MSE） in iteration direction are derived. We also analyze the stability of MSE in iteration direction and the optimal step-size for the AP-DE algorithm. Simulation results are provided to corroborate the analytical theory.     

迭代矩阵谱半径的上界估计

该文对一类广义对角占优矩阵Ｍ,给出了迭代矩阵Ｍ－１Ｎ 的谱半径的上界．特别,当Ｍ是严格对角占优时,证明了所得到的估计值总比通常用作谱半径的估计值要好．     

A comparison of the Newton-Krylov method with high order Newton-like methods to solve nonlinear systems

We compare the CPU time and error estimates of some variants of Newton method of the third and fourth-order convergence with those of the Newton-Krylov method used to solve systems of nonlinear equations. By expanding some numerical experiments we show that the use of Newton-Krylov method is better in the cost and accuracy points of view than the use of other high order Newton-like methods when the system is sparse and its size is large.     

Drinfeld Iterations and Wagner's Theorem

Abstract

In a previous paper, the author, in collaboration with Abhyankar, has proved that under certain assumptions the Galois groups of Carlitz–Drinfeld iterates of linear polynomials are general linear groups. The proof used Cameron–Kantor's characterization of linear groups. In this paper, we recover the result in very generic case by using a more elementary Wagner's characterization of linear groups. This is done using some commutative algebra.     

On multiply-connected Fatou components in iteration of meromorphic functions

Let be a transcendental meromorphic function with at most finitely many poles. We mainly investigated the existence of the Baker wandering domains of f(z) and proved, among others, that if f(z) has a Baker wandering domain U, then for all sufficiently large n, fn(U) contains a round annulus whose module tends to infinity as n→∞ and so for some 0<d<1,

     

Iterative approaches to common fixed points of nonexpansive mappings in Banach spaces

The iteration scheme for families of nonexpansive mappings, essentially due to Halpern [Bull. Amer. Math. Soc. 73 (1967) 957-961], is established in a Banach space. The main theorem extends a recent result of O'Hara et al. [Nonlinear Anal. 54 (2003) 1417-1426] to a Banach space setting. For the same iteration scheme, with finitely many mappings, a complementary result to a result of Jung and Kim [Bull. Korean Math. Soc. 34 (1997) 93-102] (also Bauschke [J. Math. Anal. Appl. 202 (1996) 150-159]) is obtained by imposing other condition on the sequence of parameters. Our results also improve results in [C. R. Acad. Sci. Sér A-B Paris 284 (1977) 1357-1359; J. Math. Anal. Appl. 211 (1997) 71-83; Arch. Math. 59 (1992) 486-491] in framework of a Hilbert space.     

半导体问题的交替方向有限元方法

该文用交替方向有限元方法求解半导体问题的Energy Trans port (ET)模型。对模型中椭圆型的电子位势方程采用交替方向迭代法，对流占优扩散的电子浓度和空穴浓度方程采用特征交替方向有限元方法，热传导方程利用Patch逼近采用交替方向有限元方法求解。利用微分方程的先验估计理论和技巧，分别得到了椭圆型方程和抛物型方程的最优H+1和L+2误差估计。     

应用迭代法求解一类非线性问题

本文应用迭代法求解一类有限维非线性问题,该方法是求解线性问题的雅可比迭代法在非线性问题上的推广,且此迭代方法具有几何收敛性质.     

线性规划的一种新算法——直接搜索迭代法

本文提出一种新的线性规划迭代算法，它把一般线性规划问题化为一个只含不等式约束的标准形，然后从标准形的任一可行点开始直接进行迭代，即可求出最优解，粗估本算法计算性能在高维时至少不亚于Ｋａｒｍａｒｋａｒ法等内点法，低维时也可与单纯形法相比，且迭代过程无误差积累。