多维随机大与SNBU多维寿命分布类

本文从多维随机序──随机大入手，定义了多维寿命分布类ＳＮＢＵ，证明了该定义与文［１］中的定义等价，研究了其部分性质。     

Numerical integration of ordinary differential equations on manifolds

Summary This paper is concerned with the problem of developing numerical integration algorithms for differential equations that, when viewed as equations in some Euclidean space, naturally evolve on some embedded submanifold. It is desired to construct algorithms whose iterates also evolve on the same manifold. These algorithms can therefore be viewed as integrating ordinary differential equations on manifolds. The basic method “decouples” the computation of flows on the submanifold from the numerical integration process. It is shown that two classes of single-step and multistep algorithms can be posed and analyzed theoretically, using the concept of “freezing” the coefficients of differential operators obtained from the defining vector field. Explicit third-order algorithms are derived, with additional equations augmenting those of their classical counterparts, obtained from “obstructions” defined by nonvanishing Lie brackets.     

吴方法和带参数杨—Baxter方程的求解技术

回顾用吴文俊先生提出的消元方法求解带参数的杨—Ｂａｘｔｅｒ方程的技巧和主要结果。     

复数,实数及实对称数据下Bruun FFT算法的实现

本文在复数、实数以及实对称数据下研究和实现了Ｂｒｕｕｎ ＦＦＴ算法。文章分析和评价了各种数据下ＢｒｕｕｎＦＦＴ的运算量和特点，提出了算法的实现结构和方法。最后给了ＴＭＳ３２０Ｃ３０上的运算时间，我们实现的算法比基２ＦＦＴ速度提高３５％。     

城市土地规划的优化方法研究

以多目标决策理论、组合优化理论以及预测科学技术为依据 ,首先建立了土地功能配置模型 ,帮助规划师对各种不同功能土地的片面布置进行分析 ,从而找到最合理的城市土地布局 ;然后以遗传算法作为优化工具 ,对建立的模型进行了优化。     

Local and Parallel Finite Element Algorithms for Eigenvalue Problems

Abstract Some new local and parallel finite element algorithms are proposed and analyzed in this paper foreigenvalue problems.With these algorithms, the solution of an eigenvalue problem on a fine grid is reduced tothe solution of an eigenvalue problem on a relatively coarse grid together with solutions of some linear algebraicsystems on fine grid by using some local and parallel procedure.A theoretical tool for analyzing these algorithmsis some local error estimate that is also obtained in this paper for finite element approximations of eigenvectorson general shape-regular grids.     

Generalization of Murty's direct algorithm to linear and convex quadratic programming

Murty's algorithm for the linear complementarity problem is generalized to solve the optimality conditions for linear and convex quadratic programming problems with both equality and inequality constraints. An implementation is suggested which provides both efficiency and tight error control. Numerical experiments as well as field tests in various applications show favorable results.The author thanks K. G. Murty for his encouragement and helpful comments.     

Affine-scaling for linear programs with free variables

The affine-scaling modification of Karmarkar's algorithm is extended to solve problems with free variables. This extended primal algorithm is used to prove two important results. First the geometrically elegant feasibility algorithm proposed by Chandru and Kochar is the same algorithm as the one obtained by appending a single column of residuals to the constraint matrix. Second the dual algorithm as first described by Adler et al., is the same as the extended primal algorithm applied to the dual.     

Kalman filtering of a space-time Markov random field

In this paper, finite-dimensional recursive filters for space-time Markov random fields are derived. These filters can be used with the expectation maximization (EM) algorithm to yield maximum likelihood estimates of the parameters of the model.