牛顿弦截法预估校正迭代格式的收敛阶

研究如下形式的牛顿弦截法的预估校正(P.C.)格式:P(预估):~xk+1=xk-(xk-xk-1)f(xk)f(xk)-f(xk-1)C(校正):xk+1=xk-(~xk+1-xk)f(xk)f~(xk+1)-f(xk)证明了它的收敛阶为2.618.     

On the excitation of a closely spaced array by a line source

An infinite row of periodically spaced, identical rigid circularcylinders is excited by an acoustic line source which is parallelto the generators of the cylinders. A method for calculatingthe scattered field accurately and efficiently is presented.When the cylinders are sufficiently close together, Rayleigh–Blochsurface waves that propagate energy to infinity along the arrayare excited. An expression is derived which enables the amplitudesof these surface waves to be computed without requiring thesolution to the full scattering problem.     

Asymptotic Behavior on a Competition Model Arising from an Unstirred Chemostat

This paper is concerned with the unstirred chemostat model with two-species and one non-reproducingresource.The global attractivity of the positive steady-state solutions of the original system is established.Moreover,the effects of the growth rate on the unique positive equilibrium of the single population model arestudied.     

条形装箱问题的优化模型和增广Lagrange算法

This paper formulates a two-dimensional strip packing problem as a non-linear programming(NLP)problem and establishes the first-order optimality con-ditions for the NLP problem.A numerical algorithm for solving this NLP problemis given to find exact solutions to strip-packing problems involving up to 10 items.Approximate solutions can be found for big-sized problems by decomposing the setof items into small-sized blocks of which each block adopts the proposed numericalalgorithm.Numerical results show that the approximate solutions to big-sized prob-lems obtained by this method are superior to those by NFDH,FFDH and BFDHapproaches.     

A TVD Type Wavelet-Galerkin Method for Hamilton-Jacobi Equations

In this paper,we use Daubechies scaling functions as test functions for the Galerkin method,and discuss Wavelet-Galerkin solutions for the Hamilton-Jacobi equations.It can be proved that the schemesare TVD schemes.Numerical tests indicate that the schemes are suitable for the Hamilton-Jacobi equations.Furthermore,they have high-order accuracy in smooth regions and good resolution of singularities.     

Comparison of the boundary theory with the contact rule of phase regions and Gupta’s method

The phase boundary theory and the contact rule of phase regions are compared, and some weaknesses of the latter are manifested. The comparison between the Gupta’s method and the boundary theory method for constructing multicomponent isobaric sections is also presented.     

用三个关系式与Mathematica软件求第二类自然数幂和公式

首先介绍三个第二类自然数幂和关系式并对其中的两式给出证明,接着利用这些关系式与数学软件M athem atica4.0,给出求解第二类自然数幂和公式的若干机械计算方法.     

An implicit method for linear ill‐posed problems with perturbed operators

An implicit iterative method is applied to solving linear ill‐posed problems with perturbed operators. It is proved that the optimal convergence rate can be obtained after choosing suitable number of iterations. A generalized Morozov's discrepancy principle is proposed for the problems, and then the optimal convergence rate can also be obtained by an a posteriori strategy. The convergence results show that the algorithm is a robust regularization method. Copyright © 2006 John Wiley & Sons, Ltd.     

Stratifiable Families of Extremals and Sufficient Conditions for Optimality in Optimal Control Problems

It is shown that, if a parametrized fämily of extremals F can be stratified in a way compatible with the flow map generated by F, then those trajectories of the family which realize the minimal values of the cost in F are indeed optimal in comparison with all trajectories which lie in the region R covered by the trajectories of F. It is not assumed that F is a field covering the state space injectively. As illustration, an optimal synthesis is constructed for a system where the flow of extremals exhibits a simple cusp singularity.     

D-N交替法与Schwartz交替法的收敛关系分析

This paper has demonstrated that the Schwartz alternating process must converge if D-N alternating process has converged. Its technique is that the overlapping regions in Schwartz alternating process are considered as independent domains, then Schwartz alternating process could be transformed into D-N alter-nating process. Finally the convergence estimation of Schwartz alternating process could be obtained. The results show that its convergence rate is same as that of D-N alternating process.