基于人工鱼群算法求任意函数的数值积分

将不等距离分割方法与人工鱼群算法相结合,提出一种基于人工鱼群算法求任意函数数值积分的方法,该方法除能计算通常意义下任意函数的定积分外,还能计算奇异函数积分、振荡函数积分以及原函数不易求得的被积函数的积分.最后给出几个数值积分算例,并与传统数值积分方法作了比较,仿真结果分析表明,该算法十分有效,能够快速有效地获得任意函数的数值积分值.     

Remarks on the generalized Newton method

We give some convergence results for the generalized Newton method for the computation of zeros of nondifferentiable functions which we proposed in an earlier work. Our results show that the generalized method can converge quadratically when used to compute the zeros of the sum of a differentiable function and the (multivalued) subgradient of a lower semicontinuous proper convex function. The method is therefore effective for variational inequalities and can be used to find the minimum of a function which is the sum of a twice-differentiable convex function and a lower semicontinuous proper convex function. A numerical example is given.     

A conjugate-direction method based on a nonquadratic model

A conjugate-gradient method for unconstrained optimization, which is based on a nonquadratic model, is proposed. The technique has the same properties as the Fletcher-Reeves algorithm when applied to a quadratic function. It is shown to be efficient when tried on general functions of different dimensionality.     

On certain optimization methods with finite-step inner algorithms for convex finite-dimensional problems with inequality constraints

Numerical methods are proposed for solving finite-dimensional convex problems with inequality constraints satisfying the Slater condition. A method based on solving the dual to the original regularized problem is proposed and justified for problems having a strictly uniformly convex sum of the objective function and the constraint functions. Conditions for the convergence of this method are derived, and convergence rate estimates are obtained for convergence with respect to the functional, convergence with respect to the argument to the set of optimizers, and convergence to the g-normal solution. For more general convex finite-dimensional minimization problems with inequality constraints, two methods with finite-step inner algorithms are proposed. The methods are based on the projected gradient and conditional gradient algorithms. The paper is focused on finite-dimensional problems obtained by approximating infinite-dimensional problems, in particular, optimal control problems for systems with lumped or distributed parameters.     

Convergence analysis of virtual element methods for semilinear parabolic problems on polygonal meshes

In this article, we discuss and analyze new conforming virtual element methods (VEMs) for the approximation of semilinear parabolic problems on convex polygonal meshes in two spatial dimension. The spatial discretization is based on polynomial and suitable nonpolynomial functions, and a Euler backward scheme is employed for time discretization. The discrete formulation of both the proposed schemes—semidiscrete and fully discrete (with time discretization) is discussed in detail, and the unique solvability of the resulted schemes is discussed. A priori error estimates for the proposed schemes (semidiscrete and fully discrete) in H¹‐ and L²‐norms are derived under the assumption that the source term f is Lipschitz continuous. Some numerical experiments are conducted to illustrate the performance of the proposed scheme and to confirm the theoretical convergence rates.     

一个新的无约束优化超记忆梯度算法

本文提出一种新的无约束优化超记忆梯度算法,算法利用当前点的负梯度和前一点的负梯度的线性组合为搜索方向,以精确线性搜索和Armijo搜索确定步长．在很弱的条件下证明了算法具有全局收敛性和线性收敛速度．因算法中避免了存贮和计算与目标函数相关的矩阵,故适于求解大型无约束优化问题．数值实验表明算法比一般的共轭梯度算法有效．     

Numerical methods for scattering problems from multi-layers with different periodicities

In this paper, we consider a numerical method to solve scattering problems with multi-periodic layers with different periodicities. The main tool applied in this paper is the Bloch transform. With this method, the problem is written into an equivalent coupled family of quasi-periodic problems. As the Bloch transform is only defined for one fixed period, the inhomogeneous layer with another period is simply treated as a non-periodic one. First, we approximate the refractive index by a periodic one where its period is an integer multiple of the fixed period, and it is decomposed by finite number of quasi-periodic functions. Then the coupled system is reduced into a simplified formulation. A convergent finite element method is proposed for the numerical solution, and the numerical method has been applied to several numerical experiments. At the end of this paper, relative errors of the numerical solutions will be shown to illustrate the convergence of the numerical algorithm.     

Optimal Cubature Formulae and Recovery of Fast-Oscillating Functions from an Interpolational Class

The method of limit functions is used to construct optimal-by-accuracy and optimal-by-order (with constant not exceeding two) cubature formulae for the integration of fast oscillatory functions given by their values at a finite number of fixed nodes in a square region. The construction is based on explicit forms of the majorant and minorant in the given interpolational class C _1,L,N ² and the solution of the problem of optimal-by-accuracy recovery of functions from this class. It is shown that an appropriate choice of the grid in this interpolational class leads to a substantial reduction in a priori information required for the application of the proposed approach.This revised version was published online in October 2005 with corrections to the Cover Date.     

一种新的大位移井钻柱几何非线性分析方法

提出了基于实测的井深及相应的井斜角和方位角来获得确保井内钻柱参考构形长度不变的井眼轴线插值方法．当以空间大位移井的井眼轴线为钻柱的参考构形时,钻柱内的初始内力可以由井眼轴线的曲率和挠率确定．利用基于在空间自然坐标系下的包含所有单元刚体位移和常应变模式的位移函数,严格地按虚功原理推出了具有初始曲率和挠率的钻柱单元内由初始内力所引起的等效节点力计算公式,为大位移井钻柱的几何非线性处理提供了理论依据．澄清了钻柱有限元分析中的若干基本概念．为随后进行的以井眼轴线为参考构形的小变形分析,计算钻柱的自重和基于自然坐标系下的线性刚度矩阵及一致载荷列阵提供了保证．     

A quadrature formula associated with a univariate spline quasi interpolant

We study a new simple quadrature rule based on integrating a C ¹ quadratic spline quasi-interpolant on a bounded interval. We give nodes and weights for uniform and non-uniform partitions. We also give error estimates for smooth functions and we show that our formula is a useful companion to Simpson’s rule. AMS subject classification (2000)  41A15, 65D07, 65D25, 65D32     

基于非线性尺度不变性的CCG法

１．引言 ＣＧ法对于变量个数很多的问题,是很有用的．１９７０年后它有了许多改进和发展,ＣＣＧ法以正定圆锥函数为基础［１］,它的一般方法是：设圆锥函数为 ２］其中： Ｖ＝ Ｖ（ｘ）＝１＋ ａＴｘ ≠ ０;, ｒ ∈Ｒ１为常量; ａ,ｇ ∈ Ｒｎ为常向量;ｘ ∈ Ｒｎ为变向量;Ａ∈Ｒｎ×ｎ为对称正定矩阵．算法［１］：预先给出初始近似点ｘ０∈ Ｒｎ及初始搜索方向 ｐ０;满足：其中“Ｉ”是单位矩阵, Ｖ０＝ Ｖ（ｘ０）＝ １＋ ａｔｘ０及记号“”是函数的梯度．迭代格式为： ｘｋ＋１＝ ｘｋ ＋λｋｐｋ,ｋ＝ ０,１,２,…（３…     

Properties of a family of merit functions and a merit function method for the NCP

A family of merit functions are proposed, which are the generalization of several existing merit functions. A number of favorable properties of the proposed merit functions are established. By using these properties, a merit function method for solving nonlinear complementarity problem is investigated, and the global convergence of the proposed algorithm is proved under some standard assumptions. Some preliminary numerical results are given.     

Some extensions of Rotfel’d theorem

We proved some inequalities for concave functions. Those inequalities complemented a theorem obtained by Lee. Finally, we partially solved an open problem proposed by Zhang P.     

一种求解救灾物资运输问题的改进解法

本文通过对B运输问题建立数学模型,提出了一种求解B运输问题的改进解法。改进解法首先通过最小元素法求出初始解,然后进行变量闭回路法调整,直到求出最优解,并给出了一个计算实例证明了解法的有效性。文章还对改进解法和另外两种现有的算法进行了综合的分析,由于改进解法计算过程中采用的变量闭回路法省略了求检验数的环节,使得新算法比两种现有的算法更简便。     

张力腿平台有限振幅运动的方程和数值解

论证了张力腿平台（TLP）在波浪作用下发生有限振幅运动时,所受惯性力、粘性力、浮力等载荷不仅与波浪场有关,还与瞬时响应有关,是响应的非线性函数;张力腿拉力也是各自由度位移的非线性函数．所以分析TLP受力时必须考虑平台的瞬时加速度、速度和位移,在瞬时位置建立运动方程．据此推导出TLP发生有限振幅运动时的外力计算公式,建立了TLP 6自由度有限振幅运动非线性控制方程．其中考虑了由6自由度有限位移引起的多种非线性因素,如各自由度之间的耦合、瞬时湿表面、瞬时位置等;还包括自由表面效应、粘性力等因素引起的非线性．用数值方法求解所得到的非线性运动方程．对典型平台ISSC TLP进行了数值分析,求得该平台在规则波作用下的6自由度运动响应．用退化到线性范围的解与已有解进行了对比,吻合良好．数值结果表明,综合考虑非线性因素后响应有明显改变．     

Continuation method for nonlinear complementarity problems via normal maps

In a recent paper by Chen and Mangasarian (C. Chen, O.L. Mangasarian, A class of smoothing functions for nonlinear and mixed complementarity problems, Computational Optimization and Applications 2 (1996), 97–138) a class of parametric smoothing functions has been proposed to approximate the plus function present in many optimization and complementarity related problems. This paper uses these smoothing functions to approximate the normal map formulation of nonlinear complementarity problems (NCP). Properties of the smoothing function are investigated based on the density functions that defines the smooth approximations. A continuation method is then proposed to solve the NCPs arising from the approximations. Sufficient conditions are provided to guarantee the boundedness of the solution trajectory. Furthermore, the structure of the subproblems arising in the proposed continuation method is analyzed for different choices of smoothing functions. Computational results of the continuation method are reported.     

Calculation of solutions to the Mathieu equation and of related quantities

For the Mathieu equation, we consider finding eigenvalues with a given index (on the basis of oscillation theorems for the relevant difference equations), the stability of solutions to the difference equations, correct definition and calculation of eigenvalues and Mathieu functions with noninteger numbers, correct definition and calculation of the Mathieu characteristic exponent, and the calculation of values of solutions to the Mathieu equation for large arguments. Numerical algorithms are proposed for the problems listed above.     

Numerical differentiation by radial basis functions approximation

Based on radial basis functions approximation, we develop in this paper a new com-putational algorithm for numerical differentiation. Under an a priori and an a posteriori choice rules for the regularization parameter, we also give a proof on the convergence error estimate in reconstructing the unknown partial derivatives from scattered noisy data in multi-dimension. Numerical examples verify that the proposed regularization strategy with the a posteriori choice rule is effective and stable to solve the numerical differential problem. *The work described in this paper was partially supported by a grant from CityU (Project No. 7001646) and partially supported by the National Natural Science Foundation of China (No. 10571079).     

Highly accurate calculation of angular spheroidal functions

A new method for calculating the angular spheroidal functions of the first kind is proposed. The method is partly based on the known representations of these functions; however, some additional structures proposed in this work ensure efficient highly accurate calculation function values at a given point for a wide range of parameters.     

Computing Stability of Differential Equations with Bounded Distributed Delays

This paper deals with the stability analysis of scalar delay integro-differential equations (DIDEs). We propose a numerical scheme for computing the stability determining characteristic roots of DIDEs which involves a linear multistep method as time integration scheme and a quadrature method based on Lagrange interpolation and a Gauss–Legendre quadrature rule. We investigate to which extent the proposed scheme preserves the stability properties of the original equation. We derive and prove a sufficient condition for (asymptotic) stability of a DIDE (with a constant kernel) which we call RHP-stability. Conditions are obtained under which the proposed scheme preserves RHP-stability. We compare the obtained results with corresponding ones using Newton–Cotes formulas. Results of numerical experiments on computing the stability of DIDEs with constant and nonconstant kernel functions are presented.