Douglas方程的解的算子矩阵表示

研究了Douglas方程解的几何结构,利用算子分块的方法,得到了Douglas方程的约化解和自伴解的算子矩阵表示,并对Arias,Corach及Gonzalez等人的部分结果给出了不同的证明.结果表明,在相应的空间分解下,算子方程BX=C关于子空间M的约化解XM和自伴解X的算子矩阵形式分别为XM=BM-1C1100 0,X=B1-1C1B1-1C2(B1-1C2)*X4,而且方程的正解存在的一个充分必要条件是BB′C=C,BC*∈B(K)自伴,B1-1C1是正算子,R(B1-1C2)R((B1-1C1)12).

对称理论在解若干非线性问题中的应用

将摄动理论和对称约化理论结合起来对研究扰动非线性方程具有重要的意义.本文利用近似对称约化理论研究了扰动mKdV方程,得到了该方程的各阶近似约化方程和级数约化解.本文还讨论了同伦近似对称方法在求解不可积系统中的应用以及利用对称和守恒律的关系求解非线性系统的无穷多守恒律等问题.

A Class of Strongly Nonlinear Singular Perturbed Boundary Value Problems

In this paper, a class of strongly nonlinear singular perturbed boundary value problems are coasidered by the theory of differential inequalities and the correction of boundary layer, under which the existence of solution is proved and the uniformly valid asymptotic expansions is obtained as well.

Existence of multi-bump solutions for coupled Schr dinger systems

The Schrodinger equation -△u＋λ2u=｜u｜2q-2u has a unique positive radial solution Uλ, which decays exponentially at infinity. Hence it is reasonable that the Schrolinger system -△u1＋u1=｜u1｜2q-1u1-εb（x）｜u2｜1｜u1｜q-1u1,-△u2＋u2=｜u2｜2q-2u2-εb（x）｜u1｜1｜u2｜q-1u2 has multiple-bump solutions which behave like Uλ in the neighborhood of some points. For u=（u1,u2）∈H1（R3）×H1（R3）, a nonlinear functional Iε（u）=I1（u1）＋I2（u2）-ε/q∫R3b（x）｜u1｜q｜u2｜qdx,is defined,where I1（u1）=1/2｜｜u1｜｜2-1/2q∫R3｜u1｜2qdx and I2（u2）=1/2｜｜u2｜｜2ω-1/2q∫R3｜u2｜2qdx. It is proved that the solutions of the system are the critical points of I,. Let Z be the smooth solution manifold of the unperturbed problem and TzZ is the tangent space. The critical point of I is rewritten as the form of z ＋ w, where w ∈ （TzZ）⊥. Using some properties of Iε, it is proved that there exists a critical point of I, close to the form which is a multi-bump solution.

Cooperative task allocation for heterogeneous multi-UAV using multi-objective optimization algorithm

The application of multiple UAVs in complicated tasks has been widely explored in recent years.Due to the advantages of flexibility,cheapness and consistence,the performance of heterogeneous multi-UAVs with proper cooperative task allocation is superior to over the single UAV.Accordingly,several constraints should be satisfied to realize the efficient cooperation,such as special time-window,variant equipment,specified execution sequence.Hence,a proper task allocation in UAVs is the crucial point for the final success.The task allocation problem of the heterogeneous UAVs can be formulated as a multi-objective optimization problem coupled with the UAV dynamics.To this end,a multi-layer encoding strategy and a constraint scheduling method are designed to handle the critical logical and physical constraints.In addition,four optimization objectives:completion time,target reward,UAV damage,and total range,are introduced to evaluate various allocation plans.Subsequently,to efficiently solve the multi-objective optimization problem,an improved multi-objective quantum-behaved particle swarm optimization(IMOQPSO)algorithm is proposed.During this algorithm,a modified solution evaluation method is designed to guide algorithmic evolution;both the convergence and distribution of particles are considered comprehensively;and boundary solutions which may produce some special allocation plans are preserved.Moreover,adaptive parameter control and mixed update mechanism are also introduced in this algorithm.Finally,both the proposed model and algorithm are verified by simulation experiments.

Symmetry Reductions and Exact Solutions of Blaszak-Marciniak Four-Field Lattice Equation

Applying the Lie group method to the differential-difference equation, the Lie point symmetry of Blaszak- Marciniak four-field Lattice equation is obtained. Using the obtained symmetry, the similarity reduction equations of Blaszak-Marciniak four-field Lattice equation are derived. Solving the reduction, we get the solution of Blaszak-Marciniak four-field Lattice equation which not only recovers one of the solutions obtained by Ma and Hu [J. Math. Phys. 40 （1999） 6071] but also has the singularity when we choose the arbitrary constants accurately.

Similarity Reductions and Exact Solutions of a Coupled Korteweg de Vries System

For a special coupled Korteweg de Vries （KdV） system, its similarity solutions and reduction equations are obtained by the Clarkson and Kruskal＇s direct method. In addition, its new explicit soliton solutions and traveling wave solutions are found by the deformation and mapping method.

Nonequivalent Similarity Reductions and Exact Solutions for Coupled Burgers-Type Equations

Using the machinery of Lie group analysis,the nonlinear system of coupled Burgers-type equations is studied.Using the infinitesimal generators in the optimal system of subalgebra of the said Lie algebras,it leads to two nonequivalent similarity transformations by using it we obtain two reductions in the form of system of nonlinear ordinary differential equations.The search for solutions of these systems by using the G'/G-method has yielded certain exact solutions expressed by rational functions,hyperbolic functions,and trigonometric functions.Some figures are given to show the properties of the solutions.

An Optimized Constraint Decomposition Method in Concurrent Engineering

In order to facilitate solution, a complex problem is normally decomposed into many small sub-problems during product development process. Teams are formed to resolve each sub-problem. The original problem is resolved from solutions of sub-problems. Ideally, sub-problems are not only mutually independent but also inherent parameters of original problem. Solution of original problem can be directly derived from the collection of solutions from simplified sub-problems. In practice, the degree of interdependency is indeed reduced, sub-problems are neither totally independent nor all inherent parameters of original problem. This paper discusses team coordination under this condition and design solution from each team, which not only satisfies total requirements but also is an optimal one. The suggested optimized constraint decomposition method will insure workable Pareto solution.

Approximate Homotopy Symmetry Reduction Method:Infinite Series Reductions to Kawahara Equation

The Kawahara equation is studied through the approximate homotopy symmetry method. Under this method we get the similarity reduction solutions of the Kawahara equation, leading to the corresponding homotopy series solutions. Furthermore, the similarity solutions of the corresponding reduced linear ordinary differential equations are also considered.

Strategy of changing cracking furnace feedstock based on improved group search optimization

The scheduling process of cracking furnace feedstock is important in an ethylene plant. In this paper it is described as a constraint optimization problem. The constraints consist of the cycle of operation, maximum tube metal temperature, process time of each feedstock, and flow rate. A modified group search optimizer is proposed to deal with the optimization problem. Double fitness values are defined for every group. First, the factor of penalty function should be changed adaptively by the ratio of feasible and general solutions. Second, the "excellent" infeasible solution should be retained to guide the search. Some benchmark functions are used to evaluate the new algorithm. Finally, the proposed algorithm is used to optimize the scheduling process of cracking furnace feedstock. And the optimizing result is obtained.

On ε-Constraint Based Methods for the Generation of Pareto Frontiers

Over the years, a number of methods have been proposed for the generation of uniform and globally optimal Pareto frontiers in multi-objective optimization problems. This has been the case irrespective of the problem definition. The most commonly applied methods are the normal constraint method and the normal boundary intersection method. The former suffers from the deficiency of an uneven Pareto set distribution in the case of vertical （or horizontal） sections in the Pareto frontier, whereas the latter suffers from a sparsely populated Pareto frontier when the optimization problem is numerically demanding （ill-conditioned）. The method proposed in this paper, coupled with a simple Pareto filter, addresses these two deficiencies to generate a uniform, globally optimal, well-populated Pareto frontier for any feasible bi-objective optimization problem. A number of examples are provided to demonstrate the performance of the algorithm.

V-E传能中原子荧光辐射束缚的理论处理

Ｖ－Ｅ传能中原子荧光辐射束缚的理论处理＠王储记＠王坚＠马兴孝￥中国科学技术大学化学物理系ＶＥ传能中原子荧光辐射束缚的理论处理王储记王坚马兴孝（中国科学技术大学化学物理系，合肥２３００２６）（１９９６年７月１２日收到；１９９７年１０月２７日收到修改稿）...

A Dwindling Filter Line Search Algorithm for Nonlinear Equality Constrained Optimization

This paper proposes a dwindling filter line search algorithm for nonlinear equality constrained optimization. A dwindling filter, which is a modification of the traditional filter, is employed in the algorithm. The envelope of the dwindling filter becomes thinner and thinner as the step size approaches zero. This new algorithm has more flexibility for the acceptance of the trial step and requires less computational costs compared with traditional filter algorithm. The global and local convergence of the proposed algorithm are given under some reasonable conditions. The numerical experiments are reported to show the effectiveness of the dwindling filter algorithm.