A Modified Quasi-Newton Method for Structured Optimization with Partial Information on the Hessian

This paper develops a modified quasi-Newton method for structured unconstrained optimization with partial information on the Hessian, based on a better approximation to the Hessian in current search direction. The new approximation is decided by both function values and gradients at the last two iterations unlike the original one which only uses the gradients at the last two iterations. The modified method owns local and superlinear convergence. Numerical experiments show that the proposed method is encouraging comparing with the methods proposed in [4] for structured unconstrained optimization Presented at the 6th International Conference on Optimization: Techniques and Applications, Ballarat, Australia, December 9–11, 2004     

关于NA情况下重对数律收敛速度的一般形式

研究了NA序列重对数律收敛速度的一般形式，把Davis和Gut的结果推广到了NA的情形，并使梁汉营等人关于对数律一个结果成为特例；作为推论，得到了关于NA序列重对数律收敛速度的充分条件．     

Skew-Hermitian Triangular Splitting Iteration Methods for Non-Hermitian Positive Definite Linear Systems of Strong Skew-Hermitian Parts

By further generalizing the skew-symmetric triangular splitting iteration method studied by Krukier, Chikina and Belokon (Applied Numerical Mathematics, 41 (2002), pp. 89–105), in this paper, we present a new iteration scheme, called the modified skew-Hermitian triangular splitting iteration method, for solving the strongly non-Hermitian systems of linear equations with positive definite coefficient matrices. We discuss the convergence property and the optimal parameters of this new method in depth. Moreover, when it is applied to precondition the Krylov subspace methods like GMRES, the preconditioning property of the modified skew-Hermitian triangular splitting iteration is analyzed in detail. Numerical results show that, as both solver and preconditioner, the modified skew-Hermitian triangular splitting iteration method is very effective for solving large sparse positive definite systems of linear equations of strong skew-Hermitian parts.     

基于自适应预测滤波理论的模数转换器设计方法

基于自适应差分量化理论，提出了在不增加转换位数的情况下提高模数转换器(ADC)动态范围的一种设计方法。该方法通过量化输入与预测的差值来获得预测增益，从而扩大ADC的动态范围；通过差分量化值与预测值相加得到输出信号，并将该分别采用LMS和RLS算法进行处理．得到输入信号的预测值．计算机模拟结果证实，上述两种算法均能使模数转换器的动态范围提高约25dB．比较而言，RLS算法收敛速度更快，收敛性更好，但计算量较大．     

Regularization of Discrete Ill-Posed Problems

The paper concerns conditioning aspects of finite-dimensional problems arising when the Tikhonov regularization is applied to discrete ill-posed problems. A relation between the regularization parameter and the sensitivity of the regularized solution is investigated. The main conclusion is that the condition number can be decreased only to the square root of that for the nonregularized problem. The convergence of solutions of regularized discrete problems to the exact generalized solution is analyzed just in the case when the regularization corresponds to the minimal condition number. The convergence theorem is proved under the assumption of the suitable relation between the discretization level and the data error. As an example the method of truncated singular value decomposition with regularization is considered. This revised version was published online in July 2006 with corrections to the Cover Date.     

The semi‐iterative method applied to the hyper‐power iteration

The semi‐iterative method (SIM) is applied to the hyper‐power (HP) iteration, and necessary and sufficient conditions are given for the convergence of the semi‐iterative–hyper‐power (SIM–HP) iteration. The root convergence rate is computed for both the HP and SIM–HP methods, and the quotient convergence rate is given for the HP iteration. Copyright © 2005 John Wiley & Sons, Ltd.     

Analysis of a 2D “liquid”plasma lattice

Adustyplasmacanbedefinedasacomplicatedplasmacontainingsmallsolidmattercalleddustgrainsordustparticles,whichareusuallychargednegatively,duetoelectronshighermobilitythanion,bycollectingelectronsandionsfromthebackgroundplasma.Theuniverseisfilledwithdustyplasmassuchasplanetaryrings,comettails,andnebulae.Also,inindustrialplasmaprocessing,particulatessuspendedinplasmaarethemajorcontaminationinsemiconductormanufacture.Studiesondustyplasmahavebeenextendedtofar-flungtopicssuchaswaves,instabilities,stro…     

A Generalization of the Mean Size Formula of Wavelet Packets in Lp

The purpose of this paper is to investigate the mean size formula of wavelet packets in Lp for 0 〈 p ≤ ∞. We generalize a mean size formula of wavelet packets given in terms of the p-norm joint spectral radius and we also give some asymptotic formulas for the Lp-norm or quasi-norm on the subdivision trees. All results will be given in the general setting,     

相对论平均场理论中各种有效相互作用对中子星性质的影响

基于相对论平均场理论，研究了各种相互作用参数组(NL1、NL3、NLSH、TM1和GL-97)对中子星物质的性质和中子星整体结构的影响．发现参数组NL1、NL3和NLSH所给出的中子星内部的介子场强度、物质的组成比例、物态方程和中子星的整体特点基本相同，但与TM1和GL-97之间有较大的差别．相对于其他参数组，GL-97给出的介子场强度最弱，中子星的相对数密度最大，物态方程也最软，同时采用GL-97参数组计算的中子星的最大质量也最小．     

Local Feasible QP-Free Algorithms for the Constrained Minimization of SC1 Functions

We consider the problem of minimizing an SC¹ function subject to inequality constraints. We propose a local algorithm whose distinguishing features are that: (a) a fast convergence rate is achieved under reasonable assumptions that do not include strict complementarity at the solution; (b) the solution of only linear systems is required at each iteration; (c) all the points generated are feasible. After analyzing a basic Newton algorithm, we propose some variants aimed at reducing the computational costs and, in particular, we consider a quasi-Newton version of the algorithm.