The Dual Functionals for the Generalized Ball Basis of Wang-Said Type and Basis Transformation Formulas

The generalized Ball curves of Wang-Said type with a position parameter L not only unify the Wang-Ball curves and the Said-Ball curves, but also include several useful intermediate curves. This paper presents the dual functionals for the generalized Ball basis of Wang-Said type. The relevant basis transformation formulae are also worked out.     

A DERIVATIVE-FREE ALGORITHM FOR UNCONSTRAINED OPTIMIZATION

In this paper a hybrid algorithm which combines the pattern search method and the genetic algorithm for unconstrained optimization is presented. The algorithm is a deterministic pattern search algorithm,but in the search step of pattern search algorithm,the trial points are produced by a way like the genetic algorithm. At each iterate, by reduplication,crossover and mutation, a finite set of points can be used. In theory,the algorithm is globally convergent. The most stir is the numerical results showing that it can find the global minimizer for some problems ,which other pattern search algorithms don＇t bear.     

二维变系数扩散方程交替分组显格式的稳定性分析

1.引言 由于高性能并行计算机的出现和并行计算的推动,十多年来,抛物型方程有限差分并行算法设计与分析一直受到关注. D.J.Evalns和A.R.B.Abdullah(1983,[1,2]利用Saul’yev非对称格式对常系数抛物方程设计了AGE(交替分组显格式)算法,并用矩阵分析的方法证明了该算法的无条件稳定性.该算法有明显的并行性,倍受推崇,且计算的实践([8],[9])表明它对变系数的抛物方程也是可行的,但稳定性的分析成为一个难点.张宝琳([3])在一维情     

对偶算法的进一步研究

The dual algorithm for minimax problems is further studied in this paper. The resulting theoretical analysis shows that the condition number of the corresponding Hessian of the smooth modified Lagrange function with changing parameter in the dual algorithm is proportional to the reciprocal of the parameter,which is very important for the efficiency of the dual algorithm. At last ,the numerical experiments are reported to validate the analysis results.     

T—S模糊控制器中各类算子对系统输出的影响

模糊控制系统的核心是模糊控制算法，对Takagi-Sugeno（以下简称T—S）模糊控制器，由于其合取算子与汇总算子选取的不同，使其算法区别很大。文中对几种常用T-S模糊控制算法的输出曲面及误差曲面进行比较，以确定这些算子变化对系统输出的影响。     

剖面隐马氏模型训练算法的改进

利用剖面隐马氏模型获得多序列联配，一般需要经过初始化、训练、联配三个过程．然而，目前广泛采用的Baum—welch训练算法假设各条可观察序列互相独立，这与实际情况有所不符．本文对剖面隐马氏模型，给出可观察序列在互相不独立情况下的改进Baum—wlelch算法，在可观察序列两种特殊情况下（互相独立和一致依赖），得到了改进算法的具体表达式，讨论了一般情况下权重的选取方法．最后通过一个具体的蛋白质家族的多序列联配来说明改进算法的效果．     

大型稀疏无约束最优化的列分划校正Cholesky因子算法

我们考虑求解无约束优化问题1引言(?)f(x),(1)其中f：D(?)R~n→R为R~n上的二次连续可微函数,且f(x)的二阶Hesse阵H(x)稀疏、正定．为了求解问题(1),我们考虑下列Newton型方法x~(k 1)=x~k-(B~k)~(-1)▽f(x~k),k=0,1,…,(2)其中B~k是和Hesse阵H(x~k)具有相同稀疏性的近似．由于Hesse阵对称,我们假定B~k对称．为了具体说明给定矩阵B的稀疏性,我们使用M来定义指标对(i,j)的集合,其     

线性规划的约束条件“滚雪球”算法

为使线性规划的每个约束条件部分或全部地拥有原整个约束条件所包含的信息,将线性规划的约束条件“滚雪球”后得到与原约束条件等价的新约束条件,对新约束条件所构成的线性规划采用目标函数最速递减算法.有一定规模的随机数值算例显示了该算法只需进行m(约束条件数)次迭代即可求得最优解.     

A NEW ALGORITHM OF RELAXATION METHOD FOR PARTICLE ANALYSIS FROM FORWARD SCATTERED LIGHT

1. Introduction In many cases, particle dimension and size distribution play an important role in application. The analysis of parti- cle size is therefore necessary for research and develop- ment and also for process quality control in powder tech- nology and for many particle systems (Wang et al., 2000). Many instruments have been developed and constructed for this purpose. With the rapid development and availabil- ity of laser techniques, optoelectronics and microcomputer science, light sc…     

货郎担问题的对角线生成和2—最优改进回路解法

第Ⅰ部分以十个城市的货郎担题为例,提出了一个快速求得较好的初始可行解的启发式方法——对角线生成法。该方法可以与解货郎担题的任何一种改进回路的方法结合使用。从而求得货郎担题的最优或接近最优的解。第Ⅱ部分将以上的方法与2-最优改进回路的方法相结合,计算了十个文献中报导的货郎担题,其规模从十个城市到318个城市。计算结果表明该方法相对于别的方法而言,其主要优点是:它的计算时间随着城市个数的增加而增加的速度较慢,因而适用于解几百个城市的大规模的货郎担题。结论本文所介绍的方法是一种解货郎担题,尤其是大规模货郎担题的快速而有效的计算机算法。