The Convergence and Stability of Splitting Finite-Difference Schemes for Nonlinear Evolutionary Equations

We consider a splitting finite-difference scheme for an initial-boundary value problem for a two-dimensional nonlinear evolutionary equation. The problem is split into nonlinear and linear parts. The linear part is also split into locally one-dimensional equations. We prove the convergence and stability of the scheme in L ₂ and C norms. Printed in Lietuvos Matematikos Rinkinys, Vol. 45, No. 3, pp. 413–434, July–September, 2005.     

164Lu的三轴超形变核态的研究

利用TRS方法对双奇核¹⁶⁴Lu的位能面进行了计算,确认了¹⁶⁴Lu核的一条三轴超形变带,结果与实验较好地符合,同时指出了三轴超形变带的一个具体的组态     

Wavelets and adaptive grids for the discontinuous Galerkin method

In this paper, space adaptivity is introduced to control the error in the numerical solution of hyperbolic systems of conservation laws. The reference numerical scheme is a new version of the discontinuous Galerkin method, which uses an implicit diffusive term in the direction of the streamlines, for stability purposes. The decision whether to refine or to unrefine the grid in a certain location is taken according to the magnitude of wavelet coefficients, which are indicators of local smoothness of the numerical solution. Numerical solutions of the nonlinear Euler equations illustrate the efficiency of the method.     

层次分析中广义最小偏差法的性质

广义最小偏差法（GLDM）是层次分析中一种重要的排序方法．本文讨论了广义最小偏差法的性质和灵敏度分析问题．     

映象方程多解问题的某些研究

本文用ｆｐ－同伦方法，在一定的技巧和变换的配合下，在紧性条件支持下，研究了赋范线性空间中一类集值映象方程的多解问题。还给出所得理论结果的一个应用。     

Efficient Sequential Quadratic Programming Implementations for Equality-Constrained Discrete-Time Optimal Control

Efficient sequential quadratic programming (SQP) implementations are presented for equality-constrained, discrete-time, optimal control problems. The algorithm developed calculates the search direction for the equality-based variant of SQP and is applicable to problems with either fixed or free final time. Problem solutions are obtained by solving iteratively a series of constrained quadratic programs. The number of mathematical operations required for each iteration is proportional to the number of discrete times N. This is contrasted by conventional methods in which this number is proportional to N ³. The algorithm results in quadratic convergence of the iterates under the same conditions as those for SQP and simplifies to an existing dynamic programming approach when there are no constraints and the final time is fixed. A simple test problem and two application problems are presented. The application examples include a satellite dynamics problem and a set of brachistochrone problems involving viscous friction.     

A Modified SQP Method and Its Global Convergence

The sequential quadratic programming method developed by Wilson, Han andPowell may fail if the quadratic programming subproblems become infeasibleor if the associated sequence of search directions is unbounded. In [1], Hanand Burke give a modification to this method wherein the QP subproblem isaltered in a way which guarantees that the associated constraint region isnonempty and for which a robust convergence theory is established. In thispaper, we give a modification to the QP subproblem and provide a modifiedSQP method. Under some conditions, we prove that the algorithm eitherterminates at a Kuhn–Tucker point within finite steps or generates aninfinite sequence whose every cluster is a Kuhn–Tucker point.Finally, we give some numerical examples.     

求解一类变形变分不等式的投影收缩算法及其性质

对一类变形的变分不等式：求，使得提出了一类投影收缩算法，并得到了该算法的收敛性及相关性质．     

弹性力学的Lagrange形式：用Routh方法建立弹性有限变形问题的基本方程

将弹性有限变形问题纳入Lagrange力学的理论体系中，并用经典力学中业已存在的Routh方法构建了有限变形平面应变问题和有限变形平面应力问题的基本微分方程，讨论了有限变形大挠度问题vonkarman方程中存在的矛盾进而提出了两种改进方案．