Convergence theorems for λ-strict pseudo-contractions in q-uniformly smooth Banach spaces

In this paper, we continue to discuss the properties of iterates generated by a strict pseudo- contraction or a finite family of strict pseudo-contractions in a real q-uniformly smooth Banach space. The results presented in this paper are interesting extensions and improvements upon those known ones of Marino and Xu [Marino, G., Xu, H. K.： Weak and strong convergence theorems for strict pseudo-contractions in Hilbert spaces. J. Math. Anal. Appl., 324, 336-349 （2007）]. In order to get a strong convergence theorem, we modify the normal Mann＇s iterative algorithm by using a suitable convex combination of a fixed vector and a sequence in C. This result extends a recent result of Kim and Xu [Kim, T. H., Xu, H. K.： Strong convergence of modified Mann iterations. Nonl. Anal., 61, 51- 60 （2005）] both from nonexpansive mappings to λ-strict pseudo-contractions and from Hilbert spaces to q-uniformly smooth Banach spaces.     

基于模拟扩散的最短路径新算法

基于模拟水流扩散的自然现象,提出了一种寻求最优路径的新算法,介绍了该算法原理和具体计算过程,验证了该算法的正确性和合理性.     

体会算法思维感悟算法思想

算法是高中数学课程改革中的新增内容,是计算机理论和技术的核心,也是数学及其应用的重要组成部分．随着现代信息技术飞速发展,算法在科学技术、社会发展中发挥着越来越大的作用,算法的基本知识、方法、思想日益融人社会生活的许多方面,已经成为现代人应具备的一种数学素养．笔者根据普通高中《数学课程标准》中的教学要求,结合近几年高考对算法的考查,就“算法初步”的复习进行了深思．     

关于数学证明方法与算法实现关系的一些探讨

从数学证明和程序设计的角度,分析比较了数学命题定理证明中常用的数学归纳法、递推算法、递归算法、反证法等数学方法.讨论了它们在理论证明、算法实现方面的联系和优缺点,提出教学中的一些建议.     

非线性混合似变分不等式的扰动近似点-投影算法

In this paper we introduce a new perturbed proximal-projection algorithm for finding the common element of the set of fixed points of non-expansive mappings and the set of solutions of nonlinear mixed variational-like inequalities. The convergence criteria of the iterative sequences generated by the new iterative algorithm is also given. Our approach and results generalize many known results in this field.     

指令性抽样下总体均值和方差的估计及其应用

指令性抽样下的样本往往不具有代表性,因此仅用它们来推断总体将是不适合的,这篇文章基于观察信息,利用概率统计方法将没有发出调查指令的样本信息补充出来,然后利用观察信息和补充信息一起来对总体进行推断.具体我们给出了总体均值和方差参数估计的迭代公式,并给出它们在经济犯罪调查和流行病调查中的应用.     

一种求解非线性鞍点问题的交替投影方法

本文针对一类连续非线性Max-Min优化所对应的鞍点问题,提出了一种交替投影算法,证明了算法的收敛性.初步的数值实验表明本文所提出的算法比已有的同类算法具有更高的计算效率.     

ACCURATE ATTENUATION CORRECTION FOR ALGEBRAIC RECONSTRUCTION TECHNIQUE IN SPECT

We present a new iterative reconstruction algorithm to improve the algebraic reconstruction technique （ART） for the Single-Photon Emission Computed Tomography. Our method is a generalization of the Kaczmarz iterative algorithm for solving linear systems of equations and introduces exact and implicit attenuation correction derived from the attenuated Radon transform operator at each step of the algorithm. The performances of the presented algorithm have been tested upon various numerical experiments in presence of both strongly non-uniform attenuation and incomplete measurements data. We also tested the ability of our algorithm to handle moderate noisy data. Simulation studies demonstrate that the proposed method has a significant improvement in the quality of reconstructed images over ART. Moreover, convergence speed was improved and stability was established, facing noisy data, once we incorporate filtration procedure in our algorithm.     

A NEW TRUST-REGION ALGORITHM FOR NONLINEAR CONSTRAINED OPTIMIZATION

We propose a new trust region algorithm for nonlinear constrained optimization problems. In each iteration of our algorithm, the trial step is computed by minimizing a quadratic approximation to the augmented Lagrange function in the trust region. The augmented Lagrange function is also used as a merit function to decide whether the trial step should be accepted. Our method extends the traditional trust region approach by combining a filter technique into the rules for accepting trial steps so that a trial step could still be accepted even when it is rejected by the traditional rule based on merit function reduction. An estimate of the Lagrange multiplier is updated at each iteration, and the penalty parameter is updated to force sufficient reduction in the norm of the constraint violations. Active set technique is used to handle the inequality constraints. Numerical results for a set of constrained problems from the CUTEr collection are also reported.     

THE REDUCED BASIS TECHNIQUE AS A COARSE SOLVER FOR PARAREAL IN TIME SIMULATIONS

In this paper, we extend the reduced basis methods for parameter dependent problems to the parareal in time algorithm introduced by Lions et al. [12] and solve a nonlinear evolutionary parabolic partial differential equation. The fine solver is based on the finite element method or spectral element method in space and a semi-implicit Runge-Kutta scheme in time. The coarse solver is based on a semi-implicit scheme in time and the reduced basis approximation in space. Of[line-online procedures are developed, and it is proved that the computational complexity of the on-line stage depends only on the dimension of the reduced basis space （typically small）. Parareal in time algorithms based on a multi-grids finite element method and a multi-degrees finite element method are also presented. Some numerical results are reported.