一类非线性双曲型发展方程的孤子解

研究了一类非线性发展方程.首先在无扰动情形下,利用待定函数和泛函同伦映射方法得到了非扰动发展方程的孤子精确解和扰动方程的任意次近似行波孤子解.接着引入一个同伦映射,并选取初始近似函数,再用同伦映射理论,依次求出非线性双曲型发展扰动方程孤子解的各次近似解析解.再利用摄动理论举例说明了用该方法得到的近似解析解的有效性和各次近似解的近似度.最后,简述了用同伦映射方法得到的近似解的意义,指出了用上述方法得到的各次近似解具有便于求解、精度高等优点.     

同伦方法求解无界域上非凸规划问题的收敛性定理

利用同伦方法求解非凸规划时,一般只能得到问题的K-K-T点.本文得到无界域上同伦方法求解非凸规划的几个收敛性定理,证明在一定条件下,通过构造合适的同伦方程,同伦算法收敛到问题的局部最优解.     

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

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

求同伦映射的一个方法

利用待定连续函数的方法求出所需要的同伦映射 ,利用图形求出所需要的同伦映射 .介绍一种同伦映射的构造方法并给出具体表达式 .     

非线性Duffing扰动振子共振机制的研究

研究了一类广义Duffing扰动共振机制.利用泛函分析同伦映射方法,构造了求得问题渐近解的迭代关系式.首先求出了Duffing模型的初始近似函数;其次利用迭代关系依次求出了模型的各次渐近解;然后通过举例,说明了用泛函同伦映射方法得到的广义Duffing扰动振子随机共振机制的近似解简单而有效.讨论了得到的渐近解的意义.     

广义高维Klein-Gordon强迫扰动方程的孤子解

利用同伦映射方法研究了一类非线性广义强迫扰动Klein-Gordon方程.首先利用双曲正切待定系数法求得了无扰动项典型方程的孤子解.然后利用同伦映射原理得到了强迫扰动Klein-Gordon方程的任意次近似孤子解.最后叙述了得到的近似孤子解是一个解析展开式,还能对它进行解析运算.这对使用简单的模拟方法得到的近似解是达不到的.     

Diffeological空间范畴中光滑映射的分解

本文研究了diffeological空间范畴中光滑映射的分解问题.利用经典同伦论中映射分解的方法,获得了任何一个光滑映射都可以分解为一个光滑同伦等价和光滑纤维化或光滑上纤维化的复合的结果,推广了拓扑空间范畴中的相关结果.     

非线性互补问题的组合同伦算法

针对拟P_*-映射和P(τ,α,β)-映射所对应的非线性互补问题,本文对其解的存在性及有效求解算法进行了研究.文中利用组合同伦方法给出了这两类非线性互补问题存在有界解的构造性证明,并利用预估校正方法对同伦路径进行跟踪,得到了互补问题的解.通过数值算例验证了该算法的有效性.     

一类大气尘埃等离子体扩散模型研究

研究了一类大气非线性尘埃等离子体扩散方程初值问题.首先在无扰动情形下,利用Fourier变换方法得到了尘埃等离子体扩散方程初值问题的精确解,接着引入一个同伦映射,并选取初始近似函数,再用同伦映射理论,依次求出了非线性尘埃等离子体扰动初值问题的各次近似解析解.并引用不动点理论,指出了近似解析解的有效性和各次近似解的近似度,通过举例, 用模拟曲线和表格作了近似对照.最后,简述了用同伦映射方法得到的近似解的物理意义.简叙了用上述方法得到的各次近似解具有便于求解、精度高等优点.     

弱拟法锥条件下非凸优化问题的同伦算法

本文给出弱拟法锥条件的定义,并针对非线性组合同伦方程,得到在弱拟法锥条件下求解约束非凸优化问题的同伦内点算法.证明了该算法对于可行域的某个子集中几乎所有的点,同伦路径存在,并且同伦路径收敛于问题的K-K-T点,通过数值例子验证了该算法是有效的.     

A spline smoothing homotopy method for nonconvex nonlinear programming

Homotopy methods are globally convergent under weak conditions and robust; however, the efficiency of a homotopy method is closely related with the construction of the homotopy map and the path tracing algorithm. Different homotopies may behave very different in performance even though they are all theoretically convergent. In this paper, a spline smoothing homotopy method for nonconvex nonlinear programming is developed using cubic spline to smooth the max function of the constraints of nonlinear programming. Some properties of spline smoothing function are discussed and the global convergence of spline smoothing homotopy under the weak normal cone condition is proven. The spline smoothing technique uses a smooth constraint instead of m constraints and acts also as an active set technique. So the spline smoothing homotopy method is more efficient than previous homotopy methods like combined homotopy interior point method, aggregate constraint homotopy method and other probability one homotopy methods. Numerical tests with the comparisons to some other methods show that the new method is very efficient for nonlinear programming with large number of complicated constraints.     

Locale同伦理论

本文引入了locale连续映射同伦的概念,建立了locale同伦范畴,构造性地证明了任一locale连续映射都同伦等价于一个locale包含映射。通过引入locale H群的概念(它是locale群概念的自然推广),建立了locale同伦范畴到群同态范畴的一个反变函子。特别地,我们建立了locale同伦群范畴上的基本群函子,证明了locale L上以p为基点的基本群同构于L的谱空间pt(L)上以p为基点的基本群。因此,基本群函子是locale范畴中的一个同伦不变量。     

Homotopy method for solving ball-constrained variational inequalities

In this paper, we present a smoothing homotopy method for solving ball-constrained variational inequalities by utilizing a similar Chen-Harker-Kanzow-Smale function to smooth Robinson’s normal equation. Without any monotonicity condition on the defining map F, for the starting point chosen almost everywhere in Rⁿ, the existence and convergence of the homotopy pathway are proven. Numerical experiments illustrate that the method is feasible and effective.     

On the periodic points of functions on a manifold

In a conference on fixed point theory, B. Halpern of Indiana University considered the problem of reducing the number of periodic points of a map by homotopy. He also asked whether the number of periodic points of a function could be increased by a homotopy. In this paper, we will show that for any map on a closed manifold, an arbitrarily small perturbation can always create infinitely many periodic points of arbitrarily high periods.

     

A noninterior point homotopy method for semi-infinite programming problems

In this paper, we present a new homotopy method which is a non-interior point homotopy method for solving semi-infinite programming problems. Under suitable assumptions, we prove that the method determines a smooth path from a given point. The new homotopy method generalizes the existing combined homotopy interior point method for semi-infinite programming problems to unbounded set, moreover, it is more convenient in that it enlarges the choice scope of the initial point. Some numerical examples are given to show its efficiency.     

A constraint shifting homotopy method for general non-linear programming

In this article, a constraint shifting homotopy method (CSHM) is proposed for solving non-linear programming with both equality and inequality constraints. A new homotopy is constructed, and existence and global convergence of a homotopy path determined by it are proven. All problems that can be solved by the combined homotopy interior point method (CHIPM) can also be solved by the proposed method. In contrast to the combined homotopy infeasible interior point method (CHIIPM), it needs a weaker regularity condition. And the starting point in the proposed method is not necessarily a feasible point or an interior point, so it is more convenient to be implemented than CHIPM and CHIIPM. Numerical results show that the proposed algorithm is feasible and effective.     

Pseudo-harmonic maps from closed pseudo-Hermitian manifolds to Riemannian manifolds with nonpositive sectional curvature

In this paper, we use heat flow method to prove the existence of pseudo-harmonic maps from closed pseudo-Hermitian manifolds to Riemannian manifolds with nonpositive sectional curvature, which is a generalization of Eells–Sampson’s existence theorem. Furthermore, when the target manifold has negative sectional curvature, we analyze horizontal energy of geometric homotopy of two pseudo-harmonic maps and obtain that if the image of a pseudo-harmonic map is neither a point nor a closed geodesic, then it is the unique pseudo-harmonic map in the given homotopic class. This is a generalization of Hartman’s theorem.     

Solving the Karush–Kuhn–Tucker system of a nonconvex programming problem on an unbounded set

In the papers [G.C. Feng, B. Yu, Combined homotopy interior point method for nonlinear programming problems, in: H. Fujita, M. Yamaguti (Eds.), Advances in Numerical Mathematics; Proceedings of the Second Japan–China Seminar on Numerical Mathematics, in: Lecture Notes in Numerical and Applied Analysis, vol. 14, Kinokuniya, Tokyo, 1995, pp. 9–16; G.C. Feng, Z.H. Lin, B. Yu, Existence of an interior pathway to a Karush–Kuhn–Tucker point of a nonconvex programming problem, Nonlinear Analysis 32 (1998) 761–768; Z.H. Lin, B. Yu, G.C. Feng, A combined homotopy interior point method for convex programming problem, Applied Mathematics and Computation 84 (1997) 193–211], a combined homotopy interior method was presented and global convergence results obtained for nonconvex nonlinear programming when the feasible set is bounded and satisfies the so called normal cone condition. However, for when the feasible set is not bounded, no result has so far been obtained. In this paper, a combined homotopy interior method for nonconvex programming problems on the unbounded feasible set is considered. Under suitable additional assumptions, boundedness of the homotopy path, and hence global convergence, is proven.     

Fixed points and graph images for minimal maps on the once punctured torus

A fixed point detection theorem for a family of maps defined on the once punctured torus is proved. As a consequence, we produce an example of a homotopy class [f] of self-maps on the once punctured torus that illustrates the following: (i) there is a map in the homotopy class that has no fixed points, and (ii) if the image of f lies in a 1-complex that embeds as a homotopy equivalence, then f must have a fixed point.     

On the domain invariance of countably condensing vector fields

Using homotopy theory, we give the domain invariance theorem for countably condensing vector fields, where the notion of countably condensing maps is due to Väth. A starting point of this investigation is that there is a symmetric characteristic set for a countably condensing map.