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.     

Bounds for the Least Laplacian Eigenvalue of a Signed Graph

A signed graph is a graph with a sign attached to each edge. This paper extends some fundamental concepts of the Laplacian matrices from graphs to signed graphs. In particular, the relationships between the least Laplacian eigenvalue and the unbalancedness of a signed graph are investigated.     

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

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

若干图的点强全染色(英文)

对图G及正整数k，映射f：满足：（1）任意e1，e3，如果e1，e2是相邻或相关联的，则有；（2）对u，v，w（G）有，则称f为G的一个k-点强全染色，并且K|G的社点强全染色称为G的点强全色数．本文讨论了一些特殊困的点强全色数，并提出了一个猜想：若G为每一分图的阶数不小于6的图，则（G），其中（G）为本文中定义的一新参数．     

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

广义最小偏差法（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.     

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

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