KdV方程的时间谱离散方法

本文提出了解KdV方程周期边值问题的安全港离散方法:在时间方向上采用Chebyshev拟谱逼近,在空间方向上采用Fourier Galerkin逼近。谱展开的系数由目标泛函的极小值来确定。同时证明了该方法的收敛性。     

一类非线性Schrdinger方程的守恒差分法与Fourier谱方法

考察了一类带导数项的非线性Schrdinger方程的周期边值问题,提出了一种守恒的差分格式,在空间方向上采用Fourier谱方法,证明了格式的稳定性和收敛性.数值试验得到了与理论分析一致的结果.     

带白噪声的随机偏微分方程的Wiener混沌谱方法

采用谱方法计算一类带白噪声的随机非线性偏微分方程.对于随机变量采用Wiener展开方法;在空间方向上,对于Dirichlet边值问题使用Legendre-Chebyshev谱方法,对于周期边值问题使用Fourier拟谱方法;在时间方向上使用二阶差分方法.针对白噪声随机项,推导了Wiener展开的计算格式.数值试验计算了随机方程解的均值、方差及高阶矩,比较原有的几个相关方法,取得较好的结果,显示了该方法的有效性.     

一类非线性Schr(o)dinger方程的守恒差分法与Fourier谱方法

考察了一类带导数项的非线性Schrodinger方程的周期边值问题，提出了一种守恒的差分格式，在空间方向上采用Fourier谱方法，证明了格式的稳定性和收敛性．数值试验得到了与理论分析一致的结果．     

广义KdV方程Fourier谱逼近的最优误差估计

分析了一类带周期边界条件的广义KdV方程Fourier谱方法,得到了L2范数下最优误差估计,改进了由Maday和Quarteroni给出的结果.还提出了一种修改Fourier拟谱方法,并且证明它享有与Fourier谱方法同样的收敛性.     

三维热传导型半导体问题的交替方向特征有限元方法

提出交替方向特征有限元方法,对电场位势方程采用混合元格式,对电子,空穴浓度方程采用交替方向特征有限元格式,对温度方程提出交替方向格式.应用向量积计算及先验估计理论和技巧,得到最佳的L2误差估计.     

六边形Fourier谱方法

首先,建立了晶格Fourier分析的一般理论,并具体研究了六边形区域上周期函数的数值逼近.在此基础上,提出了六边形区域上的椭圆型偏微分方程的周期问题求解的六边形Fourier谱方法,设计了相应谱格式快速实现算法,建立了Fourier谱方法的稳定性与收敛性理论.同方形区域上的经典Fourier谱方法一样,六边形Fourier谱方法可以充分利用快速Fourier变换,并具备了"无穷阶"的谱收敛速度.     

应用广义Laguerre函数的Navier-Stokes方程外部问题混合谱方法

研究应用广义Laguerre函数的四阶非线性偏微分方程外部问题混合谱方法.构造了圆外Navier-Stokes方程流函数形式的混合谱方法,数值结果显示了该方法在空间方向的谱精度.     

输运方程谱间断流线扩散耦合方法

本文讨论了谱有限元方法,构造了求解Ｂｏｌｔｚｍ ａｎｎ 方程球谐函数谱展开和间断流线扩散有限元耦合格式．建立了这种耦合方法的稳定性及最优阶收敛性误差估计．得到了比标准有限元更高的精度．     

有限元方法形成三维Michell桁架

提出了形成三维Michell桁架的有限元方法．采用正交异性纤维增强复合材料模型模拟Michell桁架．纤维在节点处的密度和方向作为基本设计变量．根据有限元分析得到节点位置的应力和应变．采用迭代方法,将纤维方向调整到主应力方向;根据纤维方向的应变改变纤维密度. 仅需少量迭代即可得到满足Michell准则的应变场和类桁架连续体．最后根据节点处的纤维方向用连续线表示出Michell桁架．几个算例表明了算法的有效性和计算效率．     

On the Equivalence of the Simplex Methods and a Multiplier-Alike Method for Linear Programming

In linear programming, the simplex method has been viewed for a long time as an efficient tool. Interior methods have attracted a lot of attention since they were proposed recently. It seems plausible intuitively that there is no reason why a good linear programming algorithm should not be allowed to cross the boundary of the feasible region when necessary. However, such an algorithm is seldom studied. In this paper, we will develop first a framework of a multiplier-alike algorithm for linear programming which allows its trajectory to move across the boundary of the feasible region. Second, we illustrate that such a framework has the potential to perform as well as the simplex method by showing that these methods are equivalent in a well-defined sense, even though they look so different.     

On the Convergence of Descent Algorithms

It is proved that any cluster point of a sequence defined by a steepest descent algorithm in a general normed vector space is a critical point. The function is just assumed to be continuously differentiable. The class of algorithms we consider encompasses several choices such as the Cauchy steplength and the Curry steplength.     

The projection Kantorovich method for eigenvalue problems

A modified projection method for eigenvalues and eigenvectors of a compact operator T on a Banach space is defined and analyzed. The method is derived from the Kantorovich regularization for second-kind equations involving the operator T. It is shown that when T is a positive self-adjoint operator on a Hilbert space and the projections are orthogonal, the modified method always gives eigenvalue approximations which are at least as accurate as those obtained from the projection method. For self-adjoint operators, the required computation is essentially the same for both methods. Numerical computations for two integral operators are presented. One has T positive self-adjoint, while in the other T is not self-adjoint. In both cases the eigenvalue approximations from the modified method are more accurate than those from the projection method.     

对非线性方程近似解的认识和思考

二分法和牛顿法求非线性方程根的近似值已列入中学课程.但它背后的哲学原理(相对真理)/(绝对真理)=0.9,只在林群的新书中说到2^(1/2)时提出来.根据教学需要,通过(不足近似值)/(过剩近似值)=0.9等数值化的公式,来刻画根的近似过程.可以清楚地看到,随着小数点后9的个数的增加,近似解和真实解的误差在不断减小.因此0.9数值化系列公式也可以看做是误差估计的另一种表型形式.     

求解变系数非齐次亥姆霍茨方程的边界单元法

本文利用拉普拉斯方程的基本解作为权函数，给出求解交系数非齐次亥姆霍茨方程的迭代格式，进而得到求解这类方程的边界元迭代法．文中给出了算例．最后，把本文给出的边界元迭代法与作者早些时候提出的边界元耦合法进行了比较．     

Looking Ahead with the Pilot Method

The pilot method as a meta-heuristic is a tempered greedy method aimed at obtaining better solutions while avoiding the greedy trap by looking ahead for each possible choice. Repeatedly a master solution is modified; each time in a minimal fashion to account for best choices, where choices are judged by means of a separate heuristic result, the pilot solution. The pilot method may be seen as a meta-heuristic enhancing the quality of (any) heuristic in a system for heuristic repetition. Experiments show that the pilot method as well as similar methods can behave quite competitively in comparison with well-known and accepted meta-heuristics. In this paper we review some less known results. As a higher time complexity is usually associated with repetition, we investigate a simple short-cut policy to reduce the running times, while retaining an enhanced solution quality. Furthermore, we report successful experiments that incorporate a distinguishing feature of the pilot method, which is the extension of neighborhoods into “local” search, creating tabu search hybrids.     

域外奇源分布法场点解的唯一性

应用奇源解的核函数沿距离递减的条件和积分不等式,可证这类奇源在凸域外分布只要满足以它产生的响应来表达的边界条件时,所引起相应的域内场点解是唯一的。文中给出这类奇源的部分例子,如Kelvin的点力,点圆力偶(PRC)等。并给出PRC分布解回转体扭转问题的场点解的唯一性证明作为应用例。     

Meshless method with ridge basis functions

Meshless collocation methods for the numerical solutions of PDEs are increasingly adopted due to their advantages including efficiency and flexibility, and radial basis functions are popularly employed to represent the solutions of PDEs. Motivated by the advantages of ridge basis function representation of a given function, such as the connection to neural network, fast convergence as the number of terms is increased, better approximation effects and various applications in engineering problems, a meshless method is developed based on the collocation method and ridge basis function interpolation. This method is a truly meshless technique without mesh discretization: it neither needs the computation of integrals, nor requires a partition of the region and its boundary. Moreover, the method is applied to elliptic equations to examine its appropriateness, numerical results are compared to that obtained from other (meshless) methods, and influence factors of accuracy for numerical solutions are analyzed.     

Complexity of the Gravitational Method for Linear Programming

In the gravitational method for linear programming, a particle is dropped from an interior point of the polyhedron and is allowed to move under the influence of a gravitational field parallel to the objective function direction. Once the particle falls onto the boundary of the polyhedron, its subsequent motion is constrained to be on the surface of the polyhedron with the particle moving along the steepest-descent feasible direction at any instant. Since an optimal vertex minimizes the gravitational potential, computing the trajectory of the particle yields an optimal solution to the linear program.Since the particle is not constrained to move along the edges of the polyhedron, as the simplex method does, the gravitational method seemed to have the promise of being theoretically more efficient than the simplex method. In this paper, we first show that, if the particle has zero diameter, then the worst-case time complexity of the gravitational method is exponential in the size of the input linear program. As a simple corollary of the preceding result, it follows that, even when the particle has a fixed nonzero diameter, the gravitational method has exponential time complexity. The complexity of the version of the gravitational method in which the particle diameter decreases as the algorithm progresses remains an open question.     

Feasible Interior Methods Using Slacks for Nonlinear Optimization

A slack-based feasible interior point method is described which can be derived as a modification of infeasible methods. The modification is minor for most line search methods, but trust region methods require special attention. It is shown how the Cauchy point, which is often computed in trust region methods, must be modified so that the feasible method is effective for problems containing both equality and inequality constraints. The relationship between slack-based methods and traditional feasible methods is discussed. Numerical results using the KNITRO package show the relative performance of feasible versus infeasible interior point methods.