“牛顿问题”的归纳及推广初探

在"牛顿问题"的计算中,通过计算消耗原量、消耗品单位时间增加(减少)的数量、第三次主体量、第三次消耗时间四者之间的关系,使土地利用率尽可能最大化,也可以用于其它资源或时间、空间的运算使利益最大化。

Existence and Uniqueness of Nested Regular Quadrilateral Central Configurations

Two cases of the nested configurations in R3 consisting of two regular quadrilaterals are discussed. One case of them do not form central configuration, the other case can be central configuration. In the second case the existence and uniqueness of the central configuration are studied. If the configuration is a central configuration, then all masses of outside layer are equivalent, similar to the masses of inside layer. At the same time the following relation between r(the ratio of the sizes) and mass ratio b = m/m must be satisfied in which the masses at outside layer are not less than the masses at inside layer, and the solution of this kind of central configuration is unique for the given ratio (6) of masses.

Double Pyramidal Central Configurations with a Concave Quadrilateral Base

As for a double pyramidal central configuration in 6-body problems, the case when its base is a concave polygon is studied. By advancing several assumptions according to the definition of double pyramidal central configuration and deducing two theorems and two corollaries on this subject, the essential and sufficient conditions to form a double pyramidal central configuration with a concave quadrilateral base are demonstrated.

Smoothing Newton Algorithm for Nonlinear Complementarity Problem with a PFunction

By using a smoothing function,the P nonlinear complementarity problem(P NCP)can be reformulated as a parameterized smooth equation.A Newton method is proposed to solve this equation.The iteration sequence generated by the proposed algorithm is bounded and this algorithm is proved to be globally convergent under an assumption that the P NCP has a nonempty solution set.This assumption is weaker than the ones used in most existing smoothing algorithms.In particular,the solution obtained by the proposed algorithm is shown to be a maximally complementary solution of the P NCP without any additional assumption.

Existence and uniqueness for a class of double pyramidal central configurations with a concave pentagonal base

Based on some necessary conditions for double pyramidal central configurations with a concave pentagonal base, for any given ratio of masses, the existence and uniqueness of a class of double pyramidal central configurations with a concave pentagonal base in 7-body problems are proved and the range of the ratio between radius and half-height is obtained, within which the 7 bodies involved form a central configuration or form uniquely a central configuration.

Smoothing Newton Algorithm for Solving Generalized Complementarity Problem

The generalized complementarity problem includes the well-known nonlinear complementarity problem and linear complementarity problem as special cases.In this paper, based on a class of smoothing functions, a smoothing Newton-type algorithm is proposed for solving the generalized complementarity problem.Under suitable assumptions, the proposed algorithm is well-defined and global convergent.

Newton-EGMSOR Methods for Solution of Second Order Two-Point Nonlinear Boundary Value Problems

The convergence results of block iterative schemes from the EG （Explicit Group） family have been shown to be one of efficient iterative methods in solving any linear systems generated from approximation equations. Apart from block iterative methods, the formulation of the MSOR （Modified Successive Over-Relaxation） method known as SOR method with red-black ordering strategy by using two accelerated parameters, ω and ω′, has also improved the convergence rate of the standard SOR method. Due to the effectiveness of these iterative methods, the primary goal of this paper is to examine the performance of the EG family without or with accelerated parameters in solving second order two-point nonlinear boundary value problems. In this work, the second order two-point nonlinear boundary value problems need to be discretized by using the second order central difference scheme in constructing a nonlinear finite difference approximation equation. Then this approximation equation leads to a nonlinear system. As well known that to linearize nonlinear systems, the Newton method has been proposed to transform the original system into the form of linear system. In addition to that, the basic formulation and implementation of 2 and 4-point EG iterative methods based on GS （Gauss-Seidel）, SOR and MSOR approaches, namely EGGS, EGSOR and EGMSOR respectively are also presented. Then, combinations between the EG family and Newton scheme are indicated as EGGS-Newton, EGSOR-Newton and EGMSOR-Newton methods respectively. For comparison purpose, several numerical experiments of three problems are conducted in examining the effectiveness of tested methods. Finally, it can be concluded that the 4-point EGMSOR-Newton method is more superior in accelerating the convergence rate compared with the tested methods.

Smoothing Inexact Newton Method for Solving P_0-NCP Problems

Based on a smoothing symmetric disturbance FB-function,a smoothing inexact Newton method for solving the nonlinear complementarity problem with P0-function was proposed.It was proved that under mild conditions,the given algorithm performed global and superlinear convergence without strict complementarity.For the same linear complementarity problem(LCP),the algorithm needs similar iteration times to the literature.However,its accuracy is improved by at least 4 orders with calculation time reduced by almost 50%,and the iterative number is insensitive to the size of the LCP.Moreover,fewer iterations and shorter time are required for solving the problem by using inexact Newton methods for different initial points.

A New Successive Approximation Damped Newton Method for Nonlinear Complementarity Problems

In this paper, we present a new successive approximation damped Newton method for the nonlinear complementarity problem based on its equivalent nonsmooth equations. Under suitable conditions, we obtain the global convergence result of the proposed algorithms. Some numerical results are also reported.

A new approach for Bayesian model averaging

Bayesian model averaging(BMA) is a recently proposed statistical method for calibrating forecast ensembles from numerical weather models.However,successful implementation of BMA requires accurate estimates of the weights and variances of the individual competing models in the ensemble.Two methods,namely the Expectation-Maximization(EM) and the Markov Chain Monte Carlo(MCMC) algorithms,are widely used for BMA model training.Both methods have their own respective strengths and weaknesses.In this paper,we first modify the BMA log-likelihood function with the aim of removing the addi-tional limitation that requires that the BMA weights add to one,and then use a limited memory quasi-Newtonian algorithm for solving the nonlinear optimization problem,thereby formulating a new approach for BMA(referred to as BMA-BFGS).Several groups of multi-model soil moisture simulation experiments from three land surface models show that the performance of BMA-BFGS is similar to the MCMC method in terms of simulation accuracy,and that both are superior to the EM algo-rithm.On the other hand,the computational cost of the BMA-BFGS algorithm is substantially less than for MCMC and is al-most equivalent to that for EM.

An improved nonlinear conjugate gradient method with an optimal property

Conjugate gradient methods have played a special role in solving large scale nonlinear problems. Recently, the author and Dai proposed an efficient nonlinear conjugate gradient method called CGOPT, through seeking the conjugate gradient direction closest to the direction of the scaled memoryless BFGS method. In this paper, we make use of two types of modified secant equations to improve CGOPT method. Under some assumptions, the improved methods are showed to be globally convergent. Numerical results are also reported.

On the stability of the three classes of Newtonian three-body planar periodic orbits

Currently,the fifteen new periodic orbits of Newtonian three-body problem with equal mass were found by Suvakov and Dmitra sinovi[Phys Rev Lett,2013,110:114301]using the gradient descent method with double precision.In this paper,these reported orbits are checked stringently by means of a reliable numerical approach(namely the"Clean Numerical Simulation",CNS),which is based on the arbitrary-order Taylor series method and data in arbitrary-digit precision with a procedure of solution verification.It is found that seven among these fifteen orbits greatly depart from the periodic ones within a long enough interval of time,and are thus most possibly unstable at least.It is suggested to carefully check whether or not these seven unstable orbits are the so-called"computational periodicity"mentioned by Lorenz in 2006.This work also illustrates the validity and great potential of the CNS for chaotic dynamic systems.

A Note on General Frames for Bivariate Interpolation

Newton interpolation and Thiele-type continued fractions interpolation may be the favoured linear interpolation and nonlinear interpolation,but these two interpolations could not solve all the interpolant problems.In this paper,several general frames are established by introducing multiple parameters and they are extensions and improvements of those for the general frames studied by Tan and Fang.Numerical examples are given to show the effectiveness of the results in this paper.

A FULL-NEWTON STEP INFEASIBLE INTERIOR-POINT ALGORITHM FOR P_*(κ) LINEAR COMPLEMENTARITY PROBLEM

This paper proposes a new infeasible interior-point algorithm with full-Newton steps for P_*(κ) linear complementarity problem(LCP),which is an extension of the work by Roos(SIAM J.Optim.,2006,16(4):1110-1136).The main iteration consists of a feasibility step and several centrality steps.The authors introduce a specific kernel function instead of the classic logarithmical barrier function to induce the feasibility step,so the analysis of the feasibility step is different from that of Roos' s.This kernel function has a finite value on the boundary.The result of iteration complexity coincides with the currently known best one for infeasible interior-point methods for P_*(κ) LCP.Some numerical results are reported as well.

Uniqueness of First Order Post-Newtonian Collinear Solutions for Three-Body Problem under a Scalar-Tensor Theory

As a continuing investigation of an earlier work that establishes the cofiinear solutions to the three-body problem with general masses under a scalar-tensor theory, we study these solutions and prove their uniqueness up to the first order post-Newtonian approximation. With the help of observed bounds on the scalar field in the Solar System, we show that the seventh-order polynomial equation determining the distance ratio among the three masses has either one or three positive roots. However, in the case with three positive roots, it is found that two positive roots break down the slow-motion condition for the post-Newtonian approximation so that only one positive root is physically valid. The resulting uniqueness suggests that the locations of the three masses are very close to their Newtonian positions with post-Newtonian corrections of general relativity and the scalar field. We also prove that, in the framework of the scalar-tensor theory, the angular velocity of the collinear configuration is always less than the Newtonian one when all other parameters are fixed. These results are valid only for three-body systems where upper-bounds on the scalar field are compatible with those of the Solar System.