非线性波方程的精确孤立波解

立了一种求解非线性波方程精确孤立波解的双曲函数方法,并在计算机代数系统上加以实现,推导出了一大批非线性波方程的精确孤立波解.方法的基本原理是利用非线性波方程孤立波解的局部性特点,将方程的孤立波解表示为双曲函数的多项式,从而将非线性波方程的求解问题转化为非线性代数方程组的求解问题.利用吴消元法或Gröbner基方法在计算机代数系统上求解非线性代数方程组, 最终获得非线性波方程的精确孤立波解,其中有很多新的精确孤立波解.     

一类具波动算子非线性Schr?dinger方程的精确解

研究一类具波动算子非线性Schr?dinger方程的精确解问题.引入Jacobi椭圆函数组合及双曲函数组合方法,将其应用于求解具有波动算子的非线性Schr?dinger方程中.通过简单代数运算,可以得到具有波动算子非线性Schr?dinger方程的许多新解,并在极限情况下,给出了该方程对应的双曲函数解.同时得出了双曲函数组合解是Jacobi椭圆函数组合解情况下的极限解的结论.该方法可以推广到更多非线性偏微分方程精确解求解问题.     

激光脉冲放大器增益通量耦合系统解

研究了一个激光脉冲放大器增益通量系统解的问题.首先讨论了较一般的系统, 然后引入一个同伦映射.再利用映射的性质, 引进一个人工参数, 将求解非线性问题转化为求解一系列线性问题.再逐次地求出对应的线性问题的解, 最后得到了原模型解的近似展开式.可以看出, 同伦映射方法是一个解析的方法.它是通过函数的解析运算并用初等函数来表达近似解,其不同于用离散数值运算的数值计算方法.因此通过同伦映射解, 还可以对它继续进行解析运算, 从而可以进行微分和积分等运算来得到与激光脉冲放大器增益通量相关的其他物理量的性态.     

研究迟滞微分系统稳定与控制的一种新方法

基于李雅普诺夫判定稳定性两种方法,用一种三角函数型辅助方程及其相关结论,研究了一种迟滞微分系统的求解、稳定与控制问题.步骤一、给出一种三角函数型辅助方程的精确解.步骤二、通过三角函数变换与三角函数型辅助方程,将一种迟滞微分系统的求解问题转化为非线性代数方程组的求解问题.步骤三、借助符号计算系统Mathematica求出代数方程组的解,并构造了一种迟滞微分系统的精确解.步骤四、通过分析研究精确解,获得了一种迟滞微分系统的稳定与控制相关的几种结论.     

制造商零售商系统在模糊需求环境下的订货决策研究

提出制造商零售商系统在模糊需求环境下订货量、批发价在合作与非合作情况下的最优解问题.引入采用LR型模糊数符号距离的求解的方法.提出LR型模糊数形式运算的计算方法,并指出在所论问题中LR型模糊数对形式运算的封闭性,提出最优解求解的步骤并编制计算机程序以用于实际计算.举出实例,得出最优订货量为634件的结论.     

NLS^＋方程的暗孤子解

求解NLS+方程暗孤子解的问题早已解决,但其求解过程需要对Jost解的解析性进行繁杂的理论分析.本文用一种简单的方法,把求解NLS+方程暗孤子解的问题归结为纯粹的代数运算.     

区间算法在吴消元法解代数方程组中的应用

吴消元法是求解多元代数方程组的一个重要方法.将区间运算应用于吴方法中,把求解一般代数方程组零点集的问题转化为求解区间代数方程组零点集的问题,从而有效地解决了一般浮点运算带来的算法不稳定问题,以及由于精确运算带来的巨大的多项式系数而使算法效率降低的问题.     

任意变系数微分方程的精确解析法

工程中的许多问题归结为求解任意变系数微分方程的解.本文首次提出精确解析法,用以求解任意变系数微分方程在任意边界条件下的解.文中还给出精确解析法的一般计算格式,得到了一致收敛于精确解及其任意阶导数的解析表达式,并给出收敛性证明.文末给出四个算例,均得到较好的结果,证明了本文理论的正确性.     

制造商在模糊需求环境下的定价决策研究

提出制造商在模糊需求环境下定价决策的最优解问题.引入采用LR型模糊数均值的求解的方法.提出LR型模糊数形式运算的计算方法,并指出在所论问题中LR型模糊数对形式运算的封闭性,提出最优解求解的步骤并编制计算机程序以用于实际计算.举出实例,得出最优价格为122元的结论.     

用改进的代数方法构造(2+1)维ZK-MEW方程的精确行波解

利用一种改进的统一代数方法将构造(2+1)维ZK-MEW((2+1)-dimensional Zakharov-Kuznetsov modified equal width)方程精确行波解的问题转化为求解一组非线性的代数方程组。再借助于符号计算系统Mathematica求解所得到的非线性代数方程组,最终获得了方程的多种形式的精确行波解。其中包括有理解,三角函数解,双曲函数解,双周期Jacobi椭圆函数解,双周期Weierstrass椭圆形式解等。并给出了部分解的图形。     

具有相型服务分布的排队系统的性能灵敏度分析

具有非线数服务分布的排队网络已被广泛应用于许多领域,如通讯网络和管理系统。本文借助于无穷小说矩阵摄动方法,研究了M/PH/1排队系统的稳态性能灵敏度分析问题,给出了性能灵敏度公式,并表明了稳态性能灵敏度很容易通过系统势能进行计算。同时,给出一种计算势能及性能导数的算法。这个算法可直接用于系统的控制与优化,因为它基于分析系统的一条单一样本轨道。最后提供一个数值例子来表明这个算法的应用。     

A Dynamical Systems Analysis of Semidefinite Programming with Application to Quadratic Optimization with Pure Quadratic Equality Constraints

This paper considers the problem of minimizing a quadratic cost subject to purely quadratic equality constraints. This problem is tackled by first relating it to a standard semidefinite programming problem. The approach taken leads to a dynamical systems analysis of semidefinite programming and the formulation of a gradient descent flow which can be used to solve semidefinite programming problems. Though the reformulation of the initial problem as a semidefinite pro- gramming problem does not in general lead directly to a solution of the original problem, the initial problem is solved by using a modified flow incorporating a penalty function. Accepted 10 March 1998     

压电材料空间轴对称问题的通解及其应用

本文根据横观各向同性压电材料空间轴对称问题场方程的结构特点，利用逐次引进势函数的方法，最后得到将位移分量和电势函数用满足特定偏微分方程的单一势函数表示的所谓通解，推导过程表明这种形式的通解是完备的，作为应用举例，文中用通解求解了压电材料半无限体表面受集中力的问题，得到位移、应力、电位移分量及电势函数的解析表达式，本文所提供的通解可作为分析含空腔、夹杂或币形裂纹等缺陷的压电材料的机－电耦合行为的工具，算例所得结果可直接用于求解压电体相互间或压电体与普通弹性体间的接触问题。     

Application of reproducing kernel method to third order three-point boundary value problems

This paper investigates the analytical approximate solutions of third order three-point boundary value problems using reproducing kernel method. The solution obtained by using the method takes the form of a convergent series with easily computable components. However, the reproducing kernel method can not be used directly to solve third order three-point boundary value problems, since there is no method of obtaining reproducing kernel satisfying three-point boundary conditions. This paper presents a method for solving reproducing kernel satisfying three-point boundary conditions so that reproducing kernel method can be used to solve third order three-point boundary value problems. Results of numerical examples demonstrate that the method is quite accurate and efficient for singular second order three-point boundary value problems.     

规范变换与有限维可积系统间的变换

本文表明，利用两个特征值问题的规范变换，不仅可以建立和它们相联系的势的约束之间以及相应的有限维Ｈａｍｉｌｔｏｎ系统间的变换关系式，而且可以由一个可积系统的对合守恒积分导出另一个系统的守恒积分     

On smooth reformulations and direct non-smooth computations for minimax problems

Minimax problems can be approached by reformulating them into smooth problems with constraints or by dealing with the non-smooth objective directly. We focus on verified enclosures of all globally optimal points of such problems. In smooth problems in branch and bound algorithms, interval Newton methods can be used to verify existence and uniqueness of solutions, to be used in eliminating regions containing such solutions, and point Newton methods can be used to obtain approximate solutions for good upper bounds on the global optimum. We analyze smooth reformulation approaches, show weaknesses in them, and compare reformulation to solving the non-smooth problem directly. In addition to analysis and illustrative problems, we exhibit the results of numerical computations on various test problems.     

TWO-GRID DISCRETIZATION SCHEMES OF THE NONCONFORMING FEM FOR EIGENVALUE PROBLEMS

This paper extends the two-grid discretization scheme of the conforming finite elements proposed by Xu and Zhou （Math. Comput., 70 （2001）, pp.17-25） to the nonconforming finite elements for eigenvalue problems. In particular, two two-grid discretization schemes based on Rayleigh quotient technique are proposed. By using these new schemes, the solution of an eigenvalue problem on a fine mesh is reduced to that on a much coarser mesh together with the solution of a linear algebraic system on the fine mesh. The resulting solution still maintains an asymptotically optimal accuracy. Comparing with the two-grid discretization scheme of the conforming finite elements, the main advantages of our new schemes are twofold when the mesh size is small enough. First, the lower bounds of the exact eigenvalues in our two-grid discretization schemes can be obtained. Second, the first eigenvalue given by the new schemes has much better accuracy than that obtained by solving the eigenvalue problems on the fine mesh directly.     

Convexification and Concavification for a General Class of Global Optimization Problems

A kind of general convexification and concavification methods is proposed for solving some classes of global optimization problems with certain monotone properties. It is shown that these minimization problems can be transformed into equivalent concave minimization problem or reverse convex programming problem or canonical D.C. programming problem by using the proposed convexification and concavification schemes. The existing algorithms then can be used to find the global solutions of the transformed problems.     

Neural Approach for Solving Several Types of Optimization Problems

Neural networks consist of highly interconnected and parallel nonlinear processing elements that are shown to be extremely effective in computation. This paper presents an architecture of recurrent neural net-works that can be used to solve several classes of optimization problems. More specifically, a modified Hopfield network is developed and its inter-nal parameters are computed explicitly using the valid-subspace technique. These parameters guarantee the convergence of the network to the equilibrium points, which represent a solution of the problem considered. The problems that can be treated by the proposed approach include combinatorial optimiza-tion problems, dynamic programming problems, and nonlinear optimization problems.Communicated by L. C. W. Dixon     

背包问题的两阶段动态规划算法

本文通过理论分析给出了背包问题的两阶段动态规划算法，用例题说明了其求解过程。在计算机上运用本文所述算法和背包问题的动态规划算法求解了大量例题。解题实践说明，对于大中型背包问题，两阶段动态规划算法由于只要求对少量变量进行排序而使解题时间大为缩短，是一种值得推荐的算法。