T-单调映射及其性质

T-单调映射在变分不等式及非线性互补问题中经常遇到.此映射对应的非线性问题的解具有一些非常好的性质.这些性质在解的存在性证明,数值算法的构造及其收敛性分析中占有重要地位.本文系统讨论T-单调映射的性质,建立T-单调映射与常见的一些映射,如单调映射和Z-映射之间的联系.     

一类非线性强阻尼扰动发展方程的解

研究了在数学、力学中广泛出现的一类三阶非线性强阻尼发展扰动偏微分方程,并求其近似解析解.首先,构造一个泛函同伦映射,将方程的解表示以人工参数的幂级数形式,代入同伦映射,得到一个非线性扰动方程解的逐次迭代关系式,并考虑对应的一个无扰动项情形下的强阻尼发展方程,利用Fourier变换理论,求出其精确解.其次,以得到的精确解为同伦映射迭代式的初始函数,通过非线性扰动方程解的迭代关系式,再用Fourier变换法求解对应的方程.最后,便依次地得到了非线性强阻尼发展扰动偏微分方程的各次近似解析解.用上述方法得到的各次近似解,具有便于求解、精度高等特点.     

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

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

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

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

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

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

非线性参数规划问题ε-最优解集集值映射的连续性

对非线性参数规划问题ε-最优解集集值映射的连续性条件进行了研究.首先在可行集集值映射局部有界且正则的条件下,讨论了非线性参数规划问题最优值函数的连续性,然后针对ε-最优解集集值映射的结构特征并利用此结果和集值分析理论,给出了非线性参数规划问题ε-最优解集集值映射连续的一个充分条件.     

非自治时滞微分方程正周期解的存在性

应用Krasnoselskii锥映射不动点定理，研究了具一般时滞非线性非自治Logistic方程的ω-周期解的存在性，获得了存在正周期解的充分条件．     

拓扑空间上的不动点和具有上下界的广义平衡问题

引进了弱Φ-映射的定义并得到了具有ω-连通结构但没有紧致结构的拓扑空间上定义的弱Φ-映射的不动点定理.作为上述结果的应用,在非紧致的拓扑空间上讨论了若干的具有上下界的广义平衡问题的解的存在性问题.     

基于新光滑函数的P0映射非线性互补问题的光滑牛顿法(英文)

非线性互补问题(NCP)可以重新表述为一个非光滑方程组的解.通过引入一个新的光滑函数,将问题近似为参数化光滑方程组.基于这个光滑函数,我们提出了一个求解P₀映射和R₀映射非线性互补问题的光滑牛顿法.该算法每次迭代只求解一个线性方程和一次线搜索.在适当的条件下,证明了该方法是全局和局部二次收敛的.数值结果表明,该算法是有效的.     

非线性映射在有界区域内零点数目的若干结果

本文利用连续同伦方法讨论非线性映射在有界区域内零点的存在性和零点数目,以及推广若干经典定理。     

Solving generalized equations via homotopies

Global Newton methods for computing solutions of nonlinear systems of equations have recently received a great deal of attention. By using the theory of generalized equations, a homotopy method is proposed to solve problems arising in complementarity and mathematical programming, as well as in variational inequalities. We introduce the concepts of generalized homotopies and regular values, characterize the solution sets of such generalized homotopies and prove, under boundary conditions similar to Smale’s [10], the existence of a homotopy path which contains an odd number of solutions to the problem. We related our homotopy path to the Newton method for generalized equations developed by Josephy [3]. An interpretation of our results for the nonlinear programming problem will be given.     

Computational experience with the Chow—Yorke algorithm

The Chow—Yorke algorithm is a nonsimplicial homotopy type method for computing Brouwer fixed points that is globally convergent. It is efficient and accurate for fixed point problems. L.T. Watson, T.Y. Li, and C.Y. Wang have adapted the method for zero finding problems, the nonlinear complementarity problem, and nonlinear two-point boundary value problems. Here theoretical justification is given for applying the method to some mathematical programming problems, and computational results are presented.This work was partially supported by NSF Grant MCS 7821337.     

Probability-one homotopy maps for mixed complementarity problems

Probability-one homotopy algorithms have strong convergence characteristics under mild assumptions. Such algorithms for mixed complementarity problems (MCPs) have potentially wide impact because MCPs are pervasive in science and engineering. A probability-one homotopy algorithm for MCPs was developed earlier by Billups and Watson based on the default homotopy mapping. This algorithm had guaranteed global convergence under some mild conditions, and was able to solve most of the MCPs from the MCPLIB test library. This paper extends that work by presenting some other homotopy mappings, enabling the solution of all the remaining problems from MCPLIB. The homotopy maps employed are the Newton homotopy and homotopy parameter embeddings.     

Optimal design by a homotopy method

An optimal design problem is formulated as a system of nonlinear equations rather than the extremum of a functional. Based on a new homotopy method, an algorithm is developed for solving the nonlinear system which is globally convergent with probability one. Since no convexity is required, the nonlinear system may have more than one solution. The algorithm will produce an optimal design solution for a given starting point. For most engineering problems, the initial prototype design is already well conceived and close to the global optimal solution. Such a starting point usually leads to the optimal design by the homotopy method, even though Newton's method may diverge from that starting point. A simple example is given.     

A NUMERICAL EMBEDDING METHOD FOR SOLVING THE NONLINEAR COMPLEMENTARITY PROBLEM(I) ——THEORY

AbstractIn this paper, we extend the numerical embedding method for solving the smooth equations to the nonlinear complementarity problem. By using the nonsmooth theory, we prove the existence and the continuation of the following path for the corresponding homotopy equations. Therefore the basic theory of the numerical embedding method for solving the nonlinear complementarity problem is established. In part II of this paper, we will further study the implementation of the method and give some numerical exapmles.     

Interior-point methods for nonlinear complementarity problems

We present a potential reduction interior-point algorithm for monotone nonlinear complementarity problems. At each iteration, one has to compute an approximate solution of a nonlinear system such that a certain accuracy requirement is satisfied. For problems satisfying a scaled Lipschitz condition, this requirement is satisfied by the approximate solution obtained by applying one Newton step to that nonlinear system. We discuss the global and local convergence rates of the algorithm, convergence toward a maximal complementarity solution, a criterion for switching from the interior-point algorithm to a pure Newton method, and the complexity of the resulting hybrid algorithm.This research was supported in part by NSF Grant DDM-89-22636.The authors would like to thank Rongqin Sheng and three anonymous referees for their comments leading to a better presentation of the results.     

Solution Sets of Quadratic Complementarity Problems

In this paper, we study quadratic complementarity problems, which form a subclass of nonlinear complementarity problems with the nonlinear functions being quadratic polynomial mappings. Quadratic complementarity problems serve as an important bridge linking linear complementarity problems and nonlinear complementarity problems. Various properties on the solution set for a quadratic complementarity problem, including existence, compactness and uniqueness, are studied. Several results are established from assumptions given in terms of the comprising matrices of the underlying tensor, henceforth easily checkable. Examples are given to demonstrate that the results improve or generalize the corresponding quadratic complementarity problem counterparts of the well-known nonlinear complementarity problem theory and broaden the boundary knowledge of nonlinear complementarity problems as well.     

A projection-filter method for solving nonlinear complementarity problems

The Josephy-Newton method attacks nonlinear complementarity problems which consists of solving, possibly inexactly, a sequence of linear complementarity problems. Under appropriate regularity assumptions, this method is known to be locally (superlinearly) convergent. Utilizing the filter method, we presented a new globalization strategy for this Newton method applied to nonlinear complementarity problem without any merit function. The strategy is based on the projection-proximal point and filter methodology. Our linesearch procedure uses the regularized Newton direction to force global convergence by means of a projection step which reduces the distance to the solution of the problem. The resulting algorithm is globally convergent to a solution. Under natural assumptions, locally superlinear rate of convergence was established.     

A new analytical modelling for fractional telegraph equation via Laplace transform

The main aim of the present work is to propose a new and simple algorithm for space-fractional telegraph equation, namely new fractional homotopy analysis transform method (HATM). The fractional homotopy analysis transform method is an innovative adjustment in Laplace transform algorithm (LTA) and makes the calculation much simpler. The proposed technique solves the nonlinear problems without using Adomian polynomials and He’s polynomials which can be considered as a clear advantage of this new algorithm over decomposition and the homotopy perturbation transform method (HPTM). The beauty of the paper is error analysis which shows that our solution obtained by proposed method converges very rapidly to the known exact solution. The numerical solutions obtained by proposed method indicate that the approach is easy to implement and computationally very attractive. Finally, several numerical examples are given to illustrate the accuracy and stability of this method.     

Solution of Delay Differential Equation by Means of Homotopy Analysis Method

The algorithm of approximate analytical solution for delay differential equations (DDE) is obtained via homotopy analysis method (HAM) and modified homotopy analysis method (MHAM). Various examples of linear, nonlinear and system of initial value problems of DDE are solved and the results obtained show that these algorithms are accurate and efficient for the DDE. The convergence of this algorithm is also proved.