具III类功能反应的非自治捕食扩散系统的全局稳定性(英文)

讨论了一类具有扩散率和 III类功能性反应的非自治捕食系统 ,证明了在适当条件下 ,系统是持久的 ,进一步如果系统是周期系统 ,则在一定条件下存在惟一全局稳定的周期解 .     

周期二维Lotka—Volterra系统的一些新结果

该文研究周期二维Lotka－Volterra捕食食饵系统解的有界性，持续生存性以及正周期解的存在性和全局稳定性．并将结果推广到食饵有补充的周期二维Lotka－Volterra竞争系统上去，得到了一系列新的结果，改进和推广了文[1—3]的主要结论．     

A Finite Algorithm for Global Minimization of Separable Concave Programs

Researchers first examined the problem of separable concave programming more than thirty years ago, making it one of the earliest branches of nonlinear programming to be explored. This paper proposes a new algorithm that finds the exact global minimum of this problem in a finite number of iterations. In addition to proving that our algorithm terminates finitely, the paper extends a guarantee of finiteness to all branch-and-bound algorithms for concave programming that (1) partition exhaustively using rectangular subdivisions and (2) branch on the incumbent solution when possible. The algorithm uses domain reduction techniques to accelerate convergence; it solves problems with as many as 100 nonlinear variables, 400 linear variables and 50 constraints in about five minutes on an IBM RS/6000 Power PC. An industrial application with 152 nonlinear variables, 593 linear variables, and 417 constraints is also solved in about ten minutes.     

Convergence analysis of time-point relaxation iterates for linear systems of differential equations

We study convergence properties of time-point relaxation (TR) Runge-Kutta methods for linear systems of ordinary differential equations. TR methods are implemented by decoupling systems in Gauss-Jacobi, Gauss-Seidel and successive overrelaxation modes (continuous-time iterations) and then solving the resulting subsystems by means of continuous extensions of Runge-Kutta (CRK) methods (discretized iterations). By iterating to convergence, these methods tend to the same limit called diagonally split Runge-Kutta (DSRK) method. We prove that TR methods are equivalent to decouple in the same modes the linear algebraic system obtained by applying DSRK limit method. This issue allows us to study the convergence of TR methods by using standard principles of convergence of iterative methods for linear algebraic systems. For a particular problem regions of convergence are plotted.     

Affine scaling algorithm fails for semidefinite programming

In this paper, we introduce an affine scaling algorithm for semidefinite programming (SDP), and give an example of a semidefinite program such that the affine scaling algorithm converges to a non-optimal point. Both our program and its dual have interior feasible solutions and unique optimal solutions which satisfy strict complementarity, and they are non-degenerate everywhere.     

On a new system of nonlinear A-monotone multivalued variational inclusions

In this paper, we introduce and study a new system of nonlinear A-monotone multivalued variational inclusions in Hilbert spaces. By using the concept and properties of A-monotone mappings, and the resolvent operator technique associated with A-monotone mappings due to Verma, we construct a new iterative algorithm for solving this system of nonlinear multivalued variational inclusions associated with A-monotone mappings in Hilbert spaces. We also prove the existence of solutions for the nonlinear multivalued variational inclusions and the convergence of iterative sequences generated by the algorithm. Our results improve and generalize many known corresponding results.     

ON THE CONVERGENCE OF THE RELAXATION METHODS FOR POSITIVE DEFINITE LINEAR SYSTEMS

1.IntroductionTheclassicaliterativemethods,suchastheJacobimethod,theGauss-SeidelmethodandtheSORmethod,aswellastheirsymmetrizedvariants,playanimportantroleforsolvingthelargesparsesystemoflinearequationsInaccordancewiththebasicextrapolationprincipleofthelineariterativemethod,Hadjidimos[1]furtherproposedaclassofacceleratedoverrelaxation(AOR)methodforsolyingthelinearsystem(1.1)in1978.Thismethodincludestwoarbitraryparameters,andtheirsuitablechoicesnotonlycannaturallyrecovertheJacobi,theGauss-S…     

Products of compact filters and applications to classical product theorems

Two results on product of compact filters are shown to be the common principle behind a surprisingly large number of theorems.     

An extended continuous Newton method

This paper describes a numerical realization of an extended continuous Newton method defined by Diener. It traces a connected set of locally one-dimensional trajectories which contains all critical points of a smooth functionf: ⁿ . The results show that the method is effectively applicable.The authors would like to thank L. C. W. Dixon for pointing out some errors in the original version of this paper and for several suggestions of improvements.     

On consistency of bounding operations in deterministic global optimization

This technical comment refers to the discussion of strong consistency of several bounding procedures in Lemma 2.1 and Proposition 2.1 of Ref. 1. A necessary clarification is given of the notion of convergence _q in Lemma 2.1, and a derivation of Proposition 2.1 is presented that includes a new and simple consistency proof of the classical bounding by convex envelopes used in many branch-and-bound procedures.